Submission #845191

#	Time	Username	Problem	Language	Result	Execution time	Memory
845191		vjudge1	Birmingham (COCI20_birmingham)	C++17	70 / 70	140 ms	10024 KiB

birmingham

#include <bits/stdc++.h>
using namespace std;
int main() {
  int N, M, Q, K; 
  cin >> N >> M >> Q >> K;
  vector<int> s(Q);
  for (int i = 0;i < Q; ++i) {
    cin >> s[i];
    s[i] -= 1;
  }
  vector<vector<int>> g(N);
  for (int i = 0;i < M; ++i) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  queue<array<int, 2>> q;
  for (int i = 0;i < Q; ++i) {
    q.push({0, s[i]});
  }
  vector<int> dist(N, -1);
  while (q.size()) {
    auto [d, u] = q.front();
    q.pop();
    if (dist[u] != -1) {
      continue;
    }
    dist[u] = d;
    for (int v : g[u]) {
      q.push({d+1, v});
    }
  }
  vector<int> idx(N), ans(N);
  iota(idx.begin(), idx.end(), 0);
  sort(idx.begin(), idx.end(), [&](int i, int j) { return dist[i] < dist[j]; });
  int64_t day = 0, can = 0;
  for (int i = 0;i < N; ++i) {
    int j = idx[i];
    while (can < dist[j]) {
      day += 1;
      can += K * day;
    } 
    ans[j] = day;
  }
  for (int i = 0;i < N; ++i) {
    cout << ans[i] << ' ';
  }
}

• 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