pub fn cartesian_tree(reader: impl Read, writer: impl Write)
Expand description
✅ AC 63ms
problem here
§Detail
Case Name | Status | Exec Time |
---|---|---|
example_00 | AC | 0 ± 0 ms |
example_01 | AC | 0 ± 0 ms |
small_00 | AC | 0 ± 0 ms |
small_01 | AC | 0 ± 0 ms |
small_02 | AC | 0 ± 0 ms |
small_03 | AC | 0 ± 0 ms |
small_04 | AC | 0 ± 0 ms |
small_05 | AC | 0 ± 0 ms |
small_06 | AC | 0 ± 0 ms |
small_07 | AC | 0 ± 0 ms |
small_08 | AC | 0 ± 0 ms |
small_09 | AC | 0 ± 0 ms |
random_00 | AC | 63 ± 0 ms |
random_01 | AC | 26 ± 1 ms |
random_02 | AC | 32 ± 0 ms |
random_03 | AC | 24 ± 1 ms |
random_04 | AC | 50 ± 1 ms |
increasing_00 | AC | 58 ± 1 ms |
increasing_01 | AC | 22 ± 0 ms |
decreasing_00 | AC | 57 ± 1 ms |
decreasing_01 | AC | 22 ± 0 ms |
almost-increasing_00 | AC | 57 ± 0 ms |
almost-increasing_01 | AC | 22 ± 0 ms |
almost-decreasing_00 | AC | 57 ± 1 ms |
almost-decreasing_01 | AC | 22 ± 0 ms |