oj.uz

답안 #219340

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219340 2020-04-05T07:16:23 Z NONAME Birmingham (COCI20_birmingham) C++17
65 / 70
 125 ms 10652 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);

int n, m, Q, k, dist[N], rs[N];
vector <int> g[N];
queue <int> 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--;
//        mk[v] = 1;
        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);
        }
    }

    int cr = 1, i = 1;

    while (cr < n) {
        for (int j = cr; j < cr + i * k; j++)
            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 4992 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 8 ms 5120 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 7 ms 4992 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 4992 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
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 6 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 7 ms 5120 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 10232 KB Output is correct
2 Correct 100 ms 10492 KB Output is correct
3 Correct 105 ms 10488 KB Output is correct
4 Correct 108 ms 9976 KB Output is correct
5 Correct 91 ms 10652 KB Output is correct
6 Correct 111 ms 10488 KB Output is correct

Subtask #9
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 10500 KB Output is correct
2 Correct 100 ms 10452 KB Output is correct
3 Correct 116 ms 10616 KB Output is correct
4 Correct 100 ms 10616 KB Output is correct
5 Correct 116 ms 10616 KB Output is correct
6 Correct 93 ms 10104 KB Output is correct

Subtask #10
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 10324 KB Output is correct
2 Correct 103 ms 10488 KB Output is correct
3 Correct 108 ms 10488 KB Output is correct
4 Correct 101 ms 10488 KB Output is correct
5 Correct 91 ms 10360 KB Output is correct
6 Correct 100 ms 10236 KB Output is correct

Subtask #11
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 10104 KB Output is correct
2 Correct 97 ms 10360 KB Output is correct
3 Correct 113 ms 10488 KB Output is correct
4 Correct 100 ms 10360 KB Output is correct
5 Correct 85 ms 10360 KB Output is correct
6 Correct 88 ms 10104 KB Output is correct

Subtask #12
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 10104 KB Output is correct
2 Correct 92 ms 10360 KB Output is correct
3 Correct 94 ms 10208 KB Output is correct
4 Correct 93 ms 10104 KB Output is correct
5 Incorrect 88 ms 10616 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #13
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 10104 KB Output is correct
2 Correct 107 ms 10232 KB Output is correct
3 Correct 99 ms 10104 KB Output is correct
4 Correct 113 ms 10412 KB Output is correct
5 Correct 114 ms 10616 KB Output is correct
6 Correct 99 ms 10232 KB Output is correct

Subtask #14
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 10104 KB Output is correct
2 Correct 94 ms 9976 KB Output is correct
3 Correct 121 ms 10488 KB Output is correct
4 Correct 125 ms 10104 KB Output is correct
5 Correct 113 ms 10616 KB Output is correct
6 Correct 121 ms 10500 KB Output is correct