| # | Name | ||
|---|---|---|---|
| A |
standard input/output
1 s, 256 MB
|
|
|
| B |
standard input/output
1 s, 256 MB
|
|
|
| C |
standard input/output
1 s, 256 MB
|
|
|
| D |
standard input/output
2 s, 512 MB
|
|
|
| E |
standard input/output
2 s, 256 MB
|
|
|
| F1 |
standard input/output
2 s, 256 MB
|
|
|
| F2 |
standard input/output
2 s, 256 MB
|
|
|
| G |
standard input/output
2 s, 256 MB
|
|
|
| H |
standard input/output
2 s, 256 MB
|
|
|
| Question | Answer | |
|---|---|---|
|
2022-12-17 19:19:32
|
Announcement |
Problem G. Segment Covering
***** **We are considering segments of reals, not of integers. For example, the union of segments [1, 2] and [3, 4] isn't equal to the segment [1, 4].** |
|
2022-12-17 18:12:54
|
Announcement |
Problem D. Same Count One
***** **In the output section, constraints contained a typo: 1<=x_i, z_i<=n, 1<=z_i<=m. It is corrected now (to 1<=x_i, y_i<=n, 1<=z_i<=m). Refresh the page to see the changes** |
|
2022-12-17 18:11:00
|
Announcement |
Problem E. Two Chess Pieces
***** **There was a small mistake in the explanation of the first sample: the first and second pieces were swapped. It's corrected now, refresh the page to see the changes.** |
|
2022-12-17 18:03:27
|
Announcement |
Problem D. Same Count One
***** **There was a bug in the checker in this problem. It is corrected now; all submissions are rejudged. Sorry for this issue.** |