| 2019 JUST Programming Contest |
|---|
| Finished |
| # | Name | ||
|---|---|---|---|
| A |
standard input/output
8 s, 1024 MB
|
|
|
| B |
standard input/output
1 s, 256 MB
|
|
|
| C |
standard input/output
1.5 s, 256 MB
|
|
|
| D |
standard input/output
1 s, 256 MB
|
|
|
| E |
standard input/output
1 s, 256 MB
|
|
|
| F |
standard input/output
1 s, 256 MB
|
|
|
| G |
standard input/output
1 s, 256 MB
|
|
|
| H |
standard input/output
1 s, 256 MB
|
|
|
| I |
standard input/output
1.5 s, 256 MB
|
|
|
| J |
standard input/output
3 s, 256 MB
|
|
|
| K |
standard input/output
3 s, 256 MB
|
|
|
| L |
standard input/output
1 s, 256 MB
|
|
|
| Question | Answer | |
|---|---|---|
|
2019-03-29 18:40:44
|
There was a small mistake in the problem statement. The correct condition is (r_j - l_j + 1 >= k_j) not (r_j - l_j >= k_j). Sorry for that. Please note that test cases and main correct solution are both correct and not effected by this mistake.
|
|
|
2019-03-29 18:25:17
|
Each element in the array can be negated multiple times.
|
| Name |
|---|


