Toggle navigation
Contest Tasks
Submissions
Q & A
Dashboard
Sign in
Sign up
Results of submission #294636
Back to Submissions List
Problem
Total Time (ms)
Max Memory (RSS, KiB)
Verdict
Score
2195. C. 粉刷護欄
39656
16948
Time Limit Exceeded
55
Subtask Results
Subtask no.
Testdata Range
Constraints
Score
1
0~9
$n\leq 10, \{a_1,a_2,\dots,a_n\}=\{b_1,b_2,\dots,b_n\}=\{0,1,2\dots,n-1\}$
22
/ 22
2
0~19
$n\leq 100$
33
/ 33
3
0~39
無額外限制
0
/ 45
Testdata Results
Testdata no.
Subtasks
Time (ms)
Memory (RSS, KiB)
Verdict
Score
0
1
2
3
000
0.0
3368
Accepted
100
1
1
2
3
000
0.0
3432
Accepted
100
2
1
2
3
000
0.0
3428
Accepted
100
3
1
2
3
000
0.0
3288
Accepted
100
4
1
2
3
000
0.0
3300
Accepted
100
5
1
2
3
000
0.0
3328
Accepted
100
6
1
2
3
000
0.0
3424
Accepted
100
7
1
2
3
000
0.0
3304
Accepted
100
8
1
2
3
000
0.0
3504
Accepted
100
9
1
2
3
000
0.0
3496
Accepted
100
10
2
3
000
0.0
3444
Accepted
100
11
2
3
000
0.0
3416
Accepted
100
12
2
3
000
0.0
3488
Accepted
100
13
2
3
000
0.0
3496
Accepted
100
14
2
3
000
0.0
3340
Accepted
100
15
2
3
000
0.0
3448
Accepted
100
16
2
3
000
0.0
3324
Accepted
100
17
2
3
000
0.0
3484
Accepted
100
18
2
3
000
0.0
3468
Accepted
100
19
2
3
000
0.0
3380
Accepted
100
20
3
1980.0
13052
Time Limit Exceeded
0
21
3
1976.0
6256
Time Limit Exceeded
0
22
3
1980.0
5464
Time Limit Exceeded
0
23
3
1980.0
5848
Time Limit Exceeded
0
24
3
1980.0
6720
Time Limit Exceeded
0
25
3
1980.0
14356
Time Limit Exceeded
0
26
3
1984.0
15096
Time Limit Exceeded
0
27
3
1984.0
15424
Time Limit Exceeded
0
28
3
1992.0
14648
Time Limit Exceeded
0
29
3
1992.0
15692
Time Limit Exceeded
0
30
3
1984.0
16172
Time Limit Exceeded
0
31
3
1984.0
14432
Time Limit Exceeded
0
32
3
1984.0
15612
Time Limit Exceeded
0
33
3
1976.0
15300
Time Limit Exceeded
0
34
3
1992.0
16456
Time Limit Exceeded
0
35
3
1992.0
16236
Time Limit Exceeded
0
36
3
1980.0
14380
Time Limit Exceeded
0
37
3
1980.0
14684
Time Limit Exceeded
0
38
3
1980.0
16948
Time Limit Exceeded
0
39
3
1976.0
15452
Time Limit Exceeded
0
Submitter:
Kevin_Zhang
Compiler:
c++14
Code Length:
1.7 KB
Back to Top