|
|
Show all threads Hide all threads Show all messages Hide all messages | WA23 | andreyDagger`~ | 1630. Talisman | 21 Jan 2023 02:11 | 1 | WA23 andreyDagger`~ 21 Jan 2023 02:11 4 3 1 2 2 3 3 4 Luck is possible | WA 20 | 💻Evgeny Nemtsev [UrFU FT-17]'` | 1630. Talisman | 3 Sep 2017 18:54 | 1 | WA 20 💻Evgeny Nemtsev [UrFU FT-17]'` 3 Sep 2017 18:54 5 10 1 2 1 3 1 4 1 5 2 3 2 4 2 5 3 4 3 5 4 5 -> Unlucky Petr | WA#14 getters :) | kerpoo | 1630. Talisman | 12 Sep 2016 06:13 | 1 | | WA#7 getters :) | kerpoo | 1630. Talisman | 12 Sep 2016 06:12 | 1 | Is a non-linear tree! Edited by author 12.09.2016 06:14 | if Graph , Full Graph, answer->? | xurshid_n | 1630. Talisman | 12 Sep 2016 05:58 | 5 | My solution: checked every component graph, 1) if subgraph = Full graph, yes else 2) if subgraph = linear graph, yes else no. this is right? sorry, my bad english. First condition is true only for full graph with 3 or 4 vertices. 1) and 2) are right. but there exists another lucky graphs. i've got WA7 and i think test#7 is not a full graph or linear. I got AC with only statements written above. Read them more attentively: every connected component of this graph should satisfy them, not entire graph. WA#7 trees aren't linear :) Edited by author 12.09.2016 05:58 | the meaning | Zhang Ye | 1630. Talisman | 23 Jan 2013 08:42 | 1 | god! help! I don't understand the meaning of the problem. | WA#1 | adavydow | 1630. Talisman | 6 Apr 2011 07:09 | 1 | WA#1 adavydow 6 Apr 2011 07:09 Why output to syserr cause wa#1? Is it working as intended? | WA#3 | Muhabbat | 1630. Talisman | 20 Feb 2011 01:37 | 3 | WA#3 Muhabbat 11 Oct 2008 17:58 3- TEST NIMA? WHAT IS 3 TEST REAL Re: WA#3 unlucky [Vologda SPU] 21 Feb 2010 16:39 I think there are sets of unconnected points. They are lucky, i think test#3 is a M=0. it's lucky. | Why I got WA 3 | Friends | 1630. Talisman | 16 Oct 2008 21:00 | 3 | HERE is my code var n,m,i,k:integer; x,y:array [1..10000] of integer; begin readln(n,m); k:=0; for i:=1 to m do begin readln(x[i],y[i]); if abs(x[i]-y[i])=1 then k:=k+1; if abs(x[i]-y[i])=n-1 then k:=k+1; end; if (k=n) and (k<=m) then writeln('Luck is possible') else writeln('Unlucky Petr'); readln; readln; end. i think you haven't understood the task correctly. If you are interested, write to i.ju.olshvang[at]gmail[dot]com or icq#344303921, i'll try to make it clear to you. | WA#3 | Buni_Real | 1630. Talisman | 11 Oct 2008 17:56 | 1 | WA#3 Buni_Real 11 Oct 2008 17:56 |
|
|
|