제출 #845165

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
845165		vjudge1	Birmingham (COCI20_birmingham)	C++17	70 / 70	98 ms	9812 KiB

birmingham

/**
 *  author: kututay
 *  created: 06.09.2023 15:06:26
**/
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
  #include "/Users/kutay/CP/templates/debug.h"
#else
  #define debug(...) void(38)
#endif

const int inf = 1e9;

int32_t main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int n, m, qu, k; cin >> n >> m >> qu >> k;
  vector<int> a(qu), ans(n, inf); for (int &x : a) cin >> x, x--;
  vector<vector<int>> g(n);
  for (int i = 0; i < m; i++) {
    int x, y; cin >> x >> y, x--, y--;
    g[x].emplace_back(y);
    g[y].emplace_back(x);
  }

  queue<pair<int, int>> q;
  for (int x : a) {
    q.emplace(x, 0);
  }

  while (q.size()) {
    auto [node, depth] = q.front();
    q.pop();
    if (ans[node] != inf) continue;
    ans[node] = round(sqrt(ceil(depth * 2.0 / k)));
    for (auto next : g[node]) {
      q.emplace(next, depth + 1);
    }
  }
  for (int &x : ans) cout << x << " ";
  cout << '\n';
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5