oj.uz

답안 #219343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219343 2020-04-05T07:17:51 Z NONAME Birmingham (COCI20_birmingham) C++17
70 / 70
 140 ms 13560 KB 
#include <bits/stdc++.h>
#include <time.h>
//#include <random>
//#ifndef _LOCAL
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#endif
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 2 * 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;

//mt19937 rnd(0);

ll n, m, Q, k, dist[N], rs[N];
vector <ll> g[N];
queue <ll> q;

void solve() {
    cin >> n >> m >> Q >> k;

    for (int i = 0; i < n; i++)
        dist[i] = -1;

    for (int i = 0; i < Q; i++) {
        int v; cin >> v; v--;
        dist[v] = 0;
        q.push(v);
    }

    for (int i = 0; i < m; i++) {
        int v, u; cin >> v >> u; v--; u--;

        g[v].pb(u);
        g[u].pb(v);
    }

    while (!q.empty()) {
        int v = q.front();
        q.pop();

        for (int i = 0; i < sz(g[v]); i++) {
            int nxt = g[v][i];

            if (dist[nxt] != -1) continue;

            dist[nxt] = dist[v] + 1;
            q.push(nxt);
        }
    }

    ll cr = 1, i = 1;

    while (cr < n) {
        for (int j = cr; j < cr + i * k; j++)
            if (j < n)
                rs[j] = i;
        cr += i * k;
        i++;
    }

    for (int i = 0; i < n; i++)
        cout << rs[dist[i]] << ' ';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef _LOCAL
        in("input.txt");

        int t = 1;
//        cin >> t;
        for (int i = 1; i <= t; i++) {
            cout << "Test #" << i << elf;

            clock_t start_time = clock();

            solve();

            cerr.precision(4); cerr << fixed;
            cerr << elf;
            cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;

            cout << elf;
        }
    #else
        int t = 1;
//        cin >> t;

        while (t--) {
            solve();
            cout << el;
        }
    #endif
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 8 ms 5120 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5120 KB Output is correct
2 Correct 7 ms 5068 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 8 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 12920 KB Output is correct
2 Correct 113 ms 13408 KB Output is correct
3 Correct 140 ms 13560 KB Output is correct
4 Correct 94 ms 12408 KB Output is correct
5 Correct 99 ms 12664 KB Output is correct
6 Correct 110 ms 13432 KB Output is correct

Subtask #9
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 13408 KB Output is correct
2 Correct 106 ms 13288 KB Output is correct
3 Correct 114 ms 13408 KB Output is correct
4 Correct 115 ms 13532 KB Output is correct
5 Correct 105 ms 13348 KB Output is correct
6 Correct 99 ms 12740 KB Output is correct

Subtask #10
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 13048 KB Output is correct
2 Correct 115 ms 13536 KB Output is correct
3 Correct 125 ms 13560 KB Output is correct
4 Correct 132 ms 13508 KB Output is correct
5 Correct 106 ms 12792 KB Output is correct
6 Correct 100 ms 12792 KB Output is correct

Subtask #11
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 12664 KB Output is correct
2 Correct 104 ms 13164 KB Output is correct
3 Correct 122 ms 13432 KB Output is correct
4 Correct 110 ms 12988 KB Output is correct
5 Correct 95 ms 12536 KB Output is correct
6 Correct 102 ms 12792 KB Output is correct

Subtask #12
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 12664 KB Output is correct
2 Correct 109 ms 13048 KB Output is correct
3 Correct 117 ms 12940 KB Output is correct
4 Correct 99 ms 12920 KB Output is correct
5 Correct 107 ms 12920 KB Output is correct
6 Correct 95 ms 12664 KB Output is correct

Subtask #13
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 12664 KB Output is correct
2 Correct 107 ms 13048 KB Output is correct
3 Correct 104 ms 12664 KB Output is correct
4 Correct 120 ms 13216 KB Output is correct
5 Correct 102 ms 12792 KB Output is correct
6 Correct 102 ms 12920 KB Output is correct

Subtask #14
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 12792 KB Output is correct
2 Correct 101 ms 12536 KB Output is correct
3 Correct 117 ms 13560 KB Output is correct
4 Correct 99 ms 12792 KB Output is correct
5 Correct 114 ms 13040 KB Output is correct
6 Correct 120 ms 13432 KB Output is correct