답안 #823985

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823985 2023-08-13T11:06:34 Z ajay Birmingham (COCI20_birmingham) C++14
70 / 70
76 ms 10892 KB
/* 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);

    queue<int> que;

    rep(i, 0, q)
    {
        int p;
        cin >> p;
        que.push(p);
        dis[p] = 0;
    }

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

    while (!que.empty())
    {
        int u = que.front();
        que.pop();

        for (int v : g[u])
        {
            if (dis[v] > dis[u] + 1)
            {
                dis[v] = dis[u] + 1;
                que.push(v);
            }
        }
    }

    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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 7820 KB Output is correct
2 Correct 59 ms 10196 KB Output is correct
3 Correct 65 ms 10696 KB Output is correct
4 Correct 45 ms 9268 KB Output is correct
5 Correct 44 ms 9456 KB Output is correct
6 Correct 74 ms 10892 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 8048 KB Output is correct
2 Correct 59 ms 10028 KB Output is correct
3 Correct 62 ms 10428 KB Output is correct
4 Correct 57 ms 10324 KB Output is correct
5 Correct 49 ms 10092 KB Output is correct
6 Correct 58 ms 10236 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 7756 KB Output is correct
2 Correct 61 ms 10344 KB Output is correct
3 Correct 62 ms 10696 KB Output is correct
4 Correct 56 ms 10324 KB Output is correct
5 Correct 60 ms 9632 KB Output is correct
6 Correct 50 ms 10260 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 7628 KB Output is correct
2 Correct 59 ms 10064 KB Output is correct
3 Correct 76 ms 10480 KB Output is correct
4 Correct 52 ms 9700 KB Output is correct
5 Correct 43 ms 9420 KB Output is correct
6 Correct 54 ms 10132 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 7600 KB Output is correct
2 Correct 59 ms 9864 KB Output is correct
3 Correct 61 ms 9856 KB Output is correct
4 Correct 53 ms 9668 KB Output is correct
5 Correct 46 ms 9816 KB Output is correct
6 Correct 51 ms 10068 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 7608 KB Output is correct
2 Correct 57 ms 9828 KB Output is correct
3 Correct 56 ms 9960 KB Output is correct
4 Correct 52 ms 10060 KB Output is correct
5 Correct 65 ms 9532 KB Output is correct
6 Correct 64 ms 10256 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 7656 KB Output is correct
2 Correct 53 ms 9360 KB Output is correct
3 Correct 61 ms 10632 KB Output is correct
4 Correct 50 ms 9636 KB Output is correct
5 Correct 59 ms 9868 KB Output is correct
6 Correct 59 ms 10828 KB Output is correct