searcharrow_forward
jjaewon
Diamond IV 27.42%
19,511,761 / 71,157,930−51,646,169
Diamond IV 27.42%19,511,761 / 71,157,930−51,646,169
레벨
문제EXP
▪ B5
51.9%2,4000.0%
▪ B4
10.4%6720.0%
▪ B3
51.9%4,7700.0%
▪ B2
51.9%6,8700.0%
▪ B1
51.9%9,9600.0%
▪ S5
72.7%20,3630.0%
▪ S4
20.8%8,5520.0%
▪ S3
93.4%56,9610.0%
▪ S2
103.8%94,3000.1%
▪ S1
135.0%183,8850.1%
▪ G5
155.7%319,3200.2%
▪ G4
103.8%321,4500.2%
▪ G3
72.7%340,8930.2%
▪ G2
218.0%1,554,4831.0%
▪ G1
114.2%1,241,7350.8%
▪ P5
3212.3%5,526,8483.7%
▪ P4
166.1%4,241,8722.8%
▪ P3
218.0%8,573,8805.7%
▪ P2
166.1%10,092,6726.7%
▪ P1
155.7%14,665,9059.8%
▪ D5
186.9%27,366,58818.3%
▪ D4
72.7%16,602,39711.1%
▪ D3
41.5%14,847,2889.9%
▪ D2
31.1%17,482,68011.7%
▪ D1
10.4%9,178,4076.1%
▪ R5
10.4%14,501,8839.7%
▪ R4
00.0%00.0%
▪ R3
00.0%00.0%
▪ R2
00.0%00.0%
▪ R1
00.0%00.0%
태그
문제EXP
▪ 자료 구조
9235.2%89,476,76259.8%
▪ 세그먼트 트리
6023.0%48,739,53732.6%
▪ 다이나믹 프로그래밍
5019.2%42,183,31528.2%
▪ 트리
2710.3%40,465,96127.0%
▪ 우선순위 큐
83.1%25,903,67917.3%
▪ 그리디 알고리즘
145.4%24,821,22016.6%
▪ 그래프 이론
3212.3%24,171,94816.2%
▪ 분리 집합
166.1%24,053,22716.1%
▪ 이분 탐색
2710.3%21,791,31814.6%
▪ 분할 정복
135.0%20,269,09013.5%
▪ 느리게 갱신되는 세그먼트 트리
114.2%13,709,7149.2%
▪ 오프라인 쿼리
145.4%11,049,3267.4%
▪ 최소 스패닝 트리
72.7%10,917,2367.3%
▪ 병렬 이분 탐색
51.9%9,755,1176.5%
▪ 함수 개형을 이용한 최적화
20.8%9,539,3826.4%
더 보기