Submission #845155

#	Time	Username	Problem	Language	Result	Execution time	Memory
845155		vjudge1	Birmingham (COCI20_birmingham)	C++17	70 / 70	79 ms	14716 KiB

birmingham

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define int long long
 
#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    #define OPEN freopen(".in", "r", stdin); \
                 freopen(".out", "w", stdout);
#else
    #define OPEN void(23);
#endif

void solve()
{
    int n, m, q, k; cin >> n >> m >> q >> k;
    vector <int> mans(q);
    for(int &i : mans) cin >> i;

    vector <int> adj[n +1];
    for(int i = 1; i <= m; i++)
    {
        int u, v; cin >> u >> v;
        adj[u].emplace_back(v);
        adj[v].emplace_back(u);
    }

    vector <int> cev(n +1, -1);
    queue <pair <int, int>> que;
    for(int &i : mans) que.emplace(i, 0);
    while(!que.empty())
    {
        auto [x, d] = que.front();
        que.pop();
        if(cev[x] != -1) continue;
        cev[x] = d;

        for(int &child : adj[x])
        {
            que.emplace(child, d +1);
        }
    }

    auto find = [&](int x) -> int
    {
        int _k = k;
        int i = 0, j = 0;
        while(j < x) i++, j += k, k += _k;
        k = _k;

        return i;
    };

    for(int i = 1; i <= n; i++) cout << find(cev[i]) << " ";

    return;
}

int32_t main()
{
    OPEN;

    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int t = 1; //cin >> t;
    while(t--)
    {
        solve();
    }
}

• 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