Submission #998980

#	Time	Username	Problem	Language	Result	Execution time	Memory
998980		vjudge1	Birmingham (COCI20_birmingham)	C++17	15 / 70	84 ms	9808 KiB

birmingham

#include<bits/stdc++.h>

using namespace std;

const int N = 1e5+5;
int n, m, q, k;
vector<int> G[N];
int dist[N];

void bfs()
{
  queue<int> Q;
  for(int i = 1; i <= n; i ++)
    if(dist[i] == 0) Q.push(i);

  while(Q.size())
    {
      int u = Q.front();
      Q.pop();
      for(int v : G[u])
	if(dist[u] + 1 < dist[v])
	  {
	    dist[v] = dist[u] + 1;
	    Q.push(v);
	  }
    }
}

int main()
{
  cin >> n >> m >> q >> k;

  for(int i = 1; i <= n; i ++)
    dist[i] = N * 4;
  
  for(int i = 0; i < q; i ++)
    {
      int x;
      cin >> x;
      dist[x] = 0;
    }

  for(int i = 0; i < m; i ++)
    {
      int u, v;
      cin >> u >> v;
      G[u].push_back(v);
      G[v].push_back(u);
    }

  bfs();

  for(int i = 1; i <= n; i ++)
    cout << (dist[i] + k - 1) / k << ' ';
  cout << endl;
  return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 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