Submission #3271024

---

Source Code Expand

#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=a;i<=b;++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tii tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define edge(v,a,b) v[a].pb(b);v[b].pb(a);
ll MOD=1e9+7;
#define INF 2*1e9
#define N 1000010
#define MAX_V 900010
using namespace std;

ll bit[N*2];

ll sum(int i){
    ll s=0;
    while(i>0){
        s+=bit[i];
        i-=i&-i;
    }
    return s;
}
void add(int i,ll x){
    while(i<=N){
        bit[i]+=x;
        i+=i&-i;
    }
}

main(){
    int n;
    cin>>n;
    pii p[N];
    rep(i,n){cin>>p[i].first;p[i].second=i;}
    sort(p,p+n);
    int ans=0;
    rep(i,n){
        ans+=sum(n-p[i].second);
        add(n-p[i].second,1);
    }
    cout<<(ans%3?"No":"Yes");
}

Submission Info

Judge Result