Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
Страница 3 |
Try this test if you have WA17 | so no fancy crap ok | 1085. Встреча | 15 июл 2022 16:09 | 1 |
1 1 1 1 3 100 1 0 100 1 1 0 1 0 answer: 1 0 |
Ambiguity in statement | Ngo Huy | 1085. Встреча | 5 апр 2017 10:18 | 1 |
if a route is defined by the stops: 1, 2, 4. Can they go from 4 to 2 then to 1 or is it one-way route? |
runtime error | user_is_null | 1085. Встреча | 13 апр 2016 14:02 | 1 |
test 11.please give me some test.thx! |
Too much difficulty but too easy problem | Takanashi Rikka | 1085. Встреча | 24 фев 2016 09:58 | 1 |
|
WA #4 | David Yin | 1085. Встреча | 18 апр 2015 19:19 | 1 |
WA #4 David Yin 18 апр 2015 19:19 Why that? Who can give me the test case that will fail like this? |
WA 18 | crc | 1085. Встреча | 4 фев 2015 18:42 | 2 |
WA 18 crc 4 фев 2015 14:29 Ok I forgot about this: (if there are several numbers choose the minimal one) |
wa on 17 | xcszbdnl | 1085. Встреча | 3 июл 2014 12:25 | 1 |
I don't know why I got wa on 17,is there any tests??Please help me, it drives me crazy for 4 hours/ |
if you have wa #4 | Zhang Ye | 1085. Встреча | 30 ноя 2012 07:47 | 1 |
|
what is Month tram ticket? | shafaet | 1085. Встреча | 5 июн 2012 16:40 | 2 |
what is Month tram ticket? This "month tram ticket" allows you to use tram as much times as you want without any payment. |
Wa#11 please help,my program passed all of the tests that i know,but WA | Hrayr | 1085. Встреча | 10 июн 2011 22:19 | 1 |
|
WA2 | remdy21 | 1085. Встреча | 2 ноя 2010 23:02 | 4 |
WA2 remdy21 29 июл 2010 19:54 why wa2??? program ural; var n,m,i,k,j,r,p:byte; a:array[1..100]of byte; b:array[1..100,1..100]of byte; d:array[1..100]of integer; z,t:integer; label 1; begin readln(n,m); for i:=1 to m do begin read(k); for j:=1 to k do read(a[j]); for j:=1 to k do for r:=1 to k do if j<>r then begin b[a[j],a[r]]:=1; b[a[r],a[j]]:=1; end; end; readln(m); for i:=1 to m do begin readln(d[i],a[i],p); if p=1 then d[i]:=101 else d[i]:=d[i] div 4; end; for i:=1 to n do for j:=1 to n-1 do if i<>j then for r:=j+1 to n do if r<>i then if(b[j,i]>0)and(b[i,r]>0)then begin t:=b[j,i]+b[i,r]; if(b[j,r]=0)or(t<b[j,r])then begin b[j,r]:=t; b[r,j]:=t; end; end; z:=255; for i:=1 to n do begin t:=0; for j:=1 to m do if a[j]<>i then if(b[a[j],i]>0)and(b[a[j],i]<=d[j])then begin if d[i]<>101 then inc(t,b[a[j],i]); end else goto 1; if t<z then begin k:=i; z:=t; end; 1: end; if z=255 then writeln(0) else writeln(k,' ',z*4); end. Re: WA2 [SESC USU] Zhirov Eugene 29 июл 2010 22:14 I can only say, that answer to the test 2 is 4 12. Program like this: begin write('4 12'); end. gives WA#4. Re: WA2 [MSU Detritus] freopen 21 авг 2010 02:14 I don't know, what is your WA2, but my WA2 is people who spend his money, when they have month ticket. Try this: 4 3 2 1 2 2 2 3 2 3 4 3 27 1 1 15 4 0 45 4 0 Answer is 4 0. I hope, it helps. Sorry for my bad english. You are right Thnx a lot Edited by author 02.11.2010 23:03 |
Test 1. | [SESC USU] Zhirov Eugene | 1085. Встреча | 7 ноя 2010 18:19 | 2 |
Test 1. [SESC USU] Zhirov Eugene 22 июл 2010 01:37 What the hell? I use BFS, all tests given here my program answers correct, but WA1! What could it be? Oh, I finally had done it... The first idea wasn't good. Just another BFS AC'es. |
if you have #15, try this test | ile | 1085. Встреча | 15 янв 2013 18:55 | 4 |
4 3 3 1 2 4 2 2 3 2 3 4 3 27 1 0 15 4 0 45 4 0 my solutin gives "4 4". But still WA#15 my solution also gives "4 4". But still WA#15, what can i do? |
Be careful! It is bidirectional!! | lrcrichard | 1085. Встреча | 14 дек 2010 21:35 | 3 |
|
Wa Test #3 help Me | Quyon | 1085. Встреча | 1 авг 2010 05:15 | 2 |
Try test 4 2 2 1 2 2 2 3 2 0 3 1 0 2 1 answer 1 0 |
WA4 | Nikita Artyushov (SPb SU, mat-meh) | 1085. Встреча | 30 июн 2009 18:15 | 2 |
WA4 Nikita Artyushov (SPb SU, mat-meh) 30 июн 2009 17:04 Could somebody tell me, what can be the mistake, if I get WA4? Re: WA4 Nikita Artyushov (SPb SU, mat-meh) 30 июн 2009 18:15 |
Страница 2 |
floyd-warshall or Dijkstra? | Sergey Zuev (LYC) | 1085. Встреча | 4 авг 2012 02:38 | 6 |
Should I use Dijkstra's algorithm several times for each friend or just floyd-warshall? ..? good q .. but .. ! all the edge's cost's are 1 .. so .. :-) use BFS .. for every friend from its starting position :-) its n*k :-) .. but i got WA 14 :-( ... ~~~~~~~~~~~~~~~~~~~~~~~~~~~ now i get it .. the WA's in the discuss are very useful :-) and .. with my o(n*k) i had .. 0.031 264 KB Edited by author 13.09.2010 22:03 Edited by author 13.09.2010 22:03 Are you sure it's O(n*k)? I used DFS from every tramstop to find how much it costs for all of friends to meet here. This test helped me a lot (it's funny to draw circles): 13 5 3 1 2 3 3 4 5 3 3 6 7 3 3 8 9 3 8 10 4 11 6 12 8 13 1 I corrected all mistakes by adding different situations on this tram-map :) |
Help please, WA 14 | Grigor Gevorgian | 1085. Встреча | 13 сен 2010 21:53 | 3 |
My solution uses simple Floyd algo.It passed all tests on this board, but still gets WA. Edited by author 02.04.2009 12:58 ahh .. i used BFS .. and .. i get first WA 14 .. but i saw there .. "if the money to to bus station <= the friends money .." its just < :-) i saw oin other thread ;-) good luck |
Something to add | Boyan Lazov | 1085. Встреча | 5 янв 2011 18:21 | 2 |
It may be quite obvious from the problem statement, but it wasn't for me, so i guess i'll just write it here: Whoever has a monthly tram ticket travels for free regardless of route switches. The others pay 4 rubles for every route they take. Cost me a few submits, because i thought the monthly ticket applies for the initial route, but not for the subsequent switches ... |
What's test 21? | Hakkinen | 1085. Встреча | 18 апр 2020 22:27 | 3 |
I wa many times. Thank you very much! I know,I used "<money[i]" You should use "<=money[i]" oh thanks, man, it helped me) |