QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#653705	#9176. Non-Interactive Nim	woodie_0064^#	WA	38ms	3784kb	C++20	932b	2024-10-18 20:31:40	2024-10-18 20:31:59

Judging History

你现在查看的是最新测评结果

[2024-10-18 20:31:59]
评测

测评结果：WA
用时：38ms
内存：3784kb

查看

[2024-10-18 20:31:40]
提交

answer

#include <bits/stdc++.h>
#define bit(x) (1LL << (x))
using namespace std;
const int N = 1e5 + 3;
typedef long long ll;


void work(){
	int n;cin >> n;
	vector <ll> a(n);
	for(auto &x : a) {
		cin >> x;
	}
	vector <vector <int>> cnt(60);
	vector <pair <int,ll>> ans;
	for(int j = 59;j >= 0;j--) {
		vector <int> cnt;
		for(int i = 0;i < n;i++) {
			if(a[i] & bit(j)) {
				cnt.push_back(i);
				if((int)cnt.size() > 2) {
					cout << "-1\n";
					return;
				}
			}
		}
		if(cnt.size() == 0) continue;
		ll now = a[cnt[0]] & a[cnt[1]];
		ans.push_back({cnt[0],now});
//		cout << now << '\n';
		a[cnt[0]] -= now;
		a[cnt[1]] -= now;
	} 
	cout <<(int)ans.size() << '\n';
	for(auto &[x,y] : ans) cout << x + 1 << ' ' << y << '\n';
}


int main(){
//	freopen("test.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	cin >> T;
	while(T--){
		work();
	}	
	return 0;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3560kb

input:

output:

result:

ok OK 1 yes 1 no (2 test cases)

Test #2:

score: 0

Accepted

time: 24ms

memory: 3564kb

input:

output:

result:

ok OK 50000 yes 0 no (50000 test cases)

Test #3:

score: 0

Accepted

time: 38ms

memory: 3784kb

input:

50000
2
89846347117873058 89846347117873058
2
416235892302498917 416235892302498917
2
332154513003612985 332154513003612985
2
43960216631774959 43960216631774959
2
353215896487285554 353215896487285554
2
38296945667390613 38296945667390613
2
209150071115726640 209150071115726640
2
48610805835417777 ...

output:

1
1 89846347117873058
1
1 416235892302498917
1
1 332154513003612985
1
1 43960216631774959
1
1 353215896487285554
1
1 38296945667390613
1
1 209150071115726640
1
1 48610805835417777
1
1 211544111448330513
1
1 25910837432700249
1
1 332285940128117259
1
1 350363936612994860
1
1 243778347549648401
1
1 21...

result:

ok OK 50000 yes 0 no (50000 test cases)

Test #4:

score: 0

Accepted

time: 21ms

memory: 3568kb

input:

output:

result:

ok OK 33333 yes 0 no (33333 test cases)

Test #5:

score: 0

Accepted

time: 26ms

memory: 3568kb

input:

output:

result:

ok OK 33333 yes 0 no (33333 test cases)

Test #6:

score: 0

Accepted

time: 20ms

memory: 3548kb

input:

output:

result:

ok OK 33333 yes 0 no (33333 test cases)

Test #7:

score: 0

Accepted

time: 30ms

memory: 3580kb

input:

output:

result:

ok OK 33333 yes 0 no (33333 test cases)

Test #8:

score: 0

Accepted

time: 35ms

memory: 3532kb

input:

33333
3
75939333264163319 70286858371473560 140878147161481583
3
279663769504813403 468263081333160675 404772552081894328
3
89355125865512126 7804515715434520 82980318957417638
3
295120670202585395 334743633442856703 53274775335976908
3
166213426772161350 398865696845176129 560570643782577671
3
9560...

output:

3
1 73265311027085671
2 67612836134395912
1 2674022237077648
3
2 296685931955120800
1 171577149378039875
1 108086620126773528
3
1 82265464553747622
1 7089661311764504
2 714854403670016
3
1 288294764154732595
2 46448869288124108
1 6825906047852800
3
2 396611456927796225
1 163959186854781446
1 2254239...

result:

ok OK 33333 yes 0 no (33333 test cases)

Test #9:

score: 0

Accepted

time: 21ms

memory: 3576kb

input:

output:

result:

ok OK 16671 yes 8329 no (25000 test cases)

Test #10:

score: 0

Accepted

time: 22ms

memory: 3584kb

input:

output:

result:

ok OK 19664 yes 5336 no (25000 test cases)

Test #11:

score: 0

Accepted

time: 25ms

memory: 3608kb

input:

25000
4
5 14 14 5
4
9 7 12 2
4
8 13 7 2
4
15 13 7 5
4
2 7 2 7
4
10 5 9 6
4
10 9 14 13
4
15 14 3 2
4
11 8 8 11
4
5 12 7 14
4
12 15 15 12
4
4 11 7 8
4
7 1 15 9
4
13 2 9 6
4
13 13 2 2
4
5 11 5 11
4
15 5 11 1
4
3 8 7 12
4
7 12 8 3
4
5 11 8 6
4
14 9 9 14
4
7 1 13 11
4
13 6 10 1
4
8 2 15 5
4
8 7 11 4
4
7 ...

output:

result:

ok OK 20719 yes 4281 no (25000 test cases)

Test #12:

score: 0

Accepted

time: 26ms

memory: 3524kb

input:

25000
4
22 3 6 19
4
2 19 1 16
4
11 3 11 3
4
11 29 29 11
3
16 15 31
4
15 25 9 31
4
30 8 8 30
4
15 25 24 14
4
28 6 3 25
4
12 15 15 12
4
4 9 25 20
4
20 15 4 31
4
12 25 23 2
4
12 24 9 29
4
10 13 17 22
4
23 14 5 28
4
18 15 8 21
4
8 9 13 12
4
19 16 27 24
4
3 3 14 14
4
15 11 12 8
4
10 29 24 15
4
8 23 18 13...

output:

result:

ok OK 21053 yes 3947 no (25000 test cases)

Test #13:

score: 0

Accepted

time: 27ms

memory: 3636kb

input:

25000
4
42 28 60 10
4
24 36 46 18
4
4 3 32 39
4
52 22 19 49
4
21 37 23 39
4
36 42 21 27
4
33 41 46 38
4
29 33 12 48
4
34 23 25 44
4
19 57 53 31
4
45 6 2 41
4
18 25 36 47
4
48 44 59 39
4
42 10 53 21
4
12 43 26 61
4
23 41 30 32
4
35 62 39 58
4
44 17 53 8
4
32 53 1 20
4
10 23 1 28
4
55 61 54 60
4
57 15...

output:

result:

ok OK 21323 yes 3677 no (25000 test cases)

Test #14:

score: 0

Accepted

time: 13ms

memory: 3572kb

input:

16666
5
2 1 2 3 2
6
3 1 2 1 2 3
6
1 3 1 2 3 2
5
2 3 1 2 2
6
3 3 1 1 3 3
5
2 3 3 1 3
6
3 3 3 3 2 2
6
3 2 3 1 2 1
6
3 2 1 3 2 1
5
3 2 3 3 1
5
1 2 3 2 2
6
2 1 1 1 2 1
6
2 1 1 3 3 2
6
3 1 1 2 2 3
6
3 2 1 1 2 3
6
3 1 1 3 2 2
5
3 1 3 3 2
6
2 1 3 3 2 1
6
1 3 1 3 2 2
6
3 2 2 1 3 1
6
2 2 3 1 3 1
6
3 3 1 3 1 ...

output:

-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
...

result:

ok OK 0 yes 16666 no (16666 test cases)

Test #15:

score: -100

Wrong Answer

time: 14ms

memory: 3524kb

input:

16666
6
1 2 2 3 7 5
6
4 7 2 4 1 4
6
5 7 5 5 1 3
6
6 3 2 6 7 6
6
5 4 4 7 3 1
6
6 3 3 2 7 3
6
3 5 3 6 1 2
6
1 1 3 7 6 2
5
6 4 7 1 4
6
7 5 7 7 1 3
6
3 5 2 4 1 1
6
3 4 5 1 7 4
6
6 1 1 6 6 6
5
2 6 6 5 7
6
4 2 5 2 2 3
5
7 1 2 7 3
6
1 1 1 4 6 3
6
7 1 3 2 2 5
6
7 4 4 3 5 1
6
7 7 3 7 3 7
6
4 4 3 1 3 1
6
3 3 ...

output:

-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
3
1 7
3 2
2 1
-1
-1
-1
-1
3
1 4
3 3
4 1
3
3 4
1 3
4 1
3
2 4
4 2
1 1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
3
2 6
1 2
3 1
-1
3
1 4
4 2
3 1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
3
1 5
2 3
3 1
-1
-1
-...

result:

wrong answer judge has answer but participant doesn't (test case 660)