結果

問題 No.235 めぐるはめぐる (5)
コンテスト
ユーザー hos.lyric
提出日時 2019-01-14 22:55:45
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 1,376 ms / 10,000 ms
コード長 5,583 bytes
コンパイル時間 1,166 ms
コンパイル使用メモリ 121,340 KB
実行使用メモリ 69,844 KB
最終ジャッジ日時 2024-06-13 02:45:25
合計ジャッジ時間 6,811 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 3
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


immutable MO = 10L^^9 + 7;
immutable LIM_LOGN = 20;

class SegmentTree {
  int n;
  long[] coefSum;
  long[] sum, add;
  this(int n_, long[] ini, long[] coef) {
    for (n = 1; n < n_; n <<= 1) {}
    coefSum = new long[n + 1];
    foreach (i; 0 .. n_) {
      coefSum[i + 1] = (coefSum[i] + coef[i]) % MO;
    }
    coefSum[n_ + 1 .. $] = coefSum[n_];
    sum = new long[n << 1];
    add = new long[n << 1];
    foreach (i; 0 .. n_) {
      sum[n + i] = ini[i];
    }
    foreach_reverse (u; 1 .. n) {
      sum[u] = (sum[u << 1] + sum[u << 1 | 1]) % MO;
    }
  }
  private long query(int u, int l, int r, int a, int b, long val) {
    chmax(a, l);
    chmin(b, r);
    if (a >= b) {
      return 0;
    }
debug{
// writefln("query %s [%s, %s); [%s, %s) %s",u,l,r,a,b,val);
}
    if (a == l && b == r) {
      (sum[u] += (coefSum[r] - coefSum[l]) * val) %= MO;
      (add[u] += val) %= MO;
      return sum[u];
    }
    const uL = u << 1;
    const uR = u << 1 | 1;
    const mid = (l + r) >> 1;
    (sum[uL] += (coefSum[mid] - coefSum[l]) * add[u]) %= MO;
    (add[uL] += add[u]) %= MO;
    (sum[uR] += (coefSum[r] - coefSum[mid]) * add[u]) %= MO;
    (add[uR] += add[u]) %= MO;
    add[u] = 0;
    const ret = (query(uL, l, mid, a, b, val) + query(uR, mid, r, a, b, val)) % MO;
    sum[u] = (sum[uL] + sum[uR]) % MO;
    return ret;
  }
  long query(int a, int b, long val) {
    return query(1, 0, n, a, b + 1, val);
  }
}

int N;
long[] S;
long[] C;
int[] A, B;
int Q;
int[] T, X, Y;
long[] Z;

int[][] graph;
int[] par;
int[] dep;
int[] sz;

int E;
int[] F;
int[][] us;
int[] es, fs;

void dfs(int u, int p) {
  par[u] = p;
  dep[u] = (p == -1) ? 0 : (dep[p] + 1);
  sz[u] = 1;
  foreach (v; graph[u]) {
    if (v != p) {
      dfs(v, u);
      sz[u] += sz[v];
    }
  }
  bool found;
  foreach (v; graph[u]) {
    if (v != p) {
      if (2 * sz[v] >= sz[u]) {
        debug {
          writefln("heavy %s %s", u, v);
        }
        found = true;
        es[u] = es[v];
      }
    }
  }
  if (!found) {
    es[u] = E++;
    F ~= 0;
  }
  fs[u] = F[es[u]]++;
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      S = new long[N];
      foreach (u; 0 .. N) {
        S[u] = readLong();
      }
      C = new long[N];
      foreach (u; 0 .. N) {
        C[u] = readLong();
      }
      A = new int[N - 1];
      B = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
      }
      Q = readInt();
      T = new int[Q];
      X = new int[Q];
      Y = new int[Q];
      Z = new long[Q];
      foreach (q; 0 .. Q) {
        T[q] = readInt();
        X[q] = readInt() - 1;
        Y[q] = readInt() - 1;
        if (T[q] == 0) {
          Z[q] = readLong();
        }
      }
      
      graph = new int[][N];
      foreach (i; 0 .. N - 1) {
        graph[A[i]] ~= B[i];
        graph[B[i]] ~= A[i];
      }
      par = new int[N];
      dep = new int[N];
      sz = new int[N];
      E = 0;
      F = [];
      es = new int[N];
      fs = new int[N];
      const rt = 0;
      dfs(rt, -1);
      us = new int[][E];
      foreach (e; 0 .. E) {
        us[e] = new int[F[e]];
      }
      foreach (u; 0 .. N) {
        fs[u] = F[es[u]] - 1 - fs[u];
        us[es[u]][fs[u]] = u;
      }
      debug {
        writefln("par = %s", par);
        writefln("dep = %s", dep);
        writefln("E = %s", E);
        writefln("F = %s", F);
        writefln("es = %s", es);
        writefln("fs = %s", fs);
        writefln("us = %s", us);
      }
      auto segs = new SegmentTree[E];
      foreach (e; 0 .. E) {
        segs[e] = new SegmentTree(F[e], us[e].map!(u => S[u]).array, us[e].map!(u => C[u]).array);
      }
      
      foreach (q; 0 .. Q) {
        debug {
          writefln("query %s %s %s", X[q], Y[q], Z[q]);
        }
        long ans;
        for (int u = X[q], v = Y[q]; ; ) {
          debug {
            writefln("  u = %s, v = %s", u, v);
          }
          if (es[u] == es[v]) {
            (ans += segs[es[u]].query(min(fs[u], fs[v]), max(fs[u], fs[v]), Z[q])) %= MO;
            break;
          }
          if (dep[us[es[u]][0]] > dep[us[es[v]][0]]) {
            (ans += segs[es[u]].query(0, fs[u], Z[q])) %= MO;
            u = par[us[es[u]][0]];
          } else {
            (ans += segs[es[v]].query(0, fs[v], Z[q])) %= MO;
            v = par[us[es[v]][0]];
          }
        }
        ans = (ans % MO + MO) % MO;
        if (T[q] == 1) {
          writeln(ans);
        }
      }
    }
  } catch (EOFException e) {
  }
}
0