結果
| 問題 |
No.1030 だんしんぐぱーりない
|
| コンテスト | |
| ユーザー |
 kakel-san
|
| 提出日時 | 2025-11-07 00:06:49 |
| 言語 | C# (.NET 8.0.404) |
| 結果 |
AC
|
| 実行時間 | 983 ms / 2,000 ms |
| コード長 | 8,559 bytes |
| コンパイル時間 | 8,718 ms |
| コンパイル使用メモリ | 168,472 KB |
| 実行使用メモリ | 194,152 KB |
| 最終ジャッジ日時 | 2025-11-07 00:07:25 |
| 合計ジャッジ時間 | 34,446 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 40 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (121 ミリ秒)。 main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Globalization;
class Program
{
static int NN => int.Parse(ReadLine());
static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
public static void Main()
{
Solve();
}
static void Solve()
{
var m = NList;
var (n, k, q) = (m[0], m[1], m[2]);
var c = NList;
var a = NMi;
var map = NMap(n - 1);
var query = NArr(q);
var tree = new List<int>[n];
for (var i = 0; i < n; ++i) tree[i] = new List<int>();
foreach (var edge in map)
{
tree[edge[0]].Add(edge[1]);
tree[edge[1]].Add(edge[0]);
}
lca = new LCA(tree);
var maxc = (int[])c.Clone();
MaxC(0, -1, tree, maxc);
var seg = new SegmentTree<int>(a, new SegOp());
var ans = new List<int>();
foreach (var que in query)
{
if (que[0] == 1)
{
seg[que[1] - 1] = que[2] - 1;
}
else
{
ans.Add(maxc[seg.Prod(que[1] - 1, que[2])]);
}
}
WriteLine(string.Join("\n", ans));
}
static void MaxC(int cur, int prev, List<int>[] tree, int[] maxc)
{
foreach (var next in tree[cur])
{
if (prev == next) continue;
maxc[next] = Math.Max(maxc[next], maxc[cur]);
MaxC(next, cur, tree, maxc);
}
}
static LCA lca;
struct SegOp : ISegmentTreeOperator<int>
{
public int Identity => -1;
public int Operate(int x, int y)
{
if (x == Identity) return y;
if (y == Identity) return x;
return lca.GetLCA(x, y);
}
}
interface ISegmentTreeOperator<T>
{
T Identity { get; }
T Operate(T x, T y);
}
class SegmentTree<T>
{
int _n;
int size;
int log;
T[] d;
ISegmentTreeOperator<T> op;
void Update(int k)
{
d[k] = op.Operate(d[2 * k], d[2 * k + 1]);
}
public SegmentTree(int n, ISegmentTreeOperator<T> op)
{
this.op = op;
_n = n;
size = 1;
while (size < n) size <<= 1;
log = CountRZero(size);
d = new T[2 * size];
for (var i = 0; i < d.Length; ++i) d[i] = op.Identity;
}
public SegmentTree(T[] v, ISegmentTreeOperator<T> op)
{
this.op = op;
_n = v.Length;
size = 1;
while (size < v.Length) size <<= 1;
log = CountRZero(size);
d = new T[2 * size];
for (var i = 0; i < d.Length; ++i) d[i] = op.Identity;
for (var i = 0; i < v.Length; ++i) d[size + i] = v[i];
for (var i = size - 1; i >= 1; --i) Update(i);
}
int CountRZero(int n)
{
var ans = 0;
while (n % 2 == 0)
{
++ans;
n >>= 1;
}
return ans;
}
public T this[int p]
{
get { return d[p + size]; }
set
{
p += size;
d[p] = value;
for (var i = 1; i <= log; ++i) Update(p >> i);
}
}
public T Prod(int l, int r)
{
var sml = op.Identity;
var smr = op.Identity;
l += size;
r += size;
while (l < r)
{
if ((l & 1) != 0) sml = op.Operate(sml, d[l++]);
if ((r & 1) != 0) smr = op.Operate(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op.Operate(sml, smr);
}
T AllProd() => d[1];
int MinLeft(int r, Predicate<T> f)
{
if (r == 0) return 0;
r += size;
T sm = op.Identity;
do
{
r--;
while (r > 1 && (r % 2) != 0) r >>= 1;
if (!f(op.Operate(d[r], sm)))
{
while (r < size)
{
r = 2 * r + 1;
if (f(op.Operate(d[r], sm)))
{
sm = op.Operate(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op.Operate(d[r], sm);
}
while ((r & -r) != r);
return 0;
}
public int MaxRight(int l, Predicate<T> f)
{
if (l == _n) return _n;
l += size;
T sm = op.Identity;
do
{
while (l % 2 == 0) l >>= 1;
if (!f(op.Operate(sm, d[l])))
{
while (l < size)
{
l = 2 * l;
if (f(op.Operate(sm, d[l])))
{
sm = op.Operate(sm, d[l]);
++l;
}
}
return l - size;
}
sm = op.Operate(sm, d[l]);
++l;
} while ((l & -l) != l);
return _n;
}
}
class LCA
{
int[] depth;
List<int>[] dmap;
public LCA(List<int>[] tree)
{
depth = new int[tree.Length];
var maxDepth = DepthList(-1, 0, 0, tree, depth);
dmap = new List<int>[tree.Length];
for (var i = 0; i < dmap.Length; ++i) dmap[i] = new List<int>();
for (var i = 0; i < dmap.Length; ++i)
{
var nx = -1;
foreach (var next in tree[i])
{
if (depth[next] < depth[i]) nx = next;
}
dmap[i].Add(nx);
}
for (int d = 2, j = 0; d <= maxDepth; d *= 2, ++j) for (var i = 0; i < dmap.Length; ++i)
{
var nx = -1;
if (dmap[i][j] > -1) nx = dmap[dmap[i][j]][j];
dmap[i].Add(nx);
}
}
public int Distance(int x, int y)
{
var (d, lca) = _Distance(x, y);
return d;
}
public int GetLCA(int x, int y)
{
var (d, lca) = _Distance(x, y);
return lca;
}
(int d, int lca) _Distance(int x, int y)
{
var res = 0;
if (depth[x] < depth[y]) { var tmp = x; x = y; y = tmp; }
while (depth[x] > depth[y])
{
for (var b = dmap[x].Count - 1; b >= 0; --b)
{
var move = 1 << b;
if (depth[x] - depth[y] >= move)
{
x = dmap[x][b];
res += move;
}
}
}
for (var b = dmap[x].Count - 1; b >= 0; --b)
{
if (dmap[x][b] != dmap[y][b])
{
x = dmap[x][b];
y = dmap[y][b];
res += 2 << b;
}
}
var lca = x;
if (x != y)
{
res += 2;
lca = dmap[x][0];
}
return (res, lca);
}
int DepthList(int prev, int cur, int d, List<int>[] tree, int[] depth)
{
depth[cur] = d;
var max = d;
foreach (var next in tree[cur])
{
if (next == prev) continue;
max = Math.Max(max, DepthList(cur, next, d + 1, tree, depth));
}
return max;
}
}
}