Problems
 
 
# Name    
A
standard input/output
2 s, 256 MB
Submit  x19178
B
standard input/output
2 s, 256 MB
Submit  x11515
C
standard input/output
2.5 s, 256 MB
Submit  x8887
D
standard input/output
2 s, 256 MB
Submit  x3139
E
standard input/output
4 s, 256 MB
Submit  x770
F
standard input/output
5 s, 512 MB
Submit  x89
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2025-06-23 18:45:51
Announcement
Problem E. Tree Colorings
*****
In the explanation for the third test case of the example, [g, b, g] is not a valid coloring since the top vertex is unreachable from the bottom vertex without passing through a blue vertex.