searcharrow_forward
onjo0127
Ruby V 44.36%
257,297,381 / 580,075,320−322,777,939
Ruby V 44.36%257,297,381 / 580,075,320−322,777,939
레벨
문제EXP
▪ B5
593.6%28,3200.0%
▪ B4
462.8%30,9120.0%
▪ B3
17210.6%164,0880.0%
▪ B2
21012.9%288,5400.0%
▪ B1
804.9%159,3600.0%
▪ S5
955.8%276,3550.0%
▪ S4
764.7%324,9760.0%
▪ S3
845.2%531,6360.0%
▪ S2
654.0%612,9500.1%
▪ S1
845.2%1,188,1800.1%
▪ G5
784.8%1,660,4640.1%
▪ G4
704.3%2,250,1500.2%
▪ G3
583.6%2,824,5420.3%
▪ G2
311.9%2,294,7130.2%
▪ G1
301.8%3,386,5500.3%
▪ P5
462.8%7,944,8440.7%
▪ P4
372.3%9,809,3290.9%
▪ P3
462.8%18,780,8801.7%
▪ P2
352.2%22,077,7202.0%
▪ P1
311.9%30,309,5372.7%
▪ D5
432.6%65,375,7385.9%
▪ D4
402.5%94,870,8408.5%
▪ D3
241.5%89,083,7288.0%
▪ D2
80.5%46,620,4804.2%
▪ D1
130.8%119,319,29110.7%
▪ R5
181.1%261,033,89423.5%
▪ R4
30.2%68,956,4556.2%
▪ R3
40.2%146,187,68413.1%
▪ R2
20.1%116,584,67810.5%
▪ R1
00.0%00.0%
태그
문제EXP
▪ 자료 구조
19612.1%525,828,76247.3%
▪ 다이나믹 프로그래밍
22213.7%407,728,39636.7%
▪ 세그먼트 트리
986.0%351,409,12731.6%
▪ 트리
734.5%291,059,99326.2%
▪ 그리디 알고리즘
855.2%261,196,34123.5%
▪ 분할 정복
342.1%233,542,04921.0%
▪ 그래프 이론
16910.4%226,538,43820.4%
▪ 이분 탐색
674.1%149,460,55013.4%
▪ 오프라인 쿼리
281.7%136,130,80912.2%
▪ 분리 집합
291.8%122,374,80611.0%
▪ 트리에서의 다이나믹 프로그래밍
221.4%106,746,2659.6%
▪ 분할 정복을 사용한 최적화
40.2%99,528,8099.0%
▪ 병렬 이분 탐색
60.4%82,489,6537.4%
▪ Heavy-light 분할
90.6%82,058,8827.4%
▪ 작은 집합에서 큰 집합으로 합치는 테크닉
80.5%69,466,4226.2%
더 보기