結果
| 問題 |
No.1637 Easy Tree Query
|
| コンテスト | |
| ユーザー |
 yupiteru_kun
|
| 提出日時 | 2021-08-06 21:23:24 |
| 言語 | C# (.NET 8.0.404) |
| 結果 |
AC
|
| 実行時間 | 189 ms / 2,000 ms |
| コード長 | 11,966 bytes |
| コンパイル時間 | 12,280 ms |
| コンパイル使用メモリ | 167,740 KB |
| 実行使用メモリ | 211,504 KB |
| 最終ジャッジ日時 | 2024-09-17 03:21:02 |
| 合計ジャッジ時間 | 14,709 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 33 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (103 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 ProblemB
{
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 ab = Repeat(0, N-1).Select(_ => new { a=NN-1,b=NN-1 } ).ToArray();
var px = Repeat(0, Q).Select(_ => new { p=NN-1,x=NN } ).ToArray();
var dp = new long[N];
dp.Fill(1);
var tree = new LIB_Tree(N);
foreach (var item in ab) {
tree.AddPath(item.a, item.b);
}
foreach (var item in tree.BFSFromLeaf(0)) {
if(item.parent == -1) continue;
dp[item.parent] += dp[item.node];
}
var ans = 0L;
foreach (var item in px) {
ans += dp[item.p] * item.x;
Console.WriteLine(ans);
}
}
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 {
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());
}
}