oj.uz

Submission #998980

# Submission time Handle Problem Language Result Execution time Memory
998980 2024-06-15T03:07:28 Z vjudge1 Birmingham (COCI20_birmingham) C++17
15 / 70
 84 ms 9808 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2908 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2908 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2904 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2908 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2908 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2908 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 3004 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2908 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2992 KB Output is correct

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 78 ms 9300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 84 ms 9808 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 81 ms 9552 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 72 ms 9040 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 9044 KB Output is correct
2 Incorrect 77 ms 9552 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 74 ms 9040 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 80 ms 9220 KB Output isn't correct
2 Halted 0 ms 0 KB -