Discussion @ 1137. Bus Routes @ Timus Online Judge

Sandro (USU) Changes in problem 1137 "Bus Routes" // Problem 1137. Bus Routes 8 Dec 2020 16:57

Kirom `Ekexity [SESC17]💻 Input is incorrect!!! [2] // Problem 1137. Bus Routes 20 Mar 2019 23:14

Otisler Common sense? Oh, f@ck it. // Problem 1137. Bus Routes 4 Dec 2019 10:39

So Sui Ming WA#2 // Problem 1137. Bus Routes 8 May 2017 12:50

scythe why crash test 5??? [5] // Problem 1137. Bus Routes 22 May 2012 02:18

scythe Re: why crash test 5??? [4] // Problem 1137. Bus Routes 22 May 2012 02:44

Is something wrong with the input file format, is not as in the specification ( i lost 4 hours because of this ).

To be sure read it with Scanner ( if you use java ).

Edited by author 22.05.2012 02:47

Edited by author 22.05.2012 02:47

AutumnSky Re: why crash test 5??? [3] // Problem 1137. Bus Routes 14 Sep 2012 01:22

I have the same problem. In what direction i must dig? (C# is my language)

AutumnSky Re: why crash test 5??? [2] // Problem 1137. Bus Routes 24 Sep 2012 23:09

OK, I did it. You need to read input until end (C++ style!). In C# you can use structure like that:
while(Console.In.Peek() != -1)
{
//read input
}
Good luck :)

Douglas Re: why crash test 5??? [1] // Problem 1137. Bus Routes 26 Sep 2014 08:58

I have the same problem, I am a python programer here is my code:
import sys
sys.setrecursionlimit(10**5)

def find_tour(G):
    """
    Where G is an undirected graph
    """

    tour=[]
    visited_edges=set()

    def recurse(u):

        for v in G[u]:
            if (u,v) in visited_edges:continue
            visited_edges.add((u,v))
            recurse(v)

        tour.append(u)

    recurse(G.keys()[0])
    tour.reverse()
    return tour

from collections import defaultdict

def main():
    G=defaultdict(list)

    n=input()

    for t in range(n):
        l=map(int,raw_input().strip().split())

        for i in range(1,l[0]+1):
            G[l[i]].append(l[i+1])
    r=find_tour(G)
    if len(r) and r[0]==r[-1]:
        s=" ".join(map(str,r))
        s=str(len(r)-1)+" "+s
        print s
    else:print 0

main()

The error is in the reading phase, but when I change the read part to:
try:
        tokenizer=chain.from_iterable(line.strip().split() for line in stdinf)
        n=int(tokenizer.next())
        for i in range(n):
            m=int(tokenizer.next())
            u,v=-1,int(tokenizer.next())
            for j in range(m):
                u=v
                v=int(tokenizer.next())
                G[u].append(v)
    #    print G
    except:
        pass
I got an error in the 1st test case even when I dont have the same problem in my laptop.
Thanks for any help that you can give me.

AutumnSky wrote 24 September 2012 23:09

OK, I did it. You need to read input until end (C++ style!). In C# you can use structure like that:
while(Console.In.Peek() != -1)
{
//read input
}
Good luck :)

fblassioli Re: why crash test 5??? // Problem 1137. Bus Routes 29 Sep 2015 06:14

Yes, got problem with test #5 input.
Got AC after reading it the following way (python 2.7):

all_input = iter(sys.stdin.read().strip().replace('\n', ' ').split(' '))
n = int(all_input.next())
for _ in xrange(n):
    m = int(all_input.next())
    u = all_input.next()
    for i in xrange(m):
        v = all_input.next()
    ...

        u = v

Edited by author 29.09.2015 06:14

Edited by author 29.09.2015 06:14

Vladimir Plyashkun [USU] If you have WA#1 [1] // Problem 1137. Bus Routes 5 Jan 2014 23:38

Administrator Wrong answer test #4 - Lỗi test case 4 // Problem 1137. Bus Routes 19 May 2013 19:12

cap_prot WA on test #1. Are tests correct? // Problem 1137. Bus Routes 5 Feb 2013 16:12

Wojciech Wawrzyniak correct answer for this test? [3] // Problem 1137. Bus Routes 22 Dec 2006 20:29

youth Why wa on test 3??? // Problem 1137. Bus Routes 22 Jun 2012 12:47

Flyer Look here!!! [2] // Problem 1137. Bus Routes 11 Nov 2001 14:06

November Rain Does this problem requires the route with minimum stops? [3] // Problem 1137. Bus Routes 16 May 2004 21:11

Failed Peter Is it possible to output 0? [5] // Problem 1137. Bus Routes 3 Apr 2004 19:05

Andrey Veselovskiy I found euler but always get WA#1 What? [1] // Problem 1137. Bus Routes 14 Mar 2006 14:45

Yu YuanMing AC!Your task is to find the Euler Path.My algo is O(V+E).At first I am worried about the menory,but 430-300k AC. [4] // Problem 1137. Bus Routes 8 Jul 2004 21:45

Maigo Akisame (maigoakisame@yahoo.com.cn) AC with 405KB, though...(+) [1] // Problem 1137. Bus Routes 27 Oct 2004 04:38

sup hehe // Problem 1137. Bus Routes 1 Feb 2003 11:08

NOT To Try Only "Begin End." can got Accepted !!!!!!!!!! ------Just Now, May be corrected later. [2] // Problem 1137. Bus Routes 31 Jan 2003 16:03

Nazarov Denis (nsc2001@rambler.ru) To admins!!!! Judge is wrong(+) [2] // Problem 1137. Bus Routes 22 Jan 2002 21:28

Discussion of Problem 1137. Bus Routes