2025 알고리즘 #8 - Dynamic Programming2 (3반)
0
0
0
:
0
0
:
0
0
| Rank | User | Solved(Score) | Penalty |
A
(1) |
B
(1) |
C
(1) |
D
(1) |
E
(1) |
F
(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | gs23059 | 6(6pts) | 62594 |
O
3702m
1 miss |
O
8543m
19 misses |
O
11031m
8 misses |
O
11061m
1 miss |
O
14373m
12 misses |
O
12724m
17 misses |
| 2 | gswhgusco07 | 5(5pts) | 6999 |
O
4m
1 miss |
O
1m
1 miss |
O
6727m
9 misses |
O
6m
1 miss |
O
1m
1 miss |
X
11 misses
|
| 3 | gs23064 | 5(5pts) | 36813 |
O
6457m
1 miss |
O
6456m
1 miss |
O
5811m
2 misses |
O
12206m
1 miss |
O
5763m
1 miss |
-
|
| 4 | gs23037 | 5(5pts) | 47538 |
O
1m
1 miss |
O
10038m
1 miss |
O
10101m
6 misses |
O
13442m
1 miss |
-
|
O
13636m
7 misses |
| 5 | gs23056 | 4(4pts) | 963 |
O
5m
1 miss |
O
6m
1 miss |
O
22m
3 misses |
O
810m
1 miss |
-
|
-
|
| 6 | gs23022 | 4(4pts) | 42622 |
O
10099m
1 miss |
O
12197m
1 miss |
O
10105m
1 miss |
O
10121m
2 misses |
-
|
X
10 misses
|
| 7 | gs23008 | 4(4pts) | 56795 |
O
4284m
4 misses |
O
16167m
1 miss |
O
18691m
6 misses |
O
17413m
1 miss |
-
|
-
|
| 8 | gs23081 | 4(4pts) | 60097 |
O
14429m
1 miss |
O
16561m
1 miss |
O
14455m
6 misses |
O
14472m
1 miss |
-
|
-
|
| 9 | gs23079 | 3(3pts) | 231 |
O
1m
1 miss |
-
|
O
18m
4 misses |
O
32m
4 misses |
X
5 misses
|
-
|
| 10 | gs23012 | 3(3pts) | 15424 |
O
3326m
1 miss |
O
6018m
1 miss |
O
6020m
1 miss |
-
|
-
|
-
|
| 11 | gs23054 | 3(3pts) | 19570 |
O
71m
1 miss |
X
1 miss
|
O
15810m
1 miss |
O
3629m
1 miss |
-
|
-
|
| 12 | gs23089 | 3(3pts) | 20154 |
O
30m
1 miss |
O
1735m
1 miss |
X
3 misses
|
O
18269m
4 misses |
X
1 miss
|
-
|
| 13 | gs23100 | 1(1pts) | 35 |
O
15m
1 miss |
-
|
-
|
-
|
-
|
-
|
| 14 | gs23029 | 1(1pts) | 5809 |
O
5749m
3 misses |
-
|
-
|
-
|
-
|
-
|
| 15 | gs23119 | 1(1pts) | 14477 |
O
14377m
5 misses |
-
|
-
|
-
|
-
|
-
|
| SUCCESS RATE (%) |
|
|
|
|
|
|
|||