Submission #236166

#TimeUsernameProblemLanguageResultExecution timeMemory
236166VEGAnnDojave (COCI17_dojave)C++14
56 / 140
4080 ms8952 KiB
#include <bits/stdc++.h> #define sz(x) ((int)x.size()) #define a3 array<int, 3> using namespace std; const int N = (1 << 20); const int oo = 2e9; int a[N], need, m, ans = 0; bool par[N]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); #ifdef _LOCAL freopen("in.txt","r",stdin); #endif // _LOCAL cin >> m; if (m == 1){ cout << 1; return 0; } for (int i = 0; i < (1 << m); i++) cin >> a[i]; need = (1 << m) - 1; for (int l = 0; l < (1 << m); l++){ int xr = 0; fill(par, par + (1 << m), 0); int kol = 0; for (int r = l; r < (1 << m); r++){ xr ^= a[r]; par[a[r]] = 1; if (par[need - a[r]]) kol--; else kol++; if (xr == need){ ans++; } else { if (kol > 0) ans++; } } } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...