Submission #440528

#	Time	Username	Problem	Language	Result	Execution time	Memory
440528		Abrar_Al_Samit	Birmingham (COCI20_birmingham)	C++17	70 / 70	116 ms	8256 KiB

birmingham

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;


#define debug(x) cerr << '[' << (#x) << "] = " << x << '\n';

template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update> ;

const int maxn = 1e5 + 5;
vector<int>g[maxn];
void PlayGround() {
    int n, m, q, k; cin >> n >> m >> q >> k;

    queue<pair<pair<int,int>,int>>qq;
    vector<int>ans(n+1, -1);
    for(int i=0; i<q; ++i) {
        int x; cin >> x;
        qq.push(make_pair(make_pair(x, 0), 1));
        ans[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);
    }

    while(!qq.empty()) {
        int node = qq.front().first.first;
        int dis = qq.front().first.second;
        int day = qq.front().second;
        qq.pop();
        ++dis;
        if(day * k < dis) {
            ++day;
            dis = 1;
        }
        for(int to : g[node]) {
            if(ans[to]==-1) {
                ans[to] = day;
                qq.push(make_pair(make_pair(to, dis), day));
            }
        }
    }
    for(int i=1; i<=n; ++i) {
        assert(ans[i]!=-1);
        cout << ans[i] << ' ';
    }
    cout << '\n';
    #ifndef ONLINE_JUDGE
        cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
} 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input.txt", "r", stdin);
    // #endif
    PlayGround();

    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