searcharrow_forward
scw1130
Diamond II 21.66%
37,865,582 / 174,826,800−136,961,218
Diamond II 21.66%37,865,582 / 174,826,800−136,961,218
레벨
문제EXP
▪ B5
595.0%28,3200.0%
▪ B4
332.8%22,1760.0%
▪ B3
11910.2%113,5260.0%
▪ B2
13711.7%188,2380.1%
▪ B1
534.5%105,5760.0%
▪ S5
605.1%174,5400.0%
▪ S4
534.5%226,6280.1%
▪ S3
645.5%405,0560.1%
▪ S2
554.7%518,6500.1%
▪ S1
726.1%1,018,4400.3%
▪ G5
564.8%1,192,1280.3%
▪ G4
584.9%1,864,4100.5%
▪ G3
363.1%1,753,1640.5%
▪ G2
332.8%2,442,7590.7%
▪ G1
413.5%4,628,2851.3%
▪ P5
322.7%5,526,8481.6%
▪ P4
332.8%8,748,8612.5%
▪ P3
463.9%18,780,8805.4%
▪ P2
322.7%20,185,3445.8%
▪ P1
171.5%16,621,3594.7%
▪ D5
403.4%60,814,64017.4%
▪ D4
221.9%52,178,96214.9%
▪ D3
50.4%18,559,1105.3%
▪ D2
60.5%34,965,36010.0%
▪ D1
40.3%36,713,62810.5%
▪ R5
30.3%43,505,64912.4%
▪ R4
00.0%00.0%
▪ R3
00.0%00.0%
▪ R2
00.0%00.0%
▪ R1
00.0%00.0%
태그
문제EXP
▪ 자료 구조
13511.5%126,819,97636.2%
▪ 다이나믹 프로그래밍
18115.4%117,802,92133.6%
▪ 트리
574.9%102,753,03129.3%
▪ 세그먼트 트리
474.0%79,307,85222.6%
▪ 그리디 알고리즘
544.6%70,846,17020.2%
▪ 트리에서의 다이나믹 프로그래밍
161.4%49,136,12014.0%
▪ 이분 탐색
474.0%36,833,45310.5%
▪ 느리게 갱신되는 세그먼트 트리
80.7%34,329,4179.8%
▪ 그래프 이론
13911.9%33,336,4119.5%
▪ 분할 정복
211.8%26,922,6177.7%
▪ 함수 개형을 이용한 최적화
30.3%24,041,2656.9%
▪ 병렬 이분 탐색
100.9%20,323,4705.8%
▪ 오프라인 쿼리
110.9%19,457,3795.6%
▪ 우선순위 큐
171.5%17,939,6635.1%
▪ 센트로이드 분할
60.5%17,323,6564.9%
더 보기