Problems
 
 
# Name    
A
standard input/output
1 s, 256 MB
Submit  x86
B
standard input/output
2 s, 256 MB
Submit  
C
standard input/output
1 s, 256 MB
Submit  x66
D
standard input/output
1 s, 256 MB
Submit  x39
E
standard input/output
2 s, 256 MB
Submit  x69
F
standard input/output
1 s, 256 MB
Submit  
G
standard input/output
3 s, 256 MB
Submit  x2
H
standard input/output
1 s, 256 MB
Submit  x13
I
standard input/output
5 s, 512 MB
Submit  x24
J
standard input/output
1 s, 256 MB
Submit  x31
K
standard input/output
1 s, 256 MB
Submit  x29
L
standard input/output
1 s, 256 MB
Submit  x64
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2019-11-09 15:25:43
Problem G. Large array
*****
in the statement it says( 1 \leq l \leq r \leq n) but in the first test case l = 0 , was there a typo ?
Sorry it is a mistake in the statements
the arrays are 0-indexed

the answer should be (0 <= l <= r < n)
2019-11-09 13:42:54
Problem K. The Dragon and the Kingdom of Trees
*****
The K nonintersecting subarrays are attacked once, or can be attacked multiple times?

Also, in case we can choose K nonintersecting subarrays multiple times, do they have to chosen K subarrays have to be same every time?
In every year, you can choose not attack or you can choose to attack k subarrays.

you don't have to attack the same k subarrays every year.

In every year you should attack every subarray exactly once, you can't attack the same sub-array more than one time in the same year, but you can attack it in a different year.