Problems
 
 
# Name    
A
standard input/output
1.5 s, 1024 MB
Submit  x69
B
standard input/output
1 s, 256 MB
Submit  x8
C
standard input/output
3 s, 256 MB
Submit  x57
D
standard input/output
3.5 s, 256 MB
Submit  x2
E
standard input/output
1 s, 256 MB
Submit  
F
standard input/output
1 s, 256 MB
Submit  x100
G
standard input/output
1 s, 256 MB
Submit  x109
H
standard input/output
1 s, 256 MB
Submit  x141
I
standard input/output
0.5 s, 256 MB
Submit  x153
J
standard input/output
3 s, 256 MB
Submit  x19
K
standard input/output
2 s, 256 MB
Submit  x155
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2019-08-17 22:22:11
Problem G. Hunting leshys
*****
Announcement
Once a leshy has a superior, it can't change. In other words, each leshy appears as inferior to other leshy only once.
2019-08-17 20:55:58
Problem G. Hunting leshys
*****
Announcement
The leshy in charge picks the least powerful one among the ones that are aware of the threat.
2019-08-17 20:54:30
If there are ties among the closest student, pick the one with smaller index (i.e., the first one that appeared in the input)