CSES - Datatähti 2016 alku

Submission details
Task:	Lennot
Sender:	Dentosal
Submission time:	2015-10-09 17:50:58 +0300
Language:	Python2
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	TIME LIMIT EXCEEDED	0
#2	RUNTIME ERROR	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	TIME LIMIT EXCEEDED	--	1	details
#2	TIME LIMIT EXCEEDED	--	1	details
#3	ACCEPTED	0.06 s	1	details
#4	TIME LIMIT EXCEEDED	--	1	details
#5	ACCEPTED	0.17 s	1	details
#6	RUNTIME ERROR	0.09 s	2	details
#7	RUNTIME ERROR	0.10 s	2	details
#8	RUNTIME ERROR	0.09 s	2	details
#9	RUNTIME ERROR	0.07 s	2	details
#10	RUNTIME ERROR	0.08 s	2	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	TIME LIMIT EXCEEDED	--	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details

Code

#!/dev/null

class Node:
    def __init__(self, nid, l):
        self.id = nid
        self.links = l
class Link:
    def __init__(self, target, cost=0):
        self.target = target
        self.cost = cost

k, l = [int(i) for i in raw_input().split()]
y = []
for q in range(l):
    y.append([int(i) for i in raw_input().split()])

graph = [Node(q, []) for q in range(k)]
for q in y:
    graph[q[0]-1].links.append(Link(graph[q[1]-1], q[2]))


def search(source, target, path=[], cost=0):
    path += [source.id]
    if id(source) == id(target):
        return True, cost
    ret = []
    for link in source.links:
        if path.count(link.target.id)>k/2:
            continue
        x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
        if x:
            ret.append(r)
    if len(ret):
        return True, min(ret)
    return False, 0

print search(graph[0], graph[-1])[1]


"""

5 7
1 2 2
2 3 1
2 4 1
2 5 8
3 1 3
3 4 4
4 5 3



4 6
1 2 2
1 3 2
1 4 10
2 1 2
3 2 1
3 4 2


4 4
1 2 1
2 3 1
3 1 1
3 4 100


"""

Test details

Test 1

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`10 20 2 1 3 7 6 4 1 6 7 1 6 1 ...` view save

correct output
`8` view save

user output
(empty)

Test 2

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`10 20 4 3 10 1 10 9 3 4 10 2 6 7 ...` view save

correct output
`9` view save

user output
(empty)

Test 3

Group: 1

Verdict: ACCEPTED

input
`10 20 5 7 4 6 1 1 7 3 8 8 4 2 ...` view save

correct output
`8` view save

user output
`8` view save

Test 4

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`10 20 1 6 2 5 3 3 7 3 6 5 6 2 ...` view save

correct output
`13` view save

user output
(empty)

Test 5

Group: 1

Verdict: ACCEPTED

input
`10 20 10 8 5 2 4 7 9 4 7 9 4 1 ...` view save

correct output
`4` view save

user output
`4` view save

Test 6

Group: 2

Verdict: RUNTIME ERROR

input
`1000 2000 91 828 365044406 17 984 445675537 251 852 100987451 907 487 58830088 ...` view save

correct output
`11893353673` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 37, in <module>
    print search(graph[0], graph[-1])[1]
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in sea...

Test 7

Group: 2

Verdict: RUNTIME ERROR

input
`1000 2000 722 939 530579090 404 606 268877348 133 750 760086153 506 46 582310443 ...` view save

correct output
`30248963445` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 37, in <module>
    print search(graph[0], graph[-1])[1]
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in sea...

Test 8

Group: 2

Verdict: RUNTIME ERROR

input
`1000 2000 340 237 43690066 217 141 453160975 744 202 639037814 605 926 404985542 ...` view save

correct output
`3126797692` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 37, in <module>
    print search(graph[0], graph[-1])[1]
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in sea...

Test 9

Group: 2

Verdict: RUNTIME ERROR

input
`1000 2000 88 312 190442306 480 402 411574469 29 901 397491243 636 459 323246996 ...` view save

correct output
`18416073173` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 37, in <module>
    print search(graph[0], graph[-1])[1]
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in sea...

Test 10

Group: 2

Verdict: RUNTIME ERROR

input
`1000 2000 333 228 718389176 796 286 323493090 743 43 751876815 128 554 175625940 ...` view save

correct output
`6399349335` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 37, in <module>
    print search(graph[0], graph[-1])[1]
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in search
    x,r = search(link.target, target, path[:], cost+link.cost*(len(path)%2))
  File "input/code.py", line 30, in sea...

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 28264 92686 186865663 92570 33956 925976418 87377 71249 644757113 16701 81203 922125505 ...` view save

correct output
`518249578675` view save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 95740 71482 846654568 44131 16806 670712211 3967 49254 424174139 39369 53007 830346557 ...` view save

correct output
`920862321580` view save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 79947 25489 71554257 59184 25577 328436360 82945 73554 4942918 22380 92385 874250042 ...` view save

correct output
`399407698440` view save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 31139 12960 580545990 27744 95556 747296719 46969 42578 840321561 5638 28960 513805324 ...` view save

correct output
`165235287505` view save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`99993 199980 1 3 1 3 2 1 1 4 1 4 2 1 ...` view save

correct output
`2` view save

user output
(empty)

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 149994 93867 98509 1755709 85029 99843 1347591 10305 35305 6447 75638 80585 1829972 ...` view save

correct output
`1124960` view save

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 70413 71496 49 15963 40963 18635 81291 89420 1850028 8848 33848 17316 ...` view save

correct output
`110298` view save

user output
(empty)

Datatähti 2016 alku

Lennot

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Tasks

Submissions (Dentosal)