CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Anime Shops
Sender:	Róbert Kristian Freysson
Submission time:	2024-03-06 15:38:03 +0200
Language:	C++ (C++11)
Status:	READY
Result:	23

Feedback
group	verdict	score
#1	ACCEPTED	23
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 3	details
#2	ACCEPTED	0.01 s	1, 3	details
#3	ACCEPTED	0.01 s	1, 3	details
#4	ACCEPTED	0.01 s	1, 3	details
#5	TIME LIMIT EXCEEDED	--	3	details
#6	TIME LIMIT EXCEEDED	--	3	details
#7	TIME LIMIT EXCEEDED	--	3	details
#8	ACCEPTED	0.57 s	3	details
#9	TIME LIMIT EXCEEDED	--	2, 3	details
#10	TIME LIMIT EXCEEDED	--	2, 3	details
#11	ACCEPTED	0.53 s	2, 3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	ACCEPTED	0.48 s	3	details
#16	TIME LIMIT EXCEEDED	--	3	details

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

bool vis[100001];

int main() {
    ios_base::sync_with_stdio(false);
    memset(vis, 0, sizeof(vis));

    int n, m, k;
    cin >> n >> m >> k;

    unordered_set<int> cities;
    cities.reserve(n);

    for (int i = 0; i < k; i++) {
        int c;
        cin >> c;
        cities.insert(c - 1);
    }

    vector<vector<int>> graph(n);

    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;

        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    bool vis[n];

    for (int i = 0; i < n; i++) {
        memset(vis, 0, sizeof(vis));
        queue<int> p;   
        p.push(i);
        vis[i] = true;

        int dist[n], best = -1;
        dist[i] = 0;

        while (!p.empty()) {
            int current = p.front();
            //cout << "> " << current + 1 << endl;

            if (cities.find(current) != cities.end() && current != i) {
                best = dist[current];
                break;
            }

            p.pop();
            
            for (auto city : graph[current]) {
                if (!vis[city]) {
                    vis[city] = true;
                    p.push(city);
                    dist[city] = dist[current] + 1;
                }
            }
        }

        cout << best << endl;
    }
}

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

Test 2

Group: 1, 3

Verdict: ACCEPTED

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

Test 3

Group: 1, 3

Verdict: ACCEPTED

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

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

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

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

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 (Róbert Kristian Freysson)