Submission #219360

#	Time	Username	Problem	Language	Result	Execution time	Memory
219360		kartel	Birmingham (COCI20_birmingham)	C++14	70 / 70	439 ms	22376 KiB

birmingham

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +400500
//#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

ll d[N], n, m, q, k, x, y, i, pr[N];
priority_queue <ll, vector <ll> > qu;
vector <ll> g[N];

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
//    in("input.txt");
//    out("output.txt");
    cin >> n >> m >> q >> k;
    for (i = 1; i <= n; i++) d[i] = 1e9;
    for (i = 1; i <= n; i++) pr[i] = i + pr[i - 1];
    for (i = 1; i <= n; i++) pr[i] = pr[i] * k;
    for (i = 1; i <= q; i++)
    {
        cin >> x;
        d[x] = 0;
        qu.push(x);
    }
    for (i = 1; i <= m; i++)
    {
        cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
    }
    while (qu.size())
    {
        int v = qu.top();qu.pop();

        for (auto u : g[v])
            if (d[u] > d[v] + 1)
        {
            d[u] = d[v] + 1;
            qu.push(u);
        }

    }

    for (i = 1; i <= n; i++)
    {
        if (d[i] == 0) cout << "0 ";
        else cout << (lower_bound(pr + 1, pr + 1 + n, d[i]) - pr) << " ";
    }
}

• 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