Submission #2200958


Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <string.h>
#include <cmath>

using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64,i64> P;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);++(i))

int n;
//Nim  ^ ^ == 0 -> win
i64 a[101010];

int main()
{
	cin >> n;
	for(int i = 0;i < n;i++)
		cin >> a[i];
	int result = 0;
	i64 sum = 0;
	for(int i = 0;i < n;i++)
		sum = sum ^ a[i];
	for(int i = 30;i >= 0;i--)
	{
		int base = (1 << i) - 1;
		for(int j = 0;j < n;j++)
		{
			if(a[j] ^ (a[j] - 1) == base && (sum & (1 << (i - 1))))
			{
				result++;
				sum ^= base;
				break;
			}
		}
	}
	if(result > n) result = -1;
	cout << result << endl;

}
	

	

Submission Info

Submission Time
Task C - Cheating Nim
User niuez
Language C++14 (GCC 5.4.1)
Score 0
Code Size 817 Byte
Status WA
Exec Time 46 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
AC × 18
WA × 8
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 46 ms 1024 KB
003.txt AC 16 ms 768 KB
004.txt WA 17 ms 640 KB
005.txt WA 13 ms 512 KB
006.txt AC 42 ms 1024 KB
007.txt AC 42 ms 1024 KB
008.txt AC 41 ms 1024 KB
009.txt AC 42 ms 1024 KB
010.txt AC 42 ms 1024 KB
011.txt AC 42 ms 1024 KB
012.txt AC 42 ms 1024 KB
013.txt AC 42 ms 1024 KB
014.txt AC 42 ms 1024 KB
015.txt AC 42 ms 1024 KB
016.txt WA 42 ms 1024 KB
017.txt WA 42 ms 1024 KB
018.txt AC 42 ms 1024 KB
019.txt AC 42 ms 1024 KB
020.txt WA 42 ms 1024 KB
021.txt WA 5 ms 256 KB
022.txt WA 5 ms 384 KB
023.txt WA 43 ms 1024 KB
example0.txt AC 1 ms 256 KB
example1.txt AC 1 ms 256 KB