The statement requires one integer per test case: the maximum achievable value. The sample output and all provided .ans files use this format.
However, algorithmic/problems/61/check.cpp interprets the first participant output integer as the number of segments d, then reads d pairs (l, r). Therefore, a statement-compliant solution is misparsed and rejected.
For example, the official sample output starts with 3 6. The checker reads 3 as d and 6 as the first segment's left endpoint, which is outside [1, 5], resulting in Wrong Answer.
The statement requires one integer per test case: the maximum achievable value. The sample output and all provided
.ansfiles use this format.However,
algorithmic/problems/61/check.cppinterprets the first participant output integer as the number of segmentsd, then readsdpairs(l, r). Therefore, a statement-compliant solution is misparsed and rejected.For example, the official sample output starts with
3 6. The checker reads3asdand6as the first segment's left endpoint, which is outside[1, 5], resulting in Wrong Answer.