This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |