Problems
 
 
# Name    
A
standard input/output
2 s, 1024 MB
Submit  x1240
B
standard input/output
2 s, 1024 MB
Submit  x140
C
standard input/output
2 s, 1024 MB
Submit  x87
D
standard input/output
2 s, 1024 MB
Submit  x942
E
standard input/output
2 s, 1024 MB
Submit  x926
F
standard input/output
4 s, 1024 MB
Submit  x723
G
standard input/output
6 s, 1024 MB
Submit  x3
H
standard input/output
6 s, 1024 MB
Submit  x159
I
standard input/output
6 s, 1024 MB
Submit  x1139
J
standard input/output
6 s, 1024 MB
Submit  x51
K
standard input/output
8 s, 1024 MB
Submit  x41
L
standard input/output
12 s, 1024 MB
Submit  x12
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2018-12-08 16:44:03
Submissions for problem G has been rejudged. Sorry for the inconvenience.
2018-12-08 12:39:45
So x and y are a permutation of 1..n in input.
2018-12-08 12:37:46
>> As the statement the given graph contains no loops, but the examples do have loops. >> Loops means self-loops.
2018-12-08 12:37:03
>> Does the bold text of the problem statement mean "each row contains exactly one rook AND each column contains exactly one rook" ? >> Yes.
2018-12-08 12:32:39
Problem I. Distance
*****
Announcement
Extra spaces in your output may lead to 'Wrong Answer'.