CODE FESTIVAL 2016 Grand Final

Submission #1192632

Source codeソースコード

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 100000;
int n, a[N];
bool cmp(int a, int b) {
	return (a & -a) > (b & -b);
}
int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; ++i)
		scanf("%d", a + i);
	sort(a, a + n, cmp);
	int Xor = 0, ans = 0;
	for (int i = 0; i < n; ++i)
		Xor ^= a[i];
	for (int i = 0; i < n; ++i)
		if (Xor & (a[i] & -a[i]))
			Xor ^= 2 * (a[i] & -a[i]) - 1, ++ans;
	printf("%d", Xor == 0 ? ans : -1);
	return 0;
}

Submission

Task問題 C - Cheating Nim
User nameユーザ名 Ibraheem Tuffaha
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 500
Source lengthソースコード長 497 Byte
File nameファイル名
Exec time実行時間 19 ms
Memory usageメモリ使用量 640 KB

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:12:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", a + i);
^

Test case

Set

Set name Score得点 / Max score Cases
Sample - example0.txt,example1.txt
All 500 / 500 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
000.txt AC 1 ms 256 KB
001.txt AC 1 ms 256 KB
002.txt AC 17 ms 640 KB
003.txt AC 9 ms 512 KB
004.txt AC 8 ms 384 KB
005.txt AC 6 ms 384 KB
006.txt AC 19 ms 640 KB
007.txt AC 19 ms 640 KB
008.txt AC 19 ms 640 KB
009.txt AC 19 ms 640 KB
010.txt AC 19 ms 640 KB
011.txt AC 18 ms 640 KB
012.txt AC 19 ms 640 KB
013.txt AC 19 ms 640 KB
014.txt AC 19 ms 640 KB
015.txt AC 19 ms 640 KB
016.txt AC 19 ms 640 KB
017.txt AC 18 ms 640 KB
018.txt AC 19 ms 640 KB
019.txt AC 19 ms 640 KB
020.txt AC 19 ms 640 KB
021.txt AC 3 ms 256 KB
022.txt AC 3 ms 256 KB
023.txt AC 17 ms 640 KB
example0.txt AC 1 ms 256 KB
example1.txt AC 1 ms 256 KB