202002 알고리즘 #11 (3학년, SegTree)
0
0
0
:
0
0
:
0
0
| Rank | User | Solved(Score) | Penalty |
A
(8) |
B
(8) |
C
(8) |
D
(8) |
E
(8) |
F
(8) |
G
(8) |
H
(8) |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | gs18012 | 7(56pts) | 22733 |
O
146m
1 miss |
O
130m
1 miss |
O
714m
3 misses |
O
61m
1 miss |
O
623m
2 misses |
O
10715m
2 misses |
X
25 misses
|
O
10124m
1 miss |
| 2 | gs17023 | 5(40pts) | 9650 |
O
598m
1 miss |
O
31m
1 miss |
O
4m
1 miss |
O
4440m
1 miss |
O
4477m
1 miss |
X
1 miss
|
-
|
-
|
| 3 | gs18004 | 4(32pts) | 34607 |
O
5088m
10 misses |
O
4527m
1 miss |
-
|
-
|
O
10159m
2 misses |
O
14553m
1 miss |
-
|
-
|
| SUCCESS RATE (%) |
|
|
|
|
|
|
|
|
|||