CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Anime Shops
Sender:	Bertram Grønborg Nicolaisen
Submission time:	2024-03-06 17:23:41 +0200
Language:	Python3 (PyPy3)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	TIME LIMIT EXCEEDED	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.60 s	1, 3	details
#2	WRONG ANSWER	0.24 s	1, 3	details
#3	WRONG ANSWER	0.16 s	1, 3	details
#4	ACCEPTED	0.10 s	1, 3	details
#5	TIME LIMIT EXCEEDED	--	3	details
#6	TIME LIMIT EXCEEDED	--	3	details
#7	TIME LIMIT EXCEEDED	--	3	details
#8	TIME LIMIT EXCEEDED	--	3	details
#9	TIME LIMIT EXCEEDED	--	2, 3	details
#10	TIME LIMIT EXCEEDED	--	2, 3	details
#11	TIME LIMIT EXCEEDED	--	2, 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

Code

import sys

sys.setrecursionlimit(10**6)

n, m, k = map(int, input().split())

kList = list(map(int, input().split()))


sec =  [False for _ in range(n)]

#animeShop = [(-1,False, _) for _ in range(n)]
animeShopDis = [999999 for _ in range(n) ]
animeShopBool = [False for _ in range(n)]
animeShopCon = [-1 for _ in range(n)]






for i in range(k):
    animeShopDis[kList[i]-1] = 0
    animeShopCon[kList[i]-1] = kList[i]-1
    animeShopBool[kList[i]-1] = True
    sec[kList[i]-1] = True


adj = [[] for _ in range(n)]

k = 9999999999999

animeShopNear = [9999999999999 for _ in range(n)]
distance = []


for i in range(m):
    a, b = map(int, input().split())
    adj[a-1].append(b-1)
    adj[b-1].append(a-1)


visted = [False for _ in range(n)]

#print(adj)

def bob(q, w,z):
    global animeShopDis
    global animeShopCon
    global animeShopBool
    global animeShopNear
    global sec
    if animeShopNear[z] <= w: return
    if visted[q] == True: return

    visted[q] = True

    for b in adj[q]:
        
        #print(f'b: {b}')
        #print(f'w: {w}')
        #print(f'z: {z}')

        


        #print(animeShopCon)
        #print(animeShopDis)
        #print(animeShopBool)
        #print(sec)
        if z != b and sec[b]:
            #print("BITCH")
            animeShopNear[z] = min(w,animeShopNear[z])
            animeShopBool[z] = True
            animeShopCon[z] = b
            animeShopDis[z] = w
        
        elif animeShopDis[b] <= w:
            if animeShopBool[b] == True:
                if animeShopCon[b] != z:
                    #print(b)
                    #print(z)
                    #print(w)
                    if sec[q] == True :
                        animeShopNear[z] = min(w,animeShopNear[z])
                        animeShopBool[z] = True
                        animeShopCon[z] = b
                        animeShopDis[z] = w
                    else:
                        animeShopNear[z] = min(w+animeShopDis[b],animeShopNear[z])
                        animeShopBool[z] = True
                        animeShopCon[z] = b
                        animeShopDis[z] = w
                    

        bob(b, w+1, z)


for i in range(n):
    #print(f'i: {i}')
    #print(adj)
    visted = [False for _ in range(n)]
    bob(i, 1, i)

for i in range(n):
    if animeShopNear[i] == k:
        print(-1,end=" ")
    else:
        print(animeShopNear[i],end=" ")

Test details

Test 1

Group: 1, 3

Verdict: WRONG ANSWER

input
`1000 2000 1 816 1 868 976 995 377 536 ...` view save

correct output
`4 3 3 4 6 4 -1 4 5 2 2 5 5 3 5...` view save

user output
`176 62 182 65 94 253 -1 60 189...` Truncated

Test 2

Group: 1, 3

Verdict: WRONG ANSWER

input
`1000 2000 20 578 955 222 813 494 962 753 71...` view save

correct output
`5 6 4 3 4 2 -1 3 3 3 4 3 2 3 -...` view save

user output
`7 6 7 3 4 2 -1 3 13 3 7 4 2 3 ...` Truncated

Test 3

Group: 1, 3

Verdict: WRONG ANSWER

input
`1000 2000 100 945 230 119 680 975 520 490 28...` view save

correct output
`2 2 3 -1 2 -1 3 2 2 1 2 -1 3 2...` view save

user output
`2 2 3 -1 2 -1 3 2 2 1 2 -1 3 2...` Truncated

Test 4

Group: 1, 3

Verdict: ACCEPTED

input
`1000 2000 1000 150 443 960 545 218 487 896 38...` view save

correct output
`1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 ...` view save

user output
`1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 ...` Truncated

Test 5

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 1 77222 59470 61811 43092 48939 14395 19964 ...` view save

correct output
`8 10 8 8 8 8 8 8 9 7 7 8 8 8 6...` view save

user output
(empty)

Test 6

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 20 70440 82302 64483 96767 51485 ...` view save

correct output
`-1 8 6 5 5 7 6 7 6 6 8 5 6 4 5...` view save

user output
(empty)

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 100 68738 37820 55519 77758 46482 ...` view save

correct output
`4 5 5 5 5 4 6 -1 5 4 5 6 4 5 5...` view save

user output
(empty)

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 100000 47137 80137 73347 78145 9205 6...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 1 44158 1 2 2 3 3 4 ...` view save

correct output
`44157 44156 44155 44154 44153 ...` view save

user output
(empty)

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 20 44158 25720 84658 90057 99607 ...` view save

correct output
`361 360 359 358 357 356 355 35...` view save

user output
(empty)

Test 11

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 100000 44158 25720 84658 90057 99607 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 3 99998 99999 100000 1 2 1 3 1 4 ...` view save

correct output
`33333 33332 33332 33332 33331 ...` view save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 300 99701 99702 99703 99704 99705 ...` view save

correct output
`333 333 333 333 333 333 333 33...` view save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 30000 70001 70002 70003 70004 70005 ...` view save

correct output
`3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ...` view save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 0 100000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 ...` view save

user output
(empty)

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 2 1 50001 1 2 2 3 3 4 ...` view save

correct output
`50000 1 2 3 4 5 6 7 8 9 10 11 ...` view save

user output
(empty)

NOI 2024

Anime Shops

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

Tasks

Submissions (Bertram Grønborg Nicolaisen)