Submission #2133620
Source Code Expand
// see https://github.com/LumaKernel/vimfiles/tree/master/snippets/cp-cpp/temp.snip
/// --- .lumrc Template {{{ ///
#if 0
#define assert(...)
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = tuple<ll, ll>;
using P3 = tuple<ll, ll, ll>;
using VI = vector<int>;
using VL = vector<ll>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using VP = vector<P>;
using VS = vector<string>;
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define FOR(i,a,b) for(int i=int(a);i<int(b);++i)
#define FORI(i,a,b) for(int i=int(a);i<=int(b);++i)
#define REP(i,n) FOR(i,0,n)
#define REPI(i,n) FORI(i,0,n)
#define RFOR(i,a,b) for(int i=int(b)-1;i>=int(a);--i)
#define RFORI(i,a,b) for(int i=int(b);i>=int(a);--i)
#define RREP(i,n) RFOR(i,0,n)
#define RREPI(i,n) RFORI(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE(a) (a).erase(unique(ALL(a)),(a).end())
#define PB push_back
#define EACH(i,c) REP(i,(c).size())
#define REACH(i,c) RREP(i,(c).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(ALL(c))
#define BR cout<<"\n";
#ifdef DEBUG
#define dump(...) cerr<<"["<<__LINE__<< "] "<<#__VA_ARGS__<<" = "<<make_tuple(__VA_ARGS__)<<"\n";
#else
#define dump(...)
#endif
#define YES(x) cout<<((x)?"YES":"NO")<<"\n";
#define Yes(x) cout<<((x)?"Yes":"No")<<"\n";
#define yes(x) cout<<((x)?"yes":"no")<<"\n";
inline int omajinai_int_in(){omajinai;int n;cin>>n;return n;}
inline ll omajinai_ll_in(){omajinai;ll n;cin>>n;return n;}
inline string omajinai_string_in(){omajinai;string n;cin>>n;return n;}
inline int int_in(){int n;cin>>n;return n;}
inline ll ll_in(){ll n;cin>>n;return n;}
inline string string_in(){string n;cin>>n;return n;}
#define oini omajinai_int_in()
#define oinl omajinai_ll_in()
#define oins omajinai_string_in()
#define ini int_in()
#define inl ll_in()
#define ins string_in()
#define isInside(y,x) (0<=(y)&&(y)<h&&0<=(x)&&(x)<w)
#define fi(x) (get<0>(x))
#define se(x) (get<1>(x))
#define th(x) (get<2>(x))
#define fo(x) (get<3>(x))
#define fif(x) (get<4>(x))
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '{'; EACH(i, v) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "}"; return o; }
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":", ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream & os, tuple<T...> const & t){ _ot<0>(os, t); return os; }
template <typename T> inline void smax(T &a, T b) { a = a > b ? a : b; }
template <typename T> inline void smin(T &a, T b) { a = a < b ? a : b; }
constexpr double PI = acos(-1);
/// }}}--- ///
constexpr int INF = 1e9+1;
constexpr ll LINF = 1e18+1;
constexpr int MOD = 1e9+7;
int xx=0;
int main() {
dump(0);
int n=ini;
set<int> s;
dump(1);
REP(i,n) {
int a=ini;
xx ^= a;
s.insert(a&-a);
}
int bl = 1;
int ans = 0;
dump(2);
RREP(i, 30) {
if(!!(xx & (1<<i)) == bl) {
if(!s.count(1<<i)) {
cout << -1 << endl;
return 0;
}
bl ^= 1;
ans++;
}
}
dump(3);
cout << ans << endl;
}
//
Submission Info
Submission Time |
|
Task |
C - Cheating Nim |
User |
luma |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
3431 Byte |
Status |
AC |
Exec Time |
44 ms |
Memory |
256 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 |
256 KB |
003.txt |
AC |
15 ms |
256 KB |
004.txt |
AC |
16 ms |
256 KB |
005.txt |
AC |
13 ms |
256 KB |
006.txt |
AC |
43 ms |
256 KB |
007.txt |
AC |
44 ms |
256 KB |
008.txt |
AC |
44 ms |
256 KB |
009.txt |
AC |
44 ms |
256 KB |
010.txt |
AC |
44 ms |
256 KB |
011.txt |
AC |
44 ms |
256 KB |
012.txt |
AC |
44 ms |
256 KB |
013.txt |
AC |
44 ms |
256 KB |
014.txt |
AC |
43 ms |
256 KB |
015.txt |
AC |
44 ms |
256 KB |
016.txt |
AC |
44 ms |
256 KB |
017.txt |
AC |
43 ms |
256 KB |
018.txt |
AC |
44 ms |
256 KB |
019.txt |
AC |
43 ms |
256 KB |
020.txt |
AC |
44 ms |
256 KB |
021.txt |
AC |
5 ms |
256 KB |
022.txt |
AC |
5 ms |
256 KB |
023.txt |
AC |
40 ms |
256 KB |
example0.txt |
AC |
1 ms |
256 KB |
example1.txt |
AC |
1 ms |
256 KB |