全部评论 3

  • 感谢反馈,我们近期会核验

    6天前 来自 浙江

    0
  • 1周前 来自 浙江

    0
  • 另外程序题T1数据是不是挂了,没有给出std我也不好找问题,就是我在锣鼓AC的代码在ACGO会WA ALL

    1周前 来自 浙江

    0
    • 下面是我对代码:

      #include<bits/stdc++.h>
      using namespace std;
      #define int long long
      #define inf 0x3f3f3f3f3f3f3f3f
      const int maxn = 1e5 + 10, maxk = 20;
      int n, q, p[maxk];
      int f[maxn][maxk], g[maxn][maxk];
      signed main() {
      	ios::sync_with_stdio(false);
      	cin.tie(0), cout.tie(0);
      	cin >> n >> q;
      	p[0] = 1;
      	for (int i = 1; i < maxk; i++) p[i] = p[i - 1] * 2;
      	for (int i = 1; i <= n; i++) g[i][0] = inf;
      	for (int i = 2; i <= n; i++) cin >> f[i][0], g[f[i][0]][0] = min(g[f[i][0]][0], i);
      	f[1][0] = 1;
      	for (int i = 1; i <= n; i++) if (g[i][0] == inf) g[i][0] = i;
      	for (int k = 1; k < maxk; k++) {
      		for (int i = 1; i <= n; i++) {
      			f[i][k] = f[f[i][k - 1]][k - 1];
      			g[i][k] = g[g[i][k - 1]][k - 1];
      		}
      	}
      	for (int i = 1, s, k; i <= q; i++) {
      		cin >> s >> k;
      		for (int _ = 1, x; _ <= k; _++) {
      			cin >> x;
      			if (x > 0) {
      				for (int j = maxk - 1; j >= 0 && x; j--) {
      					if (p[j] > x) continue;
      					x -= p[j], s = f[s][j];
      				}
      			} else {
      				x = -x;
      				for (int j = maxk - 1; j >= 0 && x; j--) {
      					if (p[j] > x) continue;
      					x -= p[j], s = g[s][j];
      				}
      			}
      		}
      		cout << s << "\n";
      	}
      	return 0;
      }
      

      1周前 来自 浙江

      0

热门讨论