結果

問題 No.1030 だんしんぐぱーりない
ユーザー 👑 hos.lyric
提出日時 2020-04-17 22:12:03
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 272 ms / 2,000 ms
コード長 5,274 bytes
コンパイル時間 813 ms
コンパイル使用メモリ 127,820 KB
実行使用メモリ 31,752 KB
最終ジャッジ日時 2024-06-22 06:40:48
合計ジャッジ時間 10,806 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

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

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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; }
bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }
int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; 
    (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }
// T: monoid
// op: T * T -> T
// query(a, b): returns t_a ... t_{b-1}
class SegmentTree(T, alias op) {
  import std.functional : binaryFun;
  alias opFun = binaryFun!op;
  const(T) idT;
  int n;
  T[] ts;
  this(int n_, const(T) idT) {
    this.idT = idT;
    for (n = 1; n < n_; n <<= 1) {}
    ts = new T[n << 1];
    ts[] = idT;
  }
  this(inout(T)[] ts_, const(T) idT) {
    this.idT = idT;
    const n_ = cast(int)(ts_.length);
    for (n = 1; n < n_; n <<= 1) {}
    ts = new T[n << 1];
    ts[0 .. n] = idT;
    ts[n .. n + n_] = ts_[];
    ts[n + n_ .. n << 1] = idT;
    build();
  }
  ref T at(int a) {
    return ts[n + a];
  }
  void build() {
    foreach_reverse (a; 1 .. n) ts[a] = opFun(ts[a << 1], ts[a << 1 | 1]);
  }
  void set(int a, const(T) val) {
    ts[a += n] = val;
    for (; a >>= 1; ) ts[a] = opFun(ts[a << 1], ts[a << 1 | 1]);
  }
  void mulL(int a, const(T) val) {
    set(a, opFun(val, ts[a + n]));
  }
  void mulR(int a, const(T) val) {
    set(a, opFun(ts[a + n], val));
  }
  // T query(int a, int b) const {
  T query(int a, int b) {
    T prodL = idT, prodR = idT;
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) prodL = opFun(prodL, ts[a++]);
      if (b & 1) prodR = opFun(ts[--b], prodR);
    }
    return opFun(prodL, prodR);
  }
}
int N, K, Q;
int[] C;
int[] A;
int[] U, V;
int[][] childrens;
int E;
int[][] par;
int[] dep;
int zeit;
int[] dis, fin;
int[] scores;
void dfs(int u, int p, int score) {
  par[0][u] = p;
  dep[u] = (p == -1) ? 0 : (dep[p] + 1);
  dis[u] = zeit++;
  scores[u] = score;
  foreach (v; childrens[u]) {
    dfs(v, u, max(score, C[v]));
  }
  fin[u] = zeit++;
}
int lca(int u, int v) {
  foreach_reverse (e; 0 .. E) {
    if (dep[u] - (1 << e) >= dep[v]) {
      u = par[e][u];
    }
    if (dep[v] - (1 << e) >= dep[u]) {
      v = par[e][v];
    }
  }
  foreach_reverse (e; 0 .. E) {
    if (par[e][u] != par[e][v]) {
      u = par[e][u];
      v = par[e][v];
    }
  }
  if (u != v) {
    u = par[0][u];
    v = par[0][v];
  }
  return u;
}
void main() {
  try {
    for (; ; ) {
      N = readInt();
      K = readInt();
      Q = readInt();
      C = new int[N];
      foreach (u; 0 .. N) {
        C[u] = readInt();
      }
      A = new int[K];
      foreach (k; 0 .. K) {
        A[k] = readInt() - 1;
      }
      U = new int[N - 1];
      V = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        U[i] = readInt() - 1;
        V[i] = readInt() - 1;
      }
      
      childrens = new int[][N];
      foreach (i; 0 .. N - 1) {
        childrens[V[i]] ~= U[i];
      }
      E = bsr(N) + 1;
      par = new int[][](E, N);
      dep = new int[N];
      zeit = 0;
      dis = new int[N];
      fin = new int[N];
      scores = new int[N];
      dfs(0, -1, C[0]);
      par[0][0] = 0;
      foreach (e; 0 .. E - 1) {
        foreach (u; 0 .. N) {
          par[e + 1][u] = par[e][par[e][u]];
        }
      }
      
      alias Entry = Tuple!(int, "val", int, "key");
      auto segDis = new SegmentTree!(Entry, min)(K, Entry(2 * N, -1));
      auto segFin = new SegmentTree!(Entry, max)(K, Entry(-1, -1));
      auto as = A.dup;
      foreach (k; 0 .. K) {
        segDis.at(k) = Entry(dis[as[k]], as[k]);
        segFin.at(k) = Entry(fin[as[k]], as[k]);
      }
      segDis.build;
      segFin.build;
      foreach (q; 0 .. Q) {
        const typ = readInt();
        switch (typ) {
          case 1: {
            const k = readInt() - 1;
            const u = readInt() - 1;
            as[k] = u;
            segDis.set(k, Entry(dis[as[k]], as[k]));
            segFin.set(k, Entry(fin[as[k]], as[k]));
          } break;
          case 2: {
            const l = readInt() - 1;
            const r = readInt();
            const resDis = segDis.query(l, r);
            const resFin = segFin.query(l, r);
            debug {
              writeln("res = ", resDis, " ", resFin);
            }
            const ans = scores[lca(resDis.key, resFin.key)];
            writeln(ans);
          } break;
          default: assert(false);
        }
      }
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0