ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1303. Minimal Coverage

I use greedy algorithm and get WA 1
Posted by Ekaterina Chumbarova 11 Mar 2014 12:40
Hi! I use greedy algorithms and can't get past first test. Could someone please provide me with some tests? I tried these tests with following results:
1
-1 0
-5 -3
2 5
0 0
-----------
No solution

1
-1 0
0 1
0 0
-----------
0 1

10
-5 1
1 14
-5 2
2 3
3 19
0 0
---------
-5 2
1 14

5
-5 0
0 1
1 2
2 3
4 5
3 4
10 49000
0 0
---------
0 1
1 2
2 3
3 4
4 5

4
0 4
-5 0
3 4
-4 4
0 0
-------
-4 4

6
0 5
7 8
0 0
-------
No solution

10
0 9
0 0
-------
No solution
Re: I use greedy algorithm and get WA 1
Posted by Senan 29 May 2017 02:50
you don't print segment's count first line