QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#103215	#5750. Siteswap	willow^#	WA	2ms	3604kb	C++14	889b	2023-05-04 19:47:17	2023-05-04 19:47:19

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-05-04 19:47:19]
评测

测评结果：WA
用时：2ms
内存：3604kb

查看

[2023-05-04 19:47:17]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int T, n, a[maxn], vis[maxn];
int main() {
	for(scanf("%d", &T); T --; ) {
		scanf("%d", &n);
		long long le = 0, ri = 0, bo = 0;
		for(int i = 0; i < n; ++ i) {
			scanf("%d", &a[i]);
			vis[i] = 0;
		}
		for(int i = 0; i < n; ++ i) {
			if(vis[i])
				continue;
			if(!a[i])
				continue;
			int pos = i, cnt[2] = {0, 0};
			long long sum = 0, p = pos;
			do {
				vis[pos] = 1;
				cnt[p & 1] = 1;
				sum += a[pos];
				p += a[pos];
				cnt[p & 1] = 1;
				pos = (pos + a[pos]) % n;
				// cerr << p << " ";
			}while(pos != i);
// cerr << endl << i << " " << sum << " " << cnt[0] << " " << cnt[1] << endl;
			if(cnt[0] && cnt[1])
				bo += sum / n;
			else if(cnt[0])
				le += sum / n;
			else if(cnt[1])
				ri += sum / n;
		}
		printf("%lld %lld %lld\n", le, ri, bo);
	}
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 2ms

memory: 3536kb

input:

3
3
1 5 0
6
4 6 4 0 4 0
2
6 4

output:

0 0 2
2 1 0
3 2 0

result:

ok 9 numbers

Test #2:

score: 0

Accepted

time: 2ms

memory: 3600kb

input:

100
10
94 8 4 52 7 53 16 96 29 1
10
23 35 96 34 86 39 16 72 63 96
10
51 2 46 21 15 31 41 28 42 83
10
75 67 64 88 46 98 3 17 14 98
10
24 77 54 48 16 37 23 88 99 84
10
52 93 44 87 84 80 37 22 73 28
10
35 80 96 60 75 19 100 63 54 88
10
38 49 63 68 29 67 3 57 68 48
10
89 57 51 21 61 16 100 73 99 83
10
6...

output:

result:

ok 300 numbers

Test #3:

score: -100

Wrong Answer

time: 2ms

memory: 3604kb

input:

100
54
386 856 526 874 268 682 718 686 344 116 412 25 82 99 203 496 2 949 757 584 713 137 518 782 485 769 852 483 906 918 152 211 561 355 527 591 585 506 57 49 929 767 317 287 475 186 267 199 227 390 124 373 309 444
85
491 676 471 547 85 660 974 510 349 341 89 557 936 180 632 919 810 887 498 426 644...

output:

0 17 437
0 32 485
0 0 559
4 2 413
0 7 490
2 0 510
0 0 424
0 0 514
0 38 386
1 0 473
0 0 667
4 10 507
22 0 490
0 41 472
0 0 580
0 0 526
0 0 441
0 55 423
0 0 467
0 36 523
0 0 517
0 0 565
0 0 486
0 0 492
0 0 495
0 42 519
2 6 437
47 54 302
0 16 510
21 0 482
46 118 358
3 31 334
30 0 355
54 81 367
40 0 559...

result:

wrong answer 4th numbers differ - expected: '16', found: '0'