| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| WA ON 22 | @FEAR | 1325. Грязь | 28 фев 2007 17:10 | 11 |
I've submited 2 ACed Programs but they both got WA ON22.
So does my programs.
why~?
Is there any trick ~~? Mine (Dijkstra with heap) gets WA on 22 too. I don't know what's wrong.
Maybe someone else can help us. Help me, still WA on test22
Thanks I got AC, I had a bug, but can't remember what. Re: WA ON 22 Dart MirzMan C++ Edition (Mirzoyan Alexey, Rybinsk SAAT) 28 фев 2007 17:10 Ronnie wrote:
Mine (Dijkstra with heap) gets WA on 22 too
Dijkstra??? Is it O(n^4)? 500^4 - too long... Be careful to this test:
4 4
2 1
1 3
0220
1001
1001
0110 Re: WA ON 22 Einstein Chen(einstein[underline]csm[at]hotmail[dot]com) 29 май 2005 11:08 Re: WA ON 22 Einstein Chen(einstein[underline]csm[at]hotmail[dot]com) 1 июл 2005 20:53 what a bug!
finally accepted... The answer is
3 1
Isn't it? |
| WAwaWA 25 | Zeva [USU] | 1325. Грязь | 18 апр 2006 23:42 | 1 |
Help, me. Pleassse...
.......
Now I AC 0.203s, but 4422 KB
This test help me:
5 7
1 1
3 5
1011111
1211101
1222221
1020101
1111110
5 1
Edited by author 19.04.2006 01:21
Edited by author 19.04.2006 21:02 |
| WA on 20,give me some data | Liu Lanzheng | 1325. Грязь | 21 окт 2005 19:16 | 1 |
|
| WA25 HELP!!!! PLEASE HELP ME!!!!!! | ----- | 1325. Грязь | 5 окт 2005 21:35 | 6 |
help me plz!!!!
WA 25!!!
give me test plz!!!! Anybody!!!! Please help!!!!!
constantly WA 25, but i don't know why!!!!! Try to write it anew. Use heap. Heap??? Burunduk1 29 сен 2005 01:17 I think it's easier to use BFS. (And nothing more :) What doe's it mean( BFS )? I don't want use heap and avl.
I think that my algorithm is right, but i can't find mistake!
Bad english!!! Sorry!!!!! |
| !! WA12 !! Who can help? | Нищий Наглец | 1325. Грязь | 6 сен 2005 01:14 | 3 |
I not understand WHY?
Who know what is it? help Нищий Наглец 26 июл 2005 23:11 help Anatoliy 'Tolyan_NO' Tolstobroff 6 сен 2005 01:14 |
| Still | GaLL | 1325. Грязь | 7 май 2005 20:02 | 1 |
Still GaLL 7 май 2005 20:02 Can anybody who had WA 22 and now has AC tell me what
may be wrong? |
| What does Crash(ACCESS_VIOLATION) mean? I got that on #7. | Maigo Akisame (maigoakisame@yahoo.com.cn) | 1325. Грязь | 27 окт 2004 17:30 | 2 |
|
| AC.an interesting problem...... | Yu YuanMing | 1325. Грязь | 16 окт 2004 20:59 | 1 |
I manage to solve it in two way:
1.Use two bfs,one forward for change boot(see the adjacent same square as one region)...the other backward for the distance(based on step one,I think it has a bit like DP),and then you can solve it in O(nm).
2.Use dijkstra+heap.Just minimal heap can perform O(vlgv) in this problem(v=nm).Although it is a bit slow than 1,I think it is more simpler......
The interesting place is: In both of the two program(pascal),I only use
one array[1..500,1..500]of byte,
three array[1..500,1..500]of longint
it is 3250k,so the total memory won't more than 4000K.but the judge said P1 uses 5513K,P2 uses 4545K.Why will happen this thing? |
| Oh! I could't do more better,TLE on #21.Can anyone help me with 1325??? | Zieve Cheng | 1325. Грязь | 29 апр 2004 17:37 | 3 |
I had used to do hard with this problem,but can't solve this problem also~~~~~~ I had used all method to solve,programme three programs but all the programs were TLE on #21.It's possible to solve??? |
| It get TL but i think that it work O(N*M)? | Gogi | 1325. Грязь | 23 апр 2004 01:16 | 2 |
[code was deleted]
Edited by moderator 23.04.2004 01:14 |
| Problem locked | SK1 | 1325. Грязь | 20 апр 2004 22:40 | 2 |
It's unlocked now.
But a few tests were added. All tests are from real contest. Try it now ;-)
Statement was corrected:
was: "The computer and the refrigerator are in different squares."
now: "The computer and the refrigerator are not on the squares marked with 0." |
