結果
| 問題 | No.1641 Tree Xor Query |
| ユーザー |
 yupiteru_kun
|
| 提出日時 | 2021-08-06 22:08:19 |
| 言語 | C# (.NET 8.0.203) |
| 結果 |
AC
|
| 実行時間 | 170 ms / 5,000 ms |
| コード長 | 16,531 bytes |
| コンパイル時間 | 7,158 ms |
| コンパイル使用メモリ | 170,720 KB |
| 実行使用メモリ | 224,448 KB |
| 最終ジャッジ日時 | 2024-09-17 02:07:56 |
| 合計ジャッジ時間 | 9,667 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 48 ms
27,776 KB |
| testcase_01 | AC | 48 ms
27,904 KB |
| testcase_02 | AC | 48 ms
28,016 KB |
| testcase_03 | AC | 49 ms
27,776 KB |
| testcase_04 | AC | 49 ms
28,160 KB |
| testcase_05 | AC | 47 ms
28,280 KB |
| testcase_06 | AC | 50 ms
27,776 KB |
| testcase_07 | AC | 50 ms
28,020 KB |
| testcase_08 | AC | 50 ms
28,016 KB |
| testcase_09 | AC | 48 ms
27,904 KB |
| testcase_10 | AC | 48 ms
28,268 KB |
| testcase_11 | AC | 47 ms
27,904 KB |
| testcase_12 | AC | 48 ms
27,904 KB |
| testcase_13 | AC | 168 ms
64,252 KB |
| testcase_14 | AC | 170 ms
64,644 KB |
| testcase_15 | AC | 55 ms
29,436 KB |
| testcase_16 | AC | 62 ms
31,360 KB |
| testcase_17 | AC | 58 ms
30,208 KB |
| testcase_18 | AC | 59 ms
30,720 KB |
| testcase_19 | AC | 52 ms
28,416 KB |
| testcase_20 | AC | 151 ms
224,448 KB |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (85 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using Library;
namespace Program
{
public static class ProblemF
{
static bool SAIKI = false;
static public int numberOfRandomCases = 0;
static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker)
{
}
static public void Solve()
{
var N = NN;
var Q = NN;
var CList = NNList(N);
var ab = Repeat(0, N - 1).Select(_ => new { a = NN - 1, b = NN - 1 }).ToArray();
var Txy = Repeat(0, Q).Select(_ => new { T = NN, x = NN - 1, y = NN }).ToArray();
var tree = new LIB_Tree(N);
foreach (var item in ab)
{
tree.AddPath(item.a, item.b);
}
var oira = tree.EulerTour(0);
var seg = new LIB_SegTree<long>(oira.Length, 0, (x, y) => x ^ y);
var start = new long[N];
var end = new long[N];
for (var i = 0; i < oira.Length; ++i)
{
if (oira[i].direction == 1) start[oira[i].node] = i;
else end[oira[i].node] = i;
}
for (var i = 0; i < N; ++i)
{
seg[start[i]] = CList[i];
}
foreach (var item in Txy)
{
if (item.T == 1)
{
seg[start[item.x]] ^= item.y;
}
else
{
Console.WriteLine(seg.Query(start[item.x], end[item.x]));
}
}
}
class Printer : StreamWriter
{
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }
public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }
}
static LIB_FastIO fastio = new LIB_FastIODebug();
static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }
static long NN => fastio.Long();
static double ND => fastio.Double();
static string NS => fastio.Scan();
static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();
static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();
static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();
static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);
static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);
static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);
static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);
static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);
static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);
static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);
static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);
static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);
static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }
static IEnumerator<uint> _xsi = _xsc();
static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }
static bool Chmax<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) < 0) { lhs = rhs; return true; } return false; }
static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } return false; }
static void Fill<T>(this T[] array, T value) => array.AsSpan().Fill(value);
static void Fill<T>(this T[,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0], array.Length).Fill(value);
static void Fill<T>(this T[,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0], array.Length).Fill(value);
static void Fill<T>(this T[,,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0, 0], array.Length).Fill(value);
}
}
namespace Library {
class LIB_SegTree<T>
{
int n, sz;
T ti;
Func<T, T, T> f;
T[] dat;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_SegTree(long _n, T _ti, Func<T, T, T> _f)
{
n = 1; sz = (int)_n;
while (n < _n) n <<= 1;
ti = _ti;
f = _f;
dat = Enumerable.Repeat(ti, n << 1).ToArray();
for (var i = n - 1; i > 0; i--) dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_SegTree(IEnumerable<T> l, T _ti, Func<T, T, T> _f) : this(l.Count(), _ti, _f)
{
var idx = 0;
foreach (var item in l) dat[n + idx++] = item;
for (var i = n - 1; i > 0; i--) dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void Update(long i, T v)
{
ref T datref = ref dat[0];
Unsafe.Add(ref datref, (int)(i += n)) = v;
while ((i >>= 1) > 0) Unsafe.Add(ref datref, (int)i) = f(Unsafe.Add(ref datref, (int)i << 1), Unsafe.Add(ref datref, (int)(i << 1) | 1));
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public T Query(long l, long r)
{
if (l == r) return ti;
var vl = ti;
var vr = ti;
ref T datref = ref dat[0];
for (long li = n + l, ri = n + r; li < ri; li >>= 1, ri >>= 1)
{
if ((li & 1) == 1) vl = f(vl, Unsafe.Add(ref datref, (int)(li++)));
if ((ri & 1) == 1) vr = f(Unsafe.Add(ref datref, (int)(--ri)), vr);
}
return f(vl, vr);
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public long FindToRight(long st, Func<T, bool> check)
{
if (st == sz) return sz;
st += n;
ref T datref = ref dat[0];
datref = ti;
do
{
while ((st & 1) == 0) st >>= 1;
var ch = f(datref, Unsafe.Add(ref datref, (int)st));
if (check(ch))
{
while (st < n)
{
ch = f(datref, Unsafe.Add(ref datref, (int)(st <<= 1)));
if (!check(ch))
{
datref = ch;
++st;
}
}
return Min(st - n, sz);
}
datref = ch;
++st;
} while ((st & -st) != st);
return sz;
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public long FindToLeft(long st, Func<T, bool> check)
{
if (st < 0) return -1;
++st;
st += n;
ref T datref = ref dat[0];
datref = ti;
do
{
--st;
while (st > 1 && (st & 1) == 1) st >>= 1;
var ch = f(Unsafe.Add(ref datref, (int)st), datref);
if (check(ch))
{
while (st < n)
{
ch = f(Unsafe.Add(ref datref, (int)(st = (st << 1) | 1)), datref);
if (!check(ch))
{
datref = ch;
--st;
}
}
return st - n;
}
datref = ch;
} while ((st & -st) != st);
return -1;
}
public T this[long idx]
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
get { return dat[idx + n]; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
set { Update(idx, value); }
}
}
partial class LIB_Tree
{
int N;
List<int>[] path;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_Tree(long n)
{
N = (int)n;
path = Enumerable.Repeat(0, N).Select(_ => new List<int>()).ToArray();
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void AddPath(long u, long v)
{
if (u >= N || v >= N) throw new Exception();
path[u].Add((int)v);
path[v].Add((int)u);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public int[] GetSurround(long u) => path[u].ToArray();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public List<(long node, long parent)> BFSFromRoot(long root)
{
var bfsList = new List<(long node, long parent)>();
var q = new Queue<int>();
var done = new bool[N];
bfsList.Add((root, -1));
done[root] = true;
q.Enqueue((int)root);
while (q.Count > 0)
{
var w = q.Dequeue();
foreach (var i in path[w])
{
if (done[i]) continue;
done[i] = true;
q.Enqueue(i);
bfsList.Add((i, w));
}
}
return bfsList;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public long[] GetDistanceFrom(long root)
{
var ret = new long[N];
foreach (var item in BFSFromRoot(root))
{
if (item.parent == -1) continue;
ret[item.node] = ret[item.parent] + 1;
}
return ret;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public long GetTyokkei()
{
var dist1 = GetDistanceFrom(0);
var maxPos = 0;
var maxDist = 0L;
for (var i = 0; i < N; i++)
{
if (maxDist < dist1[i])
{
maxDist = dist1[i];
maxPos = i;
}
}
return GetDistanceFrom(maxPos).Max();
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public List<(long node, long parent)> BFSFromLeaf(long root) => BFSFromRoot(root).ToArray().Reverse().ToList();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public (long node, long parent, long direction)[] EulerTour(long root)
{
var eulerList = new (long node, long parent, long direction)[N << 1];
ref var eulerListRef = ref eulerList[0];
var stack = new int[N << 1];
ref var stackref = ref stack[0];
var si = 0;
Unsafe.Add(ref stackref, si++) = (int)root + 1;
var idx = 0;
var par = new int[N];
ref var parref = ref par[0];
Unsafe.Add(ref parref, (int)root) = -1;
while (si > 0)
{
var vtx = Unsafe.Add(ref stackref, --si);
if (vtx < 0)
{
vtx *= -1;
--vtx;
Unsafe.Add(ref eulerListRef, idx) = (vtx, Unsafe.Add(ref parref, vtx), -1);
}
else
{
Unsafe.Add(ref stackref, si++) = -vtx;
--vtx;
var pare = Unsafe.Add(ref parref, vtx);
Unsafe.Add(ref eulerListRef, idx) = (vtx, pare, 1);
foreach (var item in path[vtx])
{
if (item + 1 == pare) continue;
Unsafe.Add(ref parref, item) = vtx + 1;
Unsafe.Add(ref stackref, si++) = item + 1;
}
}
++idx;
}
return eulerList;
}
}
class LIB_FastIO
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_FastIO() { str = Console.OpenStandardInput(); }
readonly Stream str;
readonly byte[] buf = new byte[2048];
int len, ptr;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
byte read()
{
if (ptr >= len)
{
ptr = 0;
if ((len = str.Read(buf, 0, 2048)) <= 0)
{
return 0;
}
}
return buf[ptr++];
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
char Char()
{
byte b = 0;
do b = read();
while (b < 33 || 126 < b);
return (char)b;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public long Long()
{
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != '-' && (b < '0' || '9' < b));
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = (ret << 3) + (ret << 1) + b - '0';
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
}
class LIB_FastIODebug : LIB_FastIO
{
Queue<string> param = new Queue<string>();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_FastIODebug() { }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override string Scan() => NextString();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override long Long() => long.Parse(NextString());
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override double Double() => double.Parse(NextString());
}
}