Submission #1437290
Source Code Expand
#include <bits/stdc++.h> #define ll long long #define INF 1000000005 #define MOD 1000000007 #define EPS 1e-10 #define rep(i,n) for(int i=0;i<(int)n;++i) #define each(a, b) for(auto (a): (b)) #define all(v) (v).begin(),(v).end() #define fi first #define se second #define pb push_back #define show(x) cout <<#x<<" = "<<(x)<<endl #define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl #define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl #define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl using namespace std; typedef pair<int,int>P; const int MAX_N = 100005; bool flag[30]; int main() { int n; cin >> n; vector<int> vec(n); map<int,int> mp; int ans = 0; rep(i,30){ mp[(1 << (i+1)) - 1] = i+1; } rep(i,n){ cin >> vec[i]; ans ^= vec[i]; int res = mp[vec[i]^(vec[i]-1)]; if(res){ flag[res-1] = true; } } int a = 0; for(int i=29;i>=0;i--){ if(ans & (1 << i)){ if(flag[i]){ ans ^= ((1 << (i+1)) - 1); a++; }else{ cout << "-1\n"; return 0; } } } cout << a << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cheating Nim |
User | kopricky |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1313 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, example0.txt, example1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 1 ms | 256 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | AC | 44 ms | 640 KB |
003.txt | AC | 14 ms | 512 KB |
004.txt | AC | 16 ms | 384 KB |
005.txt | AC | 13 ms | 384 KB |
006.txt | AC | 42 ms | 640 KB |
007.txt | AC | 42 ms | 640 KB |
008.txt | AC | 43 ms | 640 KB |
009.txt | AC | 42 ms | 640 KB |
010.txt | AC | 42 ms | 640 KB |
011.txt | AC | 43 ms | 640 KB |
012.txt | AC | 43 ms | 640 KB |
013.txt | AC | 42 ms | 640 KB |
014.txt | AC | 43 ms | 640 KB |
015.txt | AC | 43 ms | 640 KB |
016.txt | AC | 43 ms | 640 KB |
017.txt | AC | 42 ms | 640 KB |
018.txt | AC | 43 ms | 640 KB |
019.txt | AC | 42 ms | 640 KB |
020.txt | AC | 43 ms | 640 KB |
021.txt | AC | 5 ms | 256 KB |
022.txt | AC | 5 ms | 256 KB |
023.txt | AC | 41 ms | 640 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |