제출 #576329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
576329		eecs	Through Another Maze Darkly (CCO21_day1problem3)	C++17	0 / 25	9040 ms	21684 KiB

Main

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int maxn = 800010;
int n, q, ptr[maxn], pos[maxn], fa[maxn];
bool vis[maxn];
vector<int> G[maxn];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> q;
    for (int i = 1, k; i <= n; i++) {
        cin >> k;
        while (k--) {
            int c;
            cin >> c, G[i].push_back(c);
        }
    }
    auto dfs = [&](auto self, int u) -> void {
        for (int v : G[u]) if (v ^ fa[u]) {
            fa[v] = u, self(self, v);
        }
    };
    dfs(dfs, 1);
    ll step = 0;
    for (int x = 1, cnt = 0; cnt < n || x > 1; step++) {
        if (!vis[x]) vis[x] = 1, cnt++;
        x = G[x][++pos[x] %= G[x].size()];
    }
    while (q--) {
        ll k;
        cin >> k;
        int u = 1;
        if (k < step) {
            fill(ptr + 1, ptr + n + 1, 0);
            while (k--) u = G[u][++ptr[u] %= G[u].size()];
            cout << u << "\n"; continue;
        }
        k = (k - step) % (2 * n - 2);
        copy(pos + 1, pos + n + 1, ptr + 1);
        while (k--) u = G[u][++ptr[u] %= G[u].size()];
        cout << u << "\n";
    }
    return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 12
• Subtask 4: 0 / 5