std I/O, if-else, for/while, array, STL, binary_search, sort
DP Greedy Tree Graph FFT
題目名稱 | 時間限制 | 記憶體限制(MB) | 配分 | 作者 |
---|---|---|---|---|
p0.Classic safe | 0.1s | 64 | 1000 | 戴偉璿 |
p0. Safes.2(Move Golds) | 0.1s | 64 | 1000 | 李尚哲 |
pA.Ccucomber's annoyance about safe.1 | 1.0s | 64 | 200 | 戴偉璿 |
pA.Ccucomber's annoyance about safe.2 | 1.0s | 64 | 600 | 戴偉璿 |
pA.Ccucomber's annoyance about safe.3 | 1.0s | 64 | 500 | 戴偉璿 |
pB.Ccucomber's annoyance2.1 | 1.0s | 64 | 100 | 戴偉璿 |
pB.Ccucomber's annoyance2.2 | 1.0s | 64 | 600 | 戴偉璿 |
pC. Safe Sorter | 1.0s | 64 | 300 | 李尚哲 |
pD. Vile God's Safe | 1.0s | 64 | 300 | 李卓岳 |
pE. Steal A Safe | 0.5s | 64 | 800 | 李尚哲 |
pF. Safe Sequence(Easy) | 1.0s | 512 | 500 | 李尚哲 |
pF. Safe Sequence(Hard) | 1.0s | 512 | 1250 | 李尚哲 |
pG. Safe Tariff(Easy) | 1.0s | 64 | 600 | 李尚哲 |
pG. Safe Tariff(Hard) | 0.5s | 64 | 1250 | 李尚哲 |
pH. Fourier's safe | 0.2s | 64 | 1000 | 李卓岳 |