Submission #576323

#TimeUsernameProblemLanguageResultExecution timeMemory
576323eecsThrough Another Maze Darkly (CCO21_day1problem3)C++17
0 / 25
917 ms19680 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 800010; int n, q, ptr[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); } } while (q--) { ll k; cin >> k; fill(ptr + 1, ptr + n + 1, 0); int u = 1; do { u = G[u][++ptr[u] %= G[u].size()]; } while (--k && u ^ 1); if (!k) { cout << u << "\n"; continue; } k %= 2 * n - 2; while (k--) u = G[u][++ptr[u] %= G[u].size()]; cout << u << "\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...