Submission #845193

#	Time	Username	Problem	Language	Result	Execution time	Memory
845193		vjudge1	Birmingham (COCI20_birmingham)	C++17	35 / 70	121 ms	11152 KiB

birmingham

#include <bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define int long long
using namespace std;

const int inf = 2e18 + 5;
const int N = 5e3 + 5;
const int mod = 998244353;

int32_t main(){
  //freopen("in.txt","r", stdin);
  int n, m, q, k;
  cin>>n>>m>>q>>k;
  vector<int> st(q);
  vector<int> dis(n+1, mod);
  for(int i = 0; i < q; i++){
    cin>>st[i];
    dis[st[i]] = 0;
  }
  vector<int> adj[n+1];
  for(int i = 0; i < m; i++){
    int u, v;
    cin>>u>>v;
    adj[u].pb(v);
    adj[v].pb(u);
  }

  queue<int> qq;

  vector<int> vis(n+1);
  for(int i = 0; i < q; i++){
    qq.push(st[i]);
    vis[st[i]] = 1;
  }

  while(!qq.empty()){
    int x = qq.front();
    qq.pop();

    for(auto itr: adj[x]){
        if(!vis[itr]){
            vis[itr] = 1;
            dis[itr] = dis[x] + 1, dis[itr];
            //cout<<itr<<" "<<dis[itr]<<endl;
            qq.push(itr);
        }
    }
  }

  for(int i = 1; i <= n; i++){
    int x = dis[i], ans = 0, kk = k;
    while(x > 0){
        x -= kk;
        kk *= 2;
        ans++;
    }
    cout<<ans<<" ";
  }
  cout<<endl;
  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: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5