Problems
 
 
# Name    
A
standard input/output
2.5 s, 256 MB
Submit  x234
B
standard input/output
1 s, 256 MB
Submit  x721
C
standard input/output
1 s, 256 MB
Submit  x862
D
standard input/output
1 s, 256 MB
Submit  x552
E
standard input/output
2.5 s, 256 MB
Submit  x470
F
standard input/output
2.5 s, 256 MB
Submit  x639
G
standard input/output
15 s, 256 MB
Submit  x28
H
standard input/output
1 s, 256 MB
Submit  x909
I
standard input/output
1 s, 256 MB
Submit  x843
J
standard input/output
3 s, 256 MB
Submit  x81
K
standard input/output
4 s, 256 MB
Submit  x19
L
standard input/output
3 s, 256 MB
Submit  x11
M
standard input/output
4 s, 256 MB
Submit  x342
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2018-06-02 17:08:31
Problem A. Careful Thief
*****
does n refer to the limit of the current segment or the whole number of buildings, in the part "he can rob all buildings in the range...."
n = 1e9, the last building.. there will always be 1e9 buildings.
2018-06-02 13:45:19
Problem H. Making Friends
*****
Announcement
There was a mistake in the statement. The correct description is that "Each friend i will be matched with the friend numbered (2 x n - i + 1). The statement will be updated soon".