I finally figured it out.
Here are some input/output cases:
INPUT
10
4 9
0 0
1 1
-1 -2
2 1
2 3
1 -1
0 -2
-1 -3
-1 -1
2 9
0 0
100 100
200 0
100 -100
20 1
34 5
50 9
55 -8
101 100
5 6
0 0
0 0
0 1
0 2
1 0
2 0
1 7
8 0
8 3
10 0
10 1
10 2
12 3
12 0
2147483647 3
2147483647 0
-2147483647 0
-234 -234 ...
Search found 3 matches
- Sun Jan 04, 2009 11:47 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11096 - Nails
- Replies: 28
- Views: 19344
- Tue Dec 30, 2008 8:53 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11096 - Nails
- Replies: 28
- Views: 19344
Re: 11096 - Nails
Hey guys
I spent so much time on this problem,
but still can't figure out my error.
For the cases posted above, i get the same results
Please can anyone post some i/o cases?
I use graham scan for my algorithm, and output the initial length of the ribbon if it is longer than the calculated ...
I spent so much time on this problem,
but still can't figure out my error.
For the cases posted above, i get the same results
Please can anyone post some i/o cases?
I use graham scan for my algorithm, and output the initial length of the ribbon if it is longer than the calculated ...
- Wed Dec 17, 2008 10:12 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10441 - Catenyms
- Replies: 15
- Views: 8053
Re: 10441 - Catenyms
Can you provide more test cases,
although I got all the posted cases right, I still get wrong answer.
Thank you for help
although I got all the posted cases right, I still get wrong answer.
Thank you for help