CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Anime Shops
Sender:	Elias Gjedde-Grundtvig
Submission time:	2024-03-06 17:26:13 +0200
Language:	Python3 (CPython3)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 3	details
#2	WRONG ANSWER	0.03 s	1, 3	details
#3	WRONG ANSWER	0.03 s	1, 3	details
#4	ACCEPTED	0.03 s	1, 3	details
#5	ACCEPTED	0.81 s	3	details
#6	TIME LIMIT EXCEEDED	--	3	details
#7	TIME LIMIT EXCEEDED	--	3	details
#8	TIME LIMIT EXCEEDED	--	3	details
#9	ACCEPTED	0.39 s	2, 3	details
#10	WRONG ANSWER	0.49 s	2, 3	details
#11	ACCEPTED	0.96 s	2, 3	details
#12	WRONG ANSWER	0.42 s	3	details
#13	WRONG ANSWER	0.44 s	3	details
#14	WRONG ANSWER	0.43 s	3	details
#15	ACCEPTED	0.14 s	3	details
#16	WRONG ANSWER	0.41 s	3	details

Code

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

shops = list(map(int, input().split()))
adj = [[] for _ in range(n+1)]
for i in range(m):
    a, b = map(int, input().split())
    adj[a].append(b)
    adj[b].append(a)

def m1(n, m, k, shops, adj):
    dst = [-1]*(n+1)
    frm = [-1]*(n+1)
    shopmark = [False]*(n+1)
    for s in shops:
        frm[s] = s
        shopmark[s] = True

    cur = list(shops)
    while cur:
        nxt = []
        for i in cur:
            for j in adj[i]:
                if dst[j] == -1:
                    if not shopmark[j]:
                        dst[j] = 0 if shopmark[i] else dst[i] + 1
                        frm[j] = frm[i]
                        nxt.append(j)
                    elif frm[i] != frm[j]:
                        dst[j] = 0 if shopmark[i] else dst[i] + 1
                elif frm[i] != frm[j]:
                    d = dst[i]+dst[j]+2
                    if dst[frm[j]] == -1 or dst[frm[j]] > d:
                        dst[frm[j]] = d
        cur = nxt
    return " ".join([str(x+1 if x!=-1 else x) for x in dst[1:]])

def m2(n, m, k, shops, adj):
    dst = [-1]*(n+1)
    for s in shops:
        cur = [s]
        d = 1
        while cur:
            nxt = []
            for i in cur:
                for j in adj[i]:
                    if (dst[j] > d or dst[j] == -1) and j != s:
                        dst[j] = d
                        nxt.append(j)
            d += 1
            cur = nxt
    return " ".join([str(x) for x in dst[1:]])

print(m2(n, m, k, shops, adj))

Test details

Test 1

Group: 1, 3

Verdict: ACCEPTED

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
`4 3 3 4 6 4 -1 4 5 2 2 5 5 3 5...` 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
`5 6 4 3 4 2 -1 3 3 3 4 3 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: ACCEPTED

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
`8 10 8 8 8 8 8 8 9 7 7 8 8 8 6...` Truncated

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: ACCEPTED

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

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

user output
`44157 44156 44155 44154 44153 ...` Truncated

Test 10

Group: 2, 3

Verdict: WRONG ANSWER

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
`361 360 359 358 357 356 355 35...` Truncated

Test 11

Group: 2, 3

Verdict: ACCEPTED

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
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` Truncated

Test 12

Group: 3

Verdict: WRONG ANSWER

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
`33333 33332 33332 33332 33331 ...` Truncated

Test 13

Group: 3

Verdict: WRONG ANSWER

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
`333 333 333 333 333 333 333 33...` Truncated

Test 14

Group: 3

Verdict: WRONG ANSWER

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
`3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ...` Truncated

Test 15

Group: 3

Verdict: ACCEPTED

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
`-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 ...` Truncated

Test 16

Group: 3

Verdict: WRONG ANSWER

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
`-1 1 2 3 4 5 6 7 8 9 10 11 12 ...` Truncated

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 (Elias Gjedde-Grundtvig)