Anime Shops

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

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);    
    int n,m,k; cin >> n >> m >> k;
    

    vector<int> visited(n, 0);
    vector<int> nearest(n, -1);
    queue<pair<int,pair<int,int>>> q;
    vector<vector<int>> adj(n);
    for(int i = 0; i < k; i++) {
        int a; cin >> a;
        a--;
        q.push({a,{0,a}});
    }
    for(int i = 0; i < m; i++) {
        int a,b; cin >> a >> b;
        a--; b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    while(!q.empty()) {
        int d = q.front().second.first; int v = q.front().first; 
        int origin = q.front().second.second; q.pop();
        if(d != 0) {
            if(nearest[v] == -1) nearest[v] = d;
            nearest[v] = min(nearest[v], d);
        }
        for(auto u : adj[v]) {
            if(visited[u] == 2 || u == origin) continue;
            visited[u]++;
            q.push({u, {d+1, origin}});
        }
    }
    for(int i = 0; i < n; i++) {
        cout << nearest[i] << ' ';
    }
}

Test 1

Group: 1, 3

Verdict: ACCEPTED

Test 2

Group: 1, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 3

Verdict: ACCEPTED

Test 4

Group: 1, 3

Verdict: ACCEPTED

Test 5

Group: 3

Verdict: ACCEPTED

Test 6

Group: 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: WRONG ANSWER

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: WRONG ANSWER

Test 11

Group: 2, 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: WRONG ANSWER