Submission #1000734
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()
#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))
// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD
// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;
int n;
int a[125252];
int m;
int main(){
scanf("%d",&n);
REP(i,n)scanf("%d",a+i);
int base = 1<<30;
int ans = 0;
REP(_,30){
base>>=1;
sort(a,a+n);
m = 0;
REP(i,n){
if(i<n-2 && a[i]==a[i+1]){
++i;
}else{
a[m++] = a[i];
}
}
n = m;
int x = lower_bound(a,a+n,base)-a;
if((n-x)%2==1){
// should eat
if(a[x]==base){
// eat
a[x]--;
ans++;
x++;
}else{
puts("-1");
return 0;
}
}
FOR(i,x,n)a[i]^=base;
}
printf("%d\n",ans);
return 0;
}
Submission Info
Submission Time
2016-11-28 12:43:21+0900
Task
C - Cheating Nim
User
rickytheta
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1499 Byte
Status
WA
Exec Time
44 ms
Memory
768 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:39:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:40:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,n)scanf("%d",a+i);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 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
WA
2 ms
256 KB
001.txt
AC
2 ms
256 KB
002.txt
AC
16 ms
640 KB
003.txt
WA
11 ms
512 KB
004.txt
AC
19 ms
384 KB
005.txt
AC
8 ms
384 KB
006.txt
WA
20 ms
768 KB
007.txt
WA
28 ms
640 KB
008.txt
WA
27 ms
640 KB
009.txt
WA
20 ms
640 KB
010.txt
WA
27 ms
640 KB
011.txt
WA
44 ms
640 KB
012.txt
WA
43 ms
640 KB
013.txt
WA
31 ms
640 KB
014.txt
WA
24 ms
640 KB
015.txt
WA
23 ms
640 KB
016.txt
AC
23 ms
640 KB
017.txt
AC
29 ms
640 KB
018.txt
WA
23 ms
640 KB
019.txt
WA
41 ms
640 KB
020.txt
AC
23 ms
640 KB
021.txt
AC
5 ms
256 KB
022.txt
AC
4 ms
256 KB
023.txt
AC
18 ms
640 KB
example0.txt
AC
3 ms
256 KB
example1.txt
AC
2 ms
256 KB