Submission #1834511
Source Code Expand
#include <cstdio> #include <vector> #define repeat(i, n) for (int i = 0; (i) < int(n); ++(i)) #define repeat_reverse(i, n) for (int i = (n)-1; (i) >= 0; --(i)) using namespace std; int main() { // input int n; scanf("%d", &n); vector<int> a(n); repeat (i, n) scanf("%d", &a[i]); // solve int sum_a = 0; vector<bool> cnt(30); for (int a_i : a) { sum_a ^= a_i; cnt[__builtin_ctz(a_i)] = true; } int result = 0; repeat_reverse (i, 30) { if (sum_a & (1 << i)) { if (not cnt[i]) { result = -1; break; } else { result += 1; sum_a ^= (1 << (i + 1)) - 1; } } } // output printf("%d\n", result); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cheating Nim |
User | kimiyuki |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 821 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:9:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int n; scanf("%d", &n); ^ ./Main.cpp:10:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] vector<int> a(n); repeat (i, n) scanf("%d", &a[i]); ^
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 | 13 ms | 640 KB |
003.txt | AC | 6 ms | 512 KB |
004.txt | AC | 6 ms | 384 KB |
005.txt | AC | 5 ms | 384 KB |
006.txt | AC | 13 ms | 640 KB |
007.txt | AC | 13 ms | 640 KB |
008.txt | AC | 13 ms | 640 KB |
009.txt | AC | 13 ms | 640 KB |
010.txt | AC | 13 ms | 640 KB |
011.txt | AC | 13 ms | 640 KB |
012.txt | AC | 13 ms | 640 KB |
013.txt | AC | 12 ms | 640 KB |
014.txt | AC | 13 ms | 640 KB |
015.txt | AC | 13 ms | 640 KB |
016.txt | AC | 13 ms | 640 KB |
017.txt | AC | 13 ms | 640 KB |
018.txt | AC | 13 ms | 640 KB |
019.txt | AC | 13 ms | 640 KB |
020.txt | AC | 13 ms | 640 KB |
021.txt | AC | 2 ms | 256 KB |
022.txt | AC | 2 ms | 256 KB |
023.txt | AC | 12 ms | 640 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |