| 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 |
| agc064_c |
Erase and Divide Game |
AtCoder |
— |
2000ms / 256MB |
| agc064_d |
Red and Blue Chips |
AtCoder |
— |
2000ms / 256MB |
| agc064_e |
Cross Sum Construction |
AtCoder |
— |
3000ms / 256MB |
| agc064_f |
No Permutations |
AtCoder |
— |
8000ms / 256MB |
| agc065_a |
Shuffle and mod K |
AtCoder |
— |
2000ms / 256MB |
| agc065_b |
Erase and Insert |
AtCoder |
— |
2000ms / 256MB |
| agc065_c |
Avoid Half Sum |
AtCoder |
— |
2000ms / 256MB |
| agc065_d |
Not Intersect |
AtCoder |
— |
3000ms / 256MB |
| agc065_e |
One Two Three |
AtCoder |
— |
5000ms / 256MB |
| agc065_f |
Always Perfect |
AtCoder |
— |
2000ms / 256MB |
| agc066_a |
Adjacent Difference |
AtCoder |
— |
2000ms / 256MB |
| agc066_b |
Decreasing Digit Sums |
AtCoder |
— |
2000ms / 256MB |
| agc066_c |
Delete AAB or BAA |
AtCoder |
— |
2000ms / 256MB |
| agc066_d |
A Independent Set |
AtCoder |
— |
2000ms / 256MB |
| agc066_e |
Sliding Puzzle On Tree |
AtCoder |
— |
2000ms / 256MB |
| agc066_f |
Beautiful String |
AtCoder |
— |
2000ms / 256MB |
| agc067_a |
Big Clique Everywhere |
AtCoder |
— |
4000ms / 256MB |
| agc067_b |
Modifications |
AtCoder |
— |
3000ms / 256MB |
| agc067_c |
Divisibility Homomorphism |
AtCoder |
— |
2000ms / 256MB |
| agc067_d |
Unique Matching |
AtCoder |
— |
2000ms / 256MB |