Submission #4030957
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <map> #include <set> #include <string> #include <cmath> #include <iomanip> #include <queue> #include <unordered_map> #include <unordered_set> #include <bitset> #include <cassert> #include <cstring> #include <climits> using namespace std; #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define REP(i, n) FOR(i, 0, n) #define SORT(c) sort((c).begin(), (c).end()) typedef long long ll; typedef pair<int, int> P; typedef vector<int> V; typedef map<int, int> M; constexpr ll INF = 1e18; constexpr ll MOD = 1e9 + 7; constexpr double PI = 3.14159265358979323846; constexpr int dx[] = {0, 0, 1, -1}; constexpr int dy[] = {1, -1, 0, 0}; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, a[112345]; int x = 0; cin >> n; REP(i, n) { cin >> a[i]; x ^= a[i]; } int res = 0; for (int i = 30; i >= 0; i--) { if (!(x & (1 << i))) continue; REP(j, n) { if ((a[j] ^ (a[j] - 1)) == (1 << (i + 1)) - 1) { res++; a[j] = 0; x ^= (1 << (i + 1)) - 1; break; } } } if (x == 0) cout << res << endl; else cout << -1 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cheating Nim |
User | Kats |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1417 Byte |
Status | AC |
Exec Time | 12 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 | 12 ms | 640 KB |
003.txt | AC | 5 ms | 512 KB |
004.txt | AC | 5 ms | 512 KB |
005.txt | AC | 4 ms | 384 KB |
006.txt | AC | 11 ms | 640 KB |
007.txt | AC | 11 ms | 640 KB |
008.txt | AC | 11 ms | 640 KB |
009.txt | AC | 11 ms | 640 KB |
010.txt | AC | 11 ms | 640 KB |
011.txt | AC | 11 ms | 640 KB |
012.txt | AC | 11 ms | 640 KB |
013.txt | AC | 11 ms | 640 KB |
014.txt | AC | 11 ms | 640 KB |
015.txt | AC | 11 ms | 640 KB |
016.txt | AC | 11 ms | 640 KB |
017.txt | AC | 11 ms | 640 KB |
018.txt | AC | 11 ms | 640 KB |
019.txt | AC | 11 ms | 640 KB |
020.txt | AC | 11 ms | 640 KB |
021.txt | AC | 2 ms | 256 KB |
022.txt | AC | 2 ms | 256 KB |
023.txt | AC | 11 ms | 640 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |