oj.uz

답안 #576679

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
576679 2022-06-13T09:12:12 Z eecs Through Another Maze Darkly (CCO21_day1problem3) C++17
25 / 25
 1176 ms 198916 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]; });
    ll 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];
        }
        ll 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 20 ms 37844 KB Output is correct
2 Correct 28 ms 39968 KB Output is correct
3 Correct 108 ms 57104 KB Output is correct
4 Correct 672 ms 175836 KB Output is correct
5 Correct 855 ms 198916 KB Output is correct
6 Correct 860 ms 190540 KB Output is correct
7 Correct 356 ms 74560 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 37972 KB Output is correct
2 Correct 22 ms 37964 KB Output is correct
3 Correct 21 ms 38028 KB Output is correct
4 Correct 22 ms 38048 KB Output is correct
5 Correct 21 ms 38028 KB Output is correct
6 Correct 22 ms 38044 KB Output is correct
7 Correct 20 ms 38096 KB Output is correct
8 Correct 21 ms 38084 KB Output is correct
9 Correct 21 ms 38100 KB Output is correct
10 Correct 21 ms 38220 KB Output is correct
11 Correct 20 ms 38176 KB Output is correct
12 Correct 26 ms 38280 KB Output is correct
13 Correct 21 ms 38308 KB Output is correct
14 Correct 21 ms 38236 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 38912 KB Output is correct
2 Correct 39 ms 42952 KB Output is correct
3 Correct 77 ms 50264 KB Output is correct
4 Correct 68 ms 46708 KB Output is correct
5 Correct 396 ms 92680 KB Output is correct
6 Correct 417 ms 105552 KB Output is correct
7 Correct 419 ms 97156 KB Output is correct
8 Correct 450 ms 102360 KB Output is correct
9 Correct 564 ms 127052 KB Output is correct
10 Correct 618 ms 139332 KB Output is correct
11 Correct 387 ms 183952 KB Output is correct
12 Correct 343 ms 168052 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 37844 KB Output is correct
2 Correct 28 ms 39968 KB Output is correct
3 Correct 108 ms 57104 KB Output is correct
4 Correct 672 ms 175836 KB Output is correct
5 Correct 855 ms 198916 KB Output is correct
6 Correct 860 ms 190540 KB Output is correct
7 Correct 356 ms 74560 KB Output is correct
8 Correct 20 ms 37972 KB Output is correct
9 Correct 22 ms 37964 KB Output is correct
10 Correct 21 ms 38028 KB Output is correct
11 Correct 22 ms 38048 KB Output is correct
12 Correct 21 ms 38028 KB Output is correct
13 Correct 22 ms 38044 KB Output is correct
14 Correct 20 ms 38096 KB Output is correct
15 Correct 21 ms 38084 KB Output is correct
16 Correct 21 ms 38100 KB Output is correct
17 Correct 21 ms 38220 KB Output is correct
18 Correct 20 ms 38176 KB Output is correct
19 Correct 26 ms 38280 KB Output is correct
20 Correct 21 ms 38308 KB Output is correct
21 Correct 21 ms 38236 KB Output is correct
22 Correct 23 ms 38912 KB Output is correct
23 Correct 39 ms 42952 KB Output is correct
24 Correct 77 ms 50264 KB Output is correct
25 Correct 68 ms 46708 KB Output is correct
26 Correct 396 ms 92680 KB Output is correct
27 Correct 417 ms 105552 KB Output is correct
28 Correct 419 ms 97156 KB Output is correct
29 Correct 450 ms 102360 KB Output is correct
30 Correct 564 ms 127052 KB Output is correct
31 Correct 618 ms 139332 KB Output is correct
32 Correct 387 ms 183952 KB Output is correct
33 Correct 343 ms 168052 KB Output is correct
34 Correct 334 ms 61876 KB Output is correct
35 Correct 441 ms 68428 KB Output is correct
36 Correct 484 ms 77356 KB Output is correct
37 Correct 851 ms 133436 KB Output is correct
38 Correct 884 ms 133344 KB Output is correct
39 Correct 956 ms 136364 KB Output is correct
40 Correct 1008 ms 125580 KB Output is correct
41 Correct 1097 ms 153776 KB Output is correct
42 Correct 1176 ms 190616 KB Output is correct
43 Correct 810 ms 198468 KB Output is correct
44 Correct 843 ms 190104 KB Output is correct
45 Correct 909 ms 155784 KB Output is correct
46 Correct 20 ms 37832 KB Output is correct