제출 #485082

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
485082		balbit	Dojave (COCI17_dojave)	C++14	126 / 140	1332 ms	82512 KiB

dojave

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 2e6+5;

bool ok[maxn];
unsigned ll hsh[maxn];

signed main(){
    IOS();
    int n;
    mt19937_64 rnd (chrono::steady_clock::now().time_since_epoch().count());
    cin>>n;
    ll N = 1<<n;
    vector<ll> a(N);
//    vector<int> pos(n);
    REP(i, N) {
        hsh[i] = rnd();
    }
    array<map<unsigned ll, int>, 2> cnt; cnt[1][0] = 1;
    ll re = N * (N+1) / 2;
    unsigned ll now = 0;
    REP(i,N) {
        int par = (i/2) % 2;
        cin>>a[i];
        ll to = min(a[i]^(N-1), a[i]);
        now ^= hsh[to];
        re -= cnt[par][now]++;
    }
    cout<<re<<endl;


}

• Subtask 1: 0 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14