제출 #246162

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
246162		alrad	Birmingham (COCI20_birmingham)	C++17	70 / 70	132 ms	10616 KiB

birmingham

#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()

const int N = 1e5 + 2;

vector<vector<int> > g(N , vector<int>());

int main() {
   #ifdef judge
      ifstream cin("input.txt");
   #endif // judge
   ios_base :: sync_with_stdio(0);
   cin.tie(0) , cout.tie(0);
   int n , m , que , k;
   cin >> n >> m >> que >> k;
   queue<int> q;
   vector<int> starts(que) , d(n + 1 , 0);
   vector<bool> used(n + 1 , false);
   for (int i = 0; i < que; i++) {
      cin >> starts[i];
      q.push(starts[i]);
      used[starts[i]] = true;
   }
   for (int i = 0; i < m; i++) {
      int u , v;
      cin >> u >> v;
      g[u].push_back(v);
      g[v].push_back(u);
   }
   while (!q.empty()) {
      int v = q.front();
      q.pop();
      for (int to : g[v]) {
         if (!used[to]) {
            used[to] = true;
            q.push(to);
            d[to] = d[v] + 1;
         } else if (d[v] + 1 < d[to]) {
            q.push(to);
            d[to] = d[v] + 1;
         }
      }
   }
   auto getDay = [&](int dist) {
      int res = 0 , temp = 1;
      while (res < dist) {
         res += (temp * k);
         temp++;
      }
      return temp - 1;
   };
   for (int i = 1; i <= n; i++) {
      if (d[i] != 0) {
         cout << getDay(d[i]) << " ";
      } else {
         cout << 0 << " ";
      }
   }
   return 0;
}

• 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