QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#865030	#9917. The Story of Emperor Bie	fanchuanyu	RE	94ms	3584kb	C++14	381b	2025-01-21 14:02:52	2025-01-21 14:02:53

Judging History

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

[2025-01-21 14:02:53]
评测

测评结果：RE
用时：94ms
内存：3584kb

查看

[2025-01-21 14:02:52]
提交

answer

#include <bits/stdc++.h>
using namespace std;
int a[200005];

void solve() {
	int n;
	cin >> n;
	int mx = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		mx = max(mx, a[i]);
	}
	for (int i = 1; i <= n; i++) {
		if (a[i] == mx) {
			cout << i << ' ';
		}
	}
	cout << '\n';
	return ;
}

signed main() {
	int T;
	cin >> T;
	while (T--) {
		solve();
	}
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3584kb

input:

output:

1 
2 
1 2 3

result:

ok 5 number(s): "1 2 1 2 3"

Test #2:

score: 0

Accepted

time: 56ms

memory: 3584kb

input:

10000
25
25 39 31 40 11 29 9 4 42 32 39 5 21 33 19 50 19 20 7 41 13 45 34 23 7
6
33 14 11 25 24 37
6
50 35 17 42 37 10
11
22 17 45 17 48 29 2 42 19 19 50
91
12 27 3 20 37 39 4 48 4 29 44 37 38 11 39 15 38 28 20 19 50 20 48 28 43 6 19 16 7 10 30 44 9 25 13 9 21 8 3 39 11 10 34 28 23 13 49 44 45 4 23 ...

output:

16 
6 
1 
11 
21 70 91 
14 
17 30 
10 
14 17 
31 70 98 
53 66 
19 
11 
7 17 
4 
71 87 
40 79 
96 
2 38 41 66 
2 
46 
2 
1 
14 62 
47 59 60 66 94 
45 
1 5 12 
1 
16 
33 45 
1 
3 45 
4 39 62 
6 
4 
37 75 
54 92 
33 49 76 79 
7 
2 24 27 32 
27 77 
10 
7 34 
41 
9 
88 
68 
2 42 
2 
17 28 
6 
32 
5 
12 
...

result:

ok 15357 numbers

Test #3:

score: 0

Accepted

time: 94ms

memory: 3456kb

input:

100
5000
999999999 303551520 1000000000 786037778 921116838 18370943 1000000000 970529258 479173332 1000000000 53209554 718571072 993385031 999999998 368646468 1000000000 1000000000 995662164 243419220 795364461 999999999 999999998 1000000000 36965093 750670216 223032304 999999998 242604832 55032693...

output:

3 7 10 16 17 23 34 35 37 39 54 65 72 82 92 107 110 117 118 120 123 126 134 135 146 149 151 161 163 168 180 182 185 188 198 212 222 226 232 233 239 243 253 263 267 268 270 275 278 281 285 297 302 327 329 335 338 347 349 358 362 369 371 373 375 376 379 386 390 392 394 396 397 400 407 408 424 435 447 4...

result:

ok 56835 numbers

Test #4:

score: -100

Runtime Error

input:

1
500000
1000000000 261120694 1000000000 992679741 1000000000 1000000000 988746251 1000000000 1000000000 740214363 1000000000 155877906 1000000000 1000000000 1000000000 1000000000 1000000000 826931501 1000000000 313767869 579979378 728984235 1000000000 140465175 405623508 158123859 298122102 1000000...