oj.uz

답안 #576653

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
576653 2022-06-13T08:55:47 Z eecs Through Another Maze Darkly (CCO21_day1problem3) C++17
25 / 25
 1239 ms 216892 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int maxn = 800010;
int n, m, tot, ver[maxn << 1], lev[maxn], id[maxn], ans[maxn];
ll q[maxn];
vector<int> G[maxn], V[maxn];

#define mid ((l + r) >> 1)
#define ls (k << 1)
#define rs (k << 1 | 1)
int sz[maxn << 3];

void upd(int k, int l, int r, int p) {
    sz[k]++;
    if (l < r) mid >= p ? upd(ls, l, mid, p) : upd(rs, mid + 1, r, p);
}

int get(int k, int l, int r, int p) {
    if (l == r) return ver[l];
    return sz[ls] >= p ? get(ls, l, mid, p) : get(rs, mid + 1, r, p - sz[ls]);
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> m;
    for (int i = 1, k; i <= n; i++) {
        cin >> k, G[i].resize(k);
        for (int &x : G[i]) cin >> x;
        rotate(G[i].begin(), G[i].begin() + 1, G[i].end());
    }
    auto dfs = [&](auto self, int u, int fa) -> void {
        if (u > 1) ver[++tot] = u, V[lev[u]].push_back(tot);
        bool flag = 0;
        for (int v : G[u]) {
            if (v == fa) { flag = 1; continue; }
            if (!flag) continue;
            lev[v] = lev[u] + 1, self(self, v, u);
            ver[++tot] = u, V[lev[v]].push_back(tot);
        }
        for (int v : G[u]) {
            if (v == fa) break;
            lev[v] = lev[u], self(self, v, u);
            ver[++tot] = u, V[lev[v]].push_back(tot);
        }
    };
    lev[1] = 1, dfs(dfs, 1, 0);
    for (int i = 1; i <= m; i++) {
        cin >> q[i];
    }
    iota(id + 1, id + m + 1, 1);
    sort(id + 1, id + m + 1, [&](int i, int j) { return q[i] < q[j]; });
    long long cur = 0;
    for (int i = 1, j = 1; i <= m; i++) {
        for (; j <= n && cur < q[id[i]]; j++) {
            for (int x : V[j]) upd(1, 1, tot, x);
            cur += sz[1];
        }
        long long x = q[id[i]] - (cur - sz[1]);
        ans[id[i]] = get(1, 1, tot, (x - 1) % (2 * n - 2) + 1);
    }
    for (int i = 1; i <= m; i++) {
        cout << ans[i] << "\n";
    }
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37844 KB Output is correct
2 Correct 26 ms 39764 KB Output is correct
3 Correct 109 ms 56252 KB Output is correct
4 Correct 685 ms 175852 KB Output is correct
5 Correct 885 ms 216892 KB Output is correct
6 Correct 870 ms 208388 KB Output is correct
7 Correct 350 ms 74608 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 37972 KB Output is correct
2 Correct 18 ms 37896 KB Output is correct
3 Correct 20 ms 37972 KB Output is correct
4 Correct 20 ms 38020 KB Output is correct
5 Correct 20 ms 38052 KB Output is correct
6 Correct 21 ms 38100 KB Output is correct
7 Correct 22 ms 38016 KB Output is correct
8 Correct 22 ms 38092 KB Output is correct
9 Correct 21 ms 38100 KB Output is correct
10 Correct 21 ms 38100 KB Output is correct
11 Correct 24 ms 38224 KB Output is correct
12 Correct 23 ms 38300 KB Output is correct
13 Correct 20 ms 38168 KB Output is correct
14 Correct 22 ms 38168 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 38868 KB Output is correct
2 Correct 51 ms 42316 KB Output is correct
3 Correct 75 ms 48972 KB Output is correct
4 Correct 75 ms 45884 KB Output is correct
5 Correct 427 ms 91980 KB Output is correct
6 Correct 447 ms 105648 KB Output is correct
7 Correct 483 ms 97312 KB Output is correct
8 Correct 482 ms 102376 KB Output is correct
9 Correct 622 ms 126952 KB Output is correct
10 Correct 707 ms 139356 KB Output is correct
11 Correct 404 ms 183888 KB Output is correct
12 Correct 387 ms 168140 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 37844 KB Output is correct
2 Correct 26 ms 39764 KB Output is correct
3 Correct 109 ms 56252 KB Output is correct
4 Correct 685 ms 175852 KB Output is correct
5 Correct 885 ms 216892 KB Output is correct
6 Correct 870 ms 208388 KB Output is correct
7 Correct 350 ms 74608 KB Output is correct
8 Correct 19 ms 37972 KB Output is correct
9 Correct 18 ms 37896 KB Output is correct
10 Correct 20 ms 37972 KB Output is correct
11 Correct 20 ms 38020 KB Output is correct
12 Correct 20 ms 38052 KB Output is correct
13 Correct 21 ms 38100 KB Output is correct
14 Correct 22 ms 38016 KB Output is correct
15 Correct 22 ms 38092 KB Output is correct
16 Correct 21 ms 38100 KB Output is correct
17 Correct 21 ms 38100 KB Output is correct
18 Correct 24 ms 38224 KB Output is correct
19 Correct 23 ms 38300 KB Output is correct
20 Correct 20 ms 38168 KB Output is correct
21 Correct 22 ms 38168 KB Output is correct
22 Correct 25 ms 38868 KB Output is correct
23 Correct 51 ms 42316 KB Output is correct
24 Correct 75 ms 48972 KB Output is correct
25 Correct 75 ms 45884 KB Output is correct
26 Correct 427 ms 91980 KB Output is correct
27 Correct 447 ms 105648 KB Output is correct
28 Correct 483 ms 97312 KB Output is correct
29 Correct 482 ms 102376 KB Output is correct
30 Correct 622 ms 126952 KB Output is correct
31 Correct 707 ms 139356 KB Output is correct
32 Correct 404 ms 183888 KB Output is correct
33 Correct 387 ms 168140 KB Output is correct
34 Correct 415 ms 61948 KB Output is correct
35 Correct 409 ms 68428 KB Output is correct
36 Correct 540 ms 77456 KB Output is correct
37 Correct 880 ms 133424 KB Output is correct
38 Correct 1050 ms 133420 KB Output is correct
39 Correct 1048 ms 136464 KB Output is correct
40 Correct 998 ms 142704 KB Output is correct
41 Correct 1109 ms 171360 KB Output is correct
42 Correct 1239 ms 208368 KB Output is correct
43 Correct 921 ms 215624 KB Output is correct
44 Correct 909 ms 207220 KB Output is correct
45 Correct 1092 ms 155748 KB Output is correct
46 Correct 23 ms 37908 KB Output is correct