Submission #998998

#	Time	Username	Problem	Language	Result	Execution time	Memory
998998		vjudge1	Birmingham (COCI20_birmingham)	C++17	70 / 70	180 ms	12884 KiB

birmingham

#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 10;
int n, m, p, k, dist[N];
queue<int> q;
vector<int> g[N];

int main(){
    memset(dist, 31, sizeof dist);

    cin >> n >> m >> p >> k;
    for (int i = 0; i < p; i ++){
        int v;
        cin >> v;

        q.push(v);
        dist[v] = 0;
    }

    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 u : g[v]){
            if (dist[u] > dist[v] + 1){
                q.push(u);
                dist[u] = dist[v] + 1;
            }
        }
    }

    for (int i = 1; i <= n; i ++){
        int sm = 0;
        for (int x = 0; x <= n; x ++){
            sm += (x * k);
            if (dist[i] <= sm){
                cout << x << " ";
                break;
            }
        }
    }
    cout << endl;
}

• 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