Submission #3378040
Source Code Expand
/* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
/* ---------- Namespace ---------- */
using namespace std;
/* ---------- Type Abbreviation ---------- */
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
#define fst first
#define snd second
/* ---------- conversion ---------- */
#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)
/* ---------- container ---------- */
#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) (LL((v).size()))
#define FIND(v, k) (v).find(k) != (v).end()
#define VFIND(v, k) find(ALL(v), k) != (v).end()
#define gsort(b, e) sort(b, e, greater<decltype(*b)>())
#define SORT(v) sort((v).begin(), (v).end())
#define GSORT(v) sort((v).begin(), (v).end(), greater<decltype((v).front())>())
/* ----------- debug ---------- */
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
return os << "(" << p.fst << "," << p.snd << ")";
}
/* ---------- Constants ---------- */
// const ll MOD = 1e9 + 7;
// const int INF = 1 << 25;
// const ll INF = 1LL << 50;
// const double PI = acos(-1);
// const double EPS = 1e-10;
// const ll dx[4] = {0, -1, 1, 0};
// const ll dy[4] = {-1, 0, 0, 1};
// mt19937 mt(LL(time(0)));
/* ---------- Short Functions ---------- */
template <typename T>
T sq(T a) {
return a * a;
}
template <typename T>
T gcd(T a, T b) {
if (a > b) return gcd(b, a);
return a == 0 ? b : gcd(b % a, a);
}
template <typename T, typename U>
T mypow(T b, U n) {
if (n == 0) return 1;
if (n == 1) return b /* % MOD */;
if (n % 2 == 0) {
return mypow(b * b /* % MOD */, n / 2);
} else {
return mypow(b, n - 1) * b /* % MOD */;
}
}
ll pcnt(ll b) {
return __builtin_popcountll(b);
}
/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */
int main() {
int N;
cin >> N;
int sum = 0;
int a[N];
for (int i = 0; i < N; ++i) {
cin >> a[i];
sum ^= a[i];
a[i] &= -a[i];
}
int ans = 0;
for (int b = 30; b >= 0; --b) {
if (((sum >> b) & 1) == 0) continue;
for (int i = 0; i < N; ++i) {
if (((a[i] >> b) & 1) == 1) {
++ans;
sum ^= (a[i] << 1) - 1;
break;
}
}
}
cout << (sum > 0 ? -1 : ans) << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Cheating Nim |
User |
Tiramister |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
3414 Byte |
Status |
AC |
Exec Time |
43 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 |
43 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 |
40 ms |
640 KB |
007.txt |
AC |
40 ms |
640 KB |
008.txt |
AC |
40 ms |
640 KB |
009.txt |
AC |
40 ms |
640 KB |
010.txt |
AC |
40 ms |
640 KB |
011.txt |
AC |
40 ms |
640 KB |
012.txt |
AC |
40 ms |
640 KB |
013.txt |
AC |
40 ms |
640 KB |
014.txt |
AC |
40 ms |
640 KB |
015.txt |
AC |
40 ms |
640 KB |
016.txt |
AC |
40 ms |
640 KB |
017.txt |
AC |
40 ms |
640 KB |
018.txt |
AC |
41 ms |
640 KB |
019.txt |
AC |
40 ms |
640 KB |
020.txt |
AC |
40 ms |
640 KB |
021.txt |
AC |
5 ms |
256 KB |
022.txt |
AC |
5 ms |
256 KB |
023.txt |
AC |
40 ms |
640 KB |
example0.txt |
AC |
1 ms |
256 KB |
example1.txt |
AC |
1 ms |
256 KB |