Problems
 
 
# Name    
A
standard input/output
1 s, 256 MB
Submit  x700
B
standard input/output
2 s, 256 MB
Submit  x467
C
standard input/output
2 s, 256 MB
Submit  x370
D
standard input/output
15 s, 1024 MB
Submit  x19
E
standard input/output
1 s, 256 MB
Submit  x353
F
standard input/output
3 s, 256 MB
Submit  x599
G
standard input/output
4 s, 512 MB
Submit  x21
H
standard input/output
3 s, 256 MB
Submit  x230
I
standard input/output
1 s, 256 MB
Submit  x426
J
standard input/output
8 s, 1024 MB
Submit  x28
K
standard input/output
4 s, 256 MB
Submit  x163
L
standard input/output
1 s, 256 MB
Submit  x676
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2018-05-20 01:39:40
Time limit has been extended and all submissions have been rejudged.
2018-05-20 01:14:22
Problem statements have been updated. Statements for problem D has been altered to satisfy the previous announcements.
2018-05-19 16:01:57
No two ranges [pi-ai,pi+ai] and [pj-aj,pj+aj] can intersect for any two chosen police stations i and j.
2018-05-19 12:42:55
Each pile must contain at least one stone.