|
|
| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения | | What is test#3 | bilibilitdasc | 1655. Сомалийские пираты | 24 янв 2024 13:13 | 2 | I kept getting wrong answer in test#3. What should I do? | | I have WA6. Please anybody HelpME! | 107th | 1655. Сомалийские пираты | 10 авг 2020 14:40 | 4 | Maybe it's because of accuracy? (in case you are still alive) was it because of accuracy ? I was using doubles and got WA8 due to precision error, but then I changed all of the doubles to pair<long long, long long> (trying to represent them as rational fractions without any loss of accuracy) and got AC.
Edited by author 10.08.2020 14:42
Edited by author 10.08.2020 15:53 | | incorrect test(s) | Progbeat | 1655. Сомалийские пираты | 15 окт 2019 06:12 | 2 | In the 21st test there are ships with the same azimuth.
Edited by author 29.10.2010 23:26 Seems that is still a problem. Test 21 is incorrect. | | Russian version of statement | Yermak | 1655. Сомалийские пираты | 23 ноя 2012 08:57 | 1 | Эпиграф: следует писать "филиппинцы".
Последнее предложение первого абзаца:
"иначе пушку уже нельзя будет навести на цель, и команда попадет в плен" - запятая не нужна. | | Give me test #7 please | Taras Vasylyshyn | 1655. Сомалийские пираты | 27 июл 2009 23:49 | 1 | | | difficult AC | svr | 1655. Сомалийские пираты | 10 фев 2009 21:16 | 3 | I was solving this problem during 5 days
Next texts were helphfull
0 0.083334 4
30 2 60
330 4 60
90 8 60
60 10 60
ans
6.99999
1
2
4
3
0 0.1 3
0 2 60
0 3 70
0 6 80
ans
0.00000
1
2
3
0 0.083334 3
30 2 60
90 8 60
60 10 60
ans
2.9999
1
3
2
0 0.0833334 2
210 6 60
150 20 60
ans
6.9999
1
2
0 0.0833334 4
330 2 60
150 8 60
30 4 60
210 20 60
ans
8.99999
1
3
2
4
0 0.083334 2
90 10 60
330 10 60
ans:
4.999
2
1 Most of your tests are incorrect)) "All numbers contain at most three fractional digits". But they are surely useful.
I can't say this problem is so hard. I had only some problems with accuracy. These tests may help:
0 0.010 3
359.999 167.667 100.000
180 84.334 100.000
0.001 1.001 100.000
ans
100.000
3
2
1
0 0.010 3
359.999 167.666 100.000
180 84.334 100.000
0.001 1.001 100.000
ans
Impossible
P. S. Can you give me some hints on 1672?
Edited by author 12.02.2009 22:15 If you can't see this problem as easy
all hints are unhelphull.
We are, old mathematitians have habbit
to use cost function, restrictions
and sequence of points set under refimement procedure
to find optimization result. | | Bad solution received AC | ryu | 1655. Сомалийские пираты | 22 ноя 2008 13:31 | 5 | I wrote bad solution, but my program received AC.
My friend gave me test:
0 1 7
0 1000 1
45 1000 1
90 1000 1
135 1000 1
180 1000 1
225 1000 1
270 1.25 60
My program output "Impossible", but solution exists.
Ships should be shot in the order:
1 7 6 5 4 3 2 2 ADMINS: Testset is really weak - my program contains several rude mistakes, nevertheless - AC.
Please, add new tests or fix bug in checker... There was a bug in checker. All wrong verdicts were rejudged. Thank you for help. Re: Fixed (+) Vedernikoff Sergey (HSE: EconomicsForever!) 22 ноя 2008 03:48 Please check the checker again. It seems to me that it passes some tests even when my program outputs zeroes as numbers of ships. |
|
|
|
