Submission #1001135
Source Code Expand
#include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> // get<n>(xxx) #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> // S.insert(M); // if (S.find(key) != S.end()) { } // for (auto it=S.begin(); it != S.end(); it++) { } // auto it = S.lower_bound(M); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> // atoi(xxx) using namespace std; typedef long long ll; //const int dx[4] = {1, 0, -1, 0}; //const int dy[4] = {0, 1, 0, -1}; // const int C ; // const int M = 1000000007; int N; int a[100010]; int b[100010]; int count(int k) { int ans = 0; while (k != 0) { if ((k & 1) == 1) { ans++; } k = (k >> 1); } return ans; } int main () { cin >> N; for (auto i = 0; i < N; i++) { cin >> a[i]; b[i] = (a[i] ^ (a[i] - 1)); // cerr << b[i] << endl; } int x = 0; for (auto i = 0; i < N; i++) { x = x ^ a[i]; } vector<int> V; if (x == 0) { cout << 0 << endl; return 0; } while (x != 0) { V.push_back(x & 1); x = (x >> 1); } bool visited[100]; fill(visited, visited+100, true); int need = 0; for (auto i = 0; i < (int)V.size()-1; i++) { if (V[i+1] != V[i]) { need++; visited[i] = false; } } if (!V.empty()) { visited[(int)V.size()-1] = false; need++; } for (auto i = 0; i < N; i++) { visited[count(b[i])-1] = true; } for (auto i = 0; i < 100; i++) { if (!visited[i]) { cout << "-1" << endl; return 0; } } cout << need << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cheating Nim |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1878 Byte |
Status | AC |
Exec Time | 51 ms |
Memory | 1024 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 | 3 ms | 256 KB |
001.txt | AC | 3 ms | 256 KB |
002.txt | AC | 46 ms | 1024 KB |
003.txt | AC | 16 ms | 768 KB |
004.txt | AC | 18 ms | 640 KB |
005.txt | AC | 15 ms | 512 KB |
006.txt | AC | 45 ms | 1024 KB |
007.txt | AC | 45 ms | 1024 KB |
008.txt | AC | 45 ms | 1024 KB |
009.txt | AC | 45 ms | 1024 KB |
010.txt | AC | 45 ms | 1024 KB |
011.txt | AC | 51 ms | 1024 KB |
012.txt | AC | 45 ms | 1024 KB |
013.txt | AC | 45 ms | 1024 KB |
014.txt | AC | 45 ms | 1024 KB |
015.txt | AC | 45 ms | 1024 KB |
016.txt | AC | 45 ms | 1024 KB |
017.txt | AC | 45 ms | 1024 KB |
018.txt | AC | 45 ms | 1024 KB |
019.txt | AC | 45 ms | 1024 KB |
020.txt | AC | 45 ms | 1024 KB |
021.txt | AC | 6 ms | 256 KB |
022.txt | AC | 7 ms | 384 KB |
023.txt | AC | 44 ms | 1024 KB |
example0.txt | AC | 3 ms | 256 KB |
example1.txt | AC | 3 ms | 256 KB |