searcharrow_forward
imeimi2000
Ruby III 80.54%
1,177,352,466 / 1,461,876,840−284,524,374
Ruby III 80.54%1,177,352,466 / 1,461,876,840−284,524,374
레벨
문제EXP
▪ B5
40.3%1,9200.0%
▪ B4
10.1%6720.0%
▪ B3
110.8%10,4940.0%
▪ B2
151.1%20,6100.0%
▪ B1
110.8%21,9120.0%
▪ S5
141.0%40,7260.0%
▪ S4
171.3%72,6920.0%
▪ S3
302.2%189,8700.0%
▪ S2
261.9%245,1800.0%
▪ S1
302.2%424,3500.0%
▪ G5
302.2%638,6400.0%
▪ G4
443.3%1,414,3800.0%
▪ G3
332.5%1,607,0670.0%
▪ G2
342.5%2,516,7820.1%
▪ G1
614.5%6,885,9850.2%
▪ P5
493.7%8,462,9860.2%
▪ P4
745.5%19,618,6580.6%
▪ P3
826.1%33,478,9600.9%
▪ P2
916.8%57,402,0721.6%
▪ P1
1148.5%111,460,8783.2%
▪ D5
1329.8%200,688,3125.7%
▪ D4
1289.5%303,586,6888.6%
▪ D3
916.8%337,775,8029.6%
▪ D2
544.0%314,688,2408.9%
▪ D1
453.4%413,028,31511.7%
▪ R5
473.5%681,588,50119.3%
▪ R4
191.4%436,724,21512.4%
▪ R3
50.4%182,734,6055.2%
▪ R2
40.3%233,169,3566.6%
▪ R1
20.1%186,535,4845.3%
태그
문제EXP
▪ 자료 구조
35226.2%1,376,969,33739.0%
▪ 트리
15711.7%1,139,594,62932.3%
▪ 세그먼트 트리
21616.1%912,886,03125.9%
▪ 다이나믹 프로그래밍
27420.4%910,472,84025.8%
▪ 분할 정복
866.4%653,856,91018.5%
▪ 그래프 이론
19814.8%649,322,17818.4%
▪ 그리디 알고리즘
1249.2%518,404,56314.7%
▪ 느리게 갱신되는 세그먼트 트리
564.2%359,568,35810.2%
▪ 트리에서의 다이나믹 프로그래밍
403.0%347,981,1489.9%
▪ 스플레이 트리
151.1%274,563,6697.8%
▪ 오프라인 쿼리
574.2%248,352,6947.0%
▪ 그래프 탐색
765.7%236,744,4856.7%
▪ 분리 집합
564.2%234,708,5616.6%
▪ 이분 탐색
1027.6%221,215,9036.3%
▪ 작은 집합에서 큰 집합으로 합치는 테크닉
201.5%210,265,6776.0%
더 보기