| # | Name | ||
|---|---|---|---|
| A |
standard input/output
1 s, 256 MB
|
|
|
| B |
standard input/output
2 s, 256 MB
|
|
|
| C |
standard input/output
2 s, 256 MB
|
|
|
| D |
standard input/output
15 s, 1024 MB
|
|
|
| E |
standard input/output
1 s, 256 MB
|
|
|
| F |
standard input/output
3 s, 256 MB
|
|
|
| G |
standard input/output
4 s, 512 MB
|
|
|
| H |
standard input/output
3 s, 256 MB
|
|
|
| I |
standard input/output
1 s, 256 MB
|
|
|
| J |
standard input/output
8 s, 1024 MB
|
|
|
| K |
standard input/output
4 s, 256 MB
|
|
|
| L |
standard input/output
1 s, 256 MB
|
|
|
| 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.
|