Toggle navigation
Bulletin
Problems
Submissions
Contests
Discuss
About
Rank
Sign in
Sign up
×
Close
NTUCPC Challenge! #1 題解公開!
連結
IOIC 2025 題目已公開!
連結
程式解題社網站
程式解題社網站
上線了!
Rejudge 公告
23
已加強測資並 rejudge
Results of submission #71761
Back to Submissions List
Problem
Total Time (ms)
Max Memory (RSS, KiB)
Verdict
Score
20. 區間連通塊個數
780
4608
Accepted
100
Subtask Results
Subtask no.
Testdata Range
Constraints
Score
1
0
範例測資
0
/ 0
2
0~15
$N, M, Q \le 10^ 3$
20
/ 20
3
0~21
$N, M \le 10^ 3$
25
/ 25
4
0~15, 22~27
$N, M, Q \le 2 \times 10^ 4$
15
/ 15
5
0~33
無額外限制
40
/ 40
Testdata Results
Testdata no.
Subtasks
Time (ms)
Memory (VSS, KiB)
Memory (RSS, KiB)
Verdict
Score
0
1
2
3
4
5
000
2.1
6500
3456
Accepted
100
1
2
3
4
5
000
3.6
6500
3456
Accepted
100
2
2
3
4
5
000
3.8
6500
3456
Accepted
100
3
2
3
4
5
000
3.9
6500
3456
Accepted
100
4
2
3
4
5
000
3.7
6500
3456
Accepted
100
5
2
3
4
5
000
3.7
6500
3456
Accepted
100
6
2
3
4
5
000
3.6
6500
3456
Accepted
100
7
2
3
4
5
000
4.7
6500
3456
Accepted
100
8
2
3
4
5
000
4.2
6500
3456
Accepted
100
9
2
3
4
5
000
3.8
6500
3456
Accepted
100
10
2
3
4
5
000
4.7
6500
3456
Accepted
100
11
2
3
4
5
000
4.8
6500
3456
Accepted
100
12
2
3
4
5
000
4.4
6500
3456
Accepted
100
13
2
3
4
5
000
4.8
6500
3456
Accepted
100
14
2
3
4
5
000
4.9
6500
3456
Accepted
100
15
2
3
4
5
000
4.9
6500
3456
Accepted
100
16
3
5
00
22.6
6500
3456
Accepted
100
17
3
5
00
14.8
6500
3456
Accepted
100
18
3
5
00
18.9
6500
3456
Accepted
100
19
3
5
00
13.9
6500
3456
Accepted
100
20
3
5
000
9.6
6500
3456
Accepted
100
21
3
5
00
45.7
6500
3456
Accepted
100
22
4
5
00
30.7
6820
3456
Accepted
100
23
4
5
00
14.1
6652
3456
Accepted
100
24
4
5
00
31.2
6788
3456
Accepted
100
25
4
5
00
30.1
7096
3456
Accepted
100
26
4
5
00
29.3
7096
3456
Accepted
100
27
4
5
00
29.6
7096
3456
Accepted
100
28
5
00
71.2
8380
4608
Accepted
100
29
5
00
25.3
7768
4608
Accepted
100
30
5
00
49.8
7376
4608
Accepted
100
31
5
00
90.6
9124
4608
Accepted
100
32
5
00
92.6
9124
4608
Accepted
100
33
5
00
94.3
9124
4608
Accepted
100
Submitter:
餘切
Compiler:
c++23
Code Length:
8.35 KB
Back to Top