| agc056_a |
Three Cells per Row and Column |
AtCoder |
— |
2000ms / 256MB |
| agc056_b |
Range Argmax |
AtCoder |
— |
2000ms / 256MB |
| agc056_c |
01 Balanced |
AtCoder |
— |
5000ms / 256MB |
| agc056_d |
Subset Sum Game |
AtCoder |
— |
2000ms / 256MB |
| agc056_e |
Cheese |
AtCoder |
— |
5000ms / 256MB |
| agc056_f |
Degree Sequence in DFS Order |
AtCoder |
— |
2000ms / 256MB |
| agc057_a |
Antichain of Integer Strings |
AtCoder |
— |
2000ms / 256MB |
| agc057_b |
2A + x |
AtCoder |
— |
4000ms / 256MB |
| agc057_c |
Increment or Xor |
AtCoder |
— |
2000ms / 256MB |
| agc057_d |
Sum Avoidance |
AtCoder |
— |
5000ms / 256MB |
| agc057_e |
RowCol/ColRow Sort |
AtCoder |
— |
3000ms / 256MB |
| agc057_f |
Reflection |
AtCoder |
— |
3000ms / 256MB |
| agc058_a |
Make it Zigzag |
AtCoder |
— |
2000ms / 256MB |
| agc058_b |
Adjacent Chmax |
AtCoder |
— |
2000ms / 256MB |
| agc058_c |
Planar Tree |
AtCoder |
— |
2000ms / 256MB |
| agc058_d |
Yet Another ABC String |
AtCoder |
— |
2000ms / 256MB |
| agc058_e |
Nearer Permutation |
AtCoder |
— |
2000ms / 256MB |
| agc058_f |
Authentic Tree DP |
AtCoder |
— |
2000ms / 256MB |
| agc059_a |
My Last ABC Problem |
AtCoder |
— |
2000ms / 256MB |
| agc059_b |
Arrange Your Balls |
AtCoder |
— |
2000ms / 256MB |
| agc059_c |
Guessing Permutation for as Long as Possible |
AtCoder |
— |
2000ms / 256MB |
| agc059_d |
Distinct Elements on Subsegments |
AtCoder |
— |
2000ms / 256MB |
| agc059_e |
Grid 3-coloring |
AtCoder |
— |
2000ms / 256MB |
| agc059_f |
LIDS |
AtCoder |
— |
4000ms / 256MB |
| agc060_a |
No Majority |
AtCoder |
— |
2000ms / 256MB |
| agc060_b |
Unique XOR Path |
AtCoder |
— |
2000ms / 256MB |
| agc060_c |
Large Heap |
AtCoder |
— |
10000ms / 256MB |
| agc060_d |
Same Descent Set |
AtCoder |
— |
6000ms / 256MB |
| agc060_e |
Number of Cycles |
AtCoder |
— |
2000ms / 256MB |
| agc060_f |
Spanning Trees of Interval Graph |
AtCoder |
— |
6000ms / 256MB |
| agc061_a |
Long Shuffle |
AtCoder |
— |
2000ms / 256MB |
| agc061_b |
Summation By Construction |
AtCoder |
— |
2000ms / 256MB |
| agc061_c |
First Come First Serve |
AtCoder |
— |
2000ms / 256MB |
| agc061_d |
Almost Multiplication Table |
AtCoder |
— |
3000ms / 256MB |
| agc061_e |
Increment or XOR |
AtCoder |
— |
2000ms / 256MB |
| agc061_f |
Perfect Strings |
AtCoder |
— |
10000ms / 256MB |
| agc062_a |
Right Side Character |
AtCoder |
— |
2000ms / 256MB |
| agc062_b |
Split and Insert |
AtCoder |
— |
2000ms / 256MB |
| agc062_c |
Mex of Subset Sum |
AtCoder |
— |
2000ms / 256MB |
| agc062_d |
Walk Around Neighborhood |
AtCoder |
— |
4000ms / 256MB |
| agc062_e |
Overlap Binary Tree |
AtCoder |
— |
8000ms / 256MB |
| agc062_f |
Preserve Distinct |
AtCoder |
— |
2000ms / 256MB |
| agc063_a |
Mex Game |
AtCoder |
— |
2000ms / 256MB |
| agc063_b |
Insert 1, 2, 3, ... |
AtCoder |
— |
2000ms / 256MB |
| agc063_c |
Add Mod Operations |
AtCoder |
— |
2000ms / 256MB |
| agc063_d |
Many CRT |
AtCoder |
— |
2000ms / 256MB |
| agc063_e |
Child to Parent |
AtCoder |
— |
4000ms / 256MB |
| agc063_f |
Simultaneous Floor |
AtCoder |
— |
4000ms / 256MB |
| agc064_a |
i i's |
AtCoder |
— |
2000ms / 256MB |
| agc064_b |
Red and Blue Spanning Tree |
AtCoder |
— |
2000ms / 256MB |