Anime Shops

#include <bits/stdc++.h>

using namespace std;

#define N 100001
#define INF 1e6

vector<int> adj[N];
vector<bool> vis[N];
int ans[N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);

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

  fill_n(ans, n + 1, INF);

  queue<array<int, 3>> q;

  int c;
  for (int i = 0; i < k; ++i) {
    cin >> c;
    vis[c].assign(n + 1, false);
    vis[c][c] = true;
    // to visit, context, path length
    q.push({c, c, 0});
  }

  int a, b;
  for (int i = 0; i < m; ++i) {
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }

  while (!q.empty()) {
    auto p = q.front();
    q.pop();

    // printf("visit %d (shop: %d), dist: %d\n", p[0], p[1], p[2]);

    for (auto u : adj[p[0]]) {
      if (!vis[p[1]][u]) {
        vis[p[1]][u] = true;

        if (u != p[1]) {
          if (ans[u] >= p[2] + 1) {
            ans[u] = p[2] + 1;
            q.push({u, p[1], p[2] + 1});
          }
        }
      }
    }
  }

  for (int i = 1; i < n + 1; ++i) {
    cout << (ans[i] >= INF ? -1 : ans[i]) << ' ';
  }
}

Test 1

Group: 1, 3

Verdict: ACCEPTED

Test 2

Group: 1, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 3

Verdict: WRONG ANSWER

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: RUNTIME ERROR

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: WRONG ANSWER

Test 11

Group: 2, 3

Verdict: RUNTIME ERROR

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: RUNTIME ERROR

Test 16

Group: 3

Verdict: WRONG ANSWER