Submission #823983

#	Time	Username	Problem	Language	Result	Execution time	Memory
823983		ajay	Birmingham (COCI20_birmingham)	C++14	35 / 70	1079 ms	10264 KiB

birmingham

/* Ajay Jadhav */

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'

void dfs(vector<vector<int>> &g, int u, int d, vector<int> &dis)
{
    dis[u] = min(dis[u], d);
    for (int v : g[u])
    {
        if (d + 1 < dis[v])
        {
            dfs(g, v, d + 1, dis);
        }
    }
}

int get_days(int d, int k)
{
    int days = 0;
    int kk = 0;
    int c = 1;
    while (kk < d)
    {
        days++;
        kk += (c++ * k);
    }
    return days;
}

void solve()
{
    int n, m, q, k;
    cin >> n >> m >> q >> k;
    vi starts(q);
    vector<vector<int>> g(n + 1);
    vector<int> days(n + 1);

    rep(i, 0, n + 1)
    {
        days[i] = get_days(i, k);
    }

    vi dis(n + 1, 1e9);
    rep(i, 0, q)
    {
        cin >> starts[i];
    }

    rep(i, 0, m)
    {
        int u, v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }

    rep(i, 0, q)
    {
        int st = starts[i];
        if (dis[st] > 0)
        {
            dfs(g, st, 0, dis);
        }
    }

    rep(i, 1, n + 1)
    {
        cout << days[dis[i]] << " ";
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    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: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5