Problems
 
 
# Name    
A
standard input/output
1 s, 256 MB
Submit  x78
B
standard input/output
2 s, 512 MB
Submit  x11
C
standard input/output
1 s, 256 MB
Submit  x4
D
standard input/output
1 s, 256 MB
Submit  x126
E
standard input/output
1 s, 256 MB
Submit  x107
F
standard input/output
1.5 s, 256 MB
Submit  x23
G
standard input/output
1.5 s, 256 MB
Submit  x28
H
standard input/output
1 s, 1024 MB
Submit  x105
I
standard input/output
2 s, 1024 MB
Submit  x15
J
standard input/output
1 s, 256 MB
Submit  x70
K
standard input/output
1 s, 256 MB
Submit  x14
L
standard input/output
8 s, 256 MB
Submit  x2
M
standard input/output
6 s, 1024 MB
Submit  x2
N
standard input/output
1 s, 1024 MB
Submit  x113
O
standard input/output
5 s, 256 MB
Submit  x9
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2025-12-04 14:59:39
Problem O. Ya Masa2 El Geometry
*****
Announcement
All submissions in problem O are rejudged!
2025-12-04 12:21:47
Problem K. Good Subarrays
*****
For each subarray [l, r] of my array b I can choose several disjoint segments contained in [l, r] and reverse them at most once if after these operations my subarray [l, r] is sorted in non-decreasing then its good

This is how I understood the problem is this correct?
You should be right. To be clear, you choose set of disjoint subarrays and reverse them all at once, this is considered an operation so you can make it at most once. 
2025-12-04 11:54:45
Problem B. Bouncing Chaos
*****
Does the second image represent two frames (at one point they are on the same point) or the collision makes them faster (they skip the colliding frame)?
two frames yes, first they collide, then after that they move. Treat it the same as a normal collision, you touch at one step then next step you move.