제출 #661280

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
661280		Alex_tz307	Sprinkler (JOI22_sprinkler)	C++17	0 / 100	407 ms	44592 KiB

sprinkler

#include <bits/stdc++.h>

using namespace std;

const int kD = 40;

void multSelf(int &x, int y, int mod) {
  x = (int64_t)x * y % mod;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, l;
  cin >> n >> l;
  vector<int> par(1 + n + kD);
  for (int i = 1; i < n; ++i) {
    int u, v;
    cin >> u >> v;
    par[v] = u;
  }
  par[1] = n + 1;
  for (int i = n + 1; i < n + kD; ++i) {
    par[i] = i + 1;
  }
  vector<int> h(n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> h[i];
  }
  vector<vector<int>> coef(1 + n + kD, vector<int>(1 + kD, 1));
  int q;
  cin >> q;
  for (int i = 1; i <= q; ++i) {
    int t;
    cin >> t;
    if (t == 1) {
      int x, d, w;
      cin >> x >> d >> w;
      int node = x, curr = d;
      while (curr >= 0) {
        multSelf(coef[node][curr], w, l);
        node = par[node];
        curr -= 1;
      }
      node = x, curr = d - 1;
      while (curr >= 0) {
        multSelf(coef[node][curr], w, l);
        node = par[node];
        curr -= 1;
      }
    } else {
      int x;
      cin >> x;
      int res = h[x];
      for (int d = 0; d <= kD; ++d) {
        multSelf(res, coef[x][d], l);
        x = par[x];
      }
      cout << res << '\n';
    }
  }
  return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 9
• Subtask 3: 0 / 29
• Subtask 4: 0 / 12
• Subtask 5: 0 / 30
• Subtask 6: 0 / 17