CSES - NOI 2024

Submission details
Task:	Anime Shops
Sender:	Ruiming Zhang
Submission time:	2024-03-06 15:41:38 +0200
Language:	Python3 (PyPy3)
Status:	READY
Result:	16

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

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.10 s	1, 3	details
#2	WRONG ANSWER	0.10 s	1, 3	details
#3	WRONG ANSWER	0.10 s	1, 3	details
#4	WRONG ANSWER	0.10 s	1, 3	details
#5	WRONG ANSWER	0.52 s	3	details
#6	WRONG ANSWER	0.53 s	3	details
#7	WRONG ANSWER	0.53 s	3	details
#8	WRONG ANSWER	0.56 s	3	details
#9	ACCEPTED	0.25 s	2, 3	details
#10	ACCEPTED	0.25 s	2, 3	details
#11	ACCEPTED	0.30 s	2, 3	details
#12	WRONG ANSWER	0.25 s	3	details
#13	WRONG ANSWER	0.25 s	3	details
#14	WRONG ANSWER	0.30 s	3	details
#15	WRONG ANSWER	0.12 s	3	details
#16	WRONG ANSWER	0.25 s	3	details

Code

from collections import deque

n, m, k = map(int, input().split())
lst = list(map(int, input().split()))
path = {}



for _ in range(m):
    a, b = map(int, input().split())
    x = path.get(a - 1, [])
    x.append(b - 1)
    path[a - 1] = x

    y = path.get(b - 1, [])
    y.append(a - 1)
    path[b - 1] = y

# if k <= 1000 and n <= 1000 and m <= 2000:
#     all = set()
#     for i in lst:
#         all.add(i - 1)
#     def bfs(stack, already): #not in your city
#         while stack != deque([]):
#             now = stack.popleft()
#             if now[0] in all:
#                 return now[1]
#             else:
#                 if now[0] in path:
#                     for i in path[now[0]]:
#                         if i not in already:
#                             stack.append((i, now[1] + 1))
#                             already.add(i)
#         return -1

#     for i in range(n):
#         already = {i, }
#         queue = deque()
#         if i in path:
#             for j in path[i]:
#                 already.add(j)
#                 queue.append((j, 1))

#         ans = bfs(queue, already)

#         if ans == 10e9:
#             print(-1, end = " ")
#         else:
#             print(ans, end = " ")
#     print()

# else:
all = []
for i in lst:
    all.append(i - 1)
all.sort()

res = [0] * (n)
for i in range(k):
    if i == 0:
        if k == 1:
            res[all[i]] = -1
        else:
            res[all[i]] = abs(all[i + 1] - all[i])

    elif i == k - 1:
        if k == 1:
            res[all[i]] == 1
        else:
            res[all[i]] = abs(all[i - 1] - all[i])
    else:
        res[all[i]] = min(abs(all[i + 1] - all[i]), abs(all[i] - all[i - 1]))


for i in range(-1 , k):
    if i == -1:
        for l in range(all[0]):
            res[l] = abs(all[0] - l)
    elif i == k - 1:
        for l in range(all[k - 1] + 1, n):
            res[l] = abs(all[k - 1] - l)
    else:
        for j in range(all[i] + 1, all[i + 1]):
            res[j] = min(abs(all[i] - j), abs(all[i + 1] - j))


for i in range(n):
    print(res[i], end = " ")
print()

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
`815 814 813 812 811 810 809 80...` 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
`204 203 202 201 200 199 198 19...` 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
`8 7 6 5 4 3 2 1 1 1 1 2 3 2 1 ...` Truncated

Test 4

Group: 1, 3

Verdict: WRONG ANSWER

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

Test 5

Group: 3

Verdict: WRONG ANSWER

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
`77221 77220 77219 77218 77217 ...` Truncated

Test 6

Group: 3

Verdict: WRONG ANSWER

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
`735 734 733 732 731 730 729 72...` Truncated

Test 7

Group: 3

Verdict: WRONG ANSWER

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
`937 936 935 934 933 932 931 93...` Truncated

Test 8

Group: 3

Verdict: WRONG ANSWER

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

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

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
`99997 99996 99995 99994 99993 ...` 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
`99700 99699 99698 99697 99696 ...` 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
`70000 69999 69998 69997 69996 ...` Truncated

Test 15

Group: 3

Verdict: WRONG ANSWER

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 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
`50000 1 2 3 4 5 6 7 8 9 10 11 ...` 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 (Ruiming Zhang)