結果

問題 No.2643 Many Range Sums Problems
ユーザー SSRS
提出日時 2024-02-19 23:18:31
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 40 ms / 8,000 ms
コード長 2,347 bytes
コンパイル時間 4,081 ms
コンパイル使用メモリ 209,376 KB
最終ジャッジ日時 2025-02-19 17:41:28
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
const int LOG = 13;
const long long INF = 1000000000000000000;
int main(){
  int N, K;
  cin >> N >> K;
  vector<int> R(N);
  vector<long long> X(N);
  for (int i = 0; i < N; i++){
    cin >> R[i] >> X[i];
  }
  vector<vector<pair<long long, int>>> E(N + 1);
  for (int i = 0; i < N; i++){
    E[i].push_back(make_pair(X[i], R[i]));
    E[R[i]].push_back(make_pair(-X[i], i));
  }
  vector<int> d(N + 1, 0);
  vector<long long> s(N + 1, 0);
  for (int i = N - 1; i >= 0; i--){
    d[i] = d[R[i]] + 1;
    s[i] = s[R[i]] + X[i];
  }
  vector<vector<int>> pp(LOG, vector<int>(N + 1, -1));
  vector<vector<long long>> sum(LOG, vector<long long>(N + 1, 0));
  for (int i = 0; i < N; i++){
    pp[0][i] = R[i];
    sum[0][i] = X[i];
  }
  for (int i = 0; i < LOG - 1; i++){
    for (int j = 0; j <= N; j++){
      if (pp[i][j] != -1){
        pp[i + 1][j] = pp[i][pp[i][j]];
        sum[i + 1][j] = sum[i][j] + sum[i][pp[i][j]];
      }
    }
  }
  auto lca = [&](int u, int v){
    if (d[u] > d[v]){
      swap(u, v);
    }
    for (int i = LOG - 1; i >= 0; i--){
      if (((d[v] - d[u]) >> i & 1) == 1){
        v = pp[i][v];
      }
    }
    if (u == v){
      return u;
    }
    for (int i = LOG - 1; i >= 0; i--){
      if (pp[i][u] != pp[i][v]){
        u = pp[i][u];
        v = pp[i][v];
      }
    }
    return R[u];
  };
  vector<int> add(N + 1, 0);
  int add_all = 0;
  vector<long long> mn(N, -INF), mx(N, INF);
  for (int i = 0; i < N; i++){
    int w = lca(i, i + 1);
    if (s[i] - s[i + 1] < 0 || s[i] - s[i + 1] > K){
      add_all++;
      add[i]--;
      add[i + 1]--;
      add[w] += 2;
    }
    int u = i, v = i + 1;
    while (u != v){
      if (d[u] > d[v]){
        mn[u] = max(mn[u], -s[i] + s[i + 1]);
        mx[u] = min(mx[u], -s[i] + s[i + 1] + K);
        u = R[u];
      } else {
        mn[v] = max(mn[v], s[i] - s[i + 1] - K);
        mx[v] = min(mx[v], s[i] - s[i + 1]);
        v = R[v];
      }
    }
  }
  vector<bool> ok(N, true);
  for (int i = 0; i < N; i++){
    add[R[i]] += add[i];
    if (add[i] + add_all > 0){
      ok[i] = false;
    }
  }
  for (int i = 0; i < N; i++){
    if (mn[i] > mx[i]){
      ok[i] = false;
    }
  }
  for (int i = 0; i < N; i++){
    if (ok[i]){
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0