結果
| 問題 | No.1295 木と駒 |
| ユーザー |
 りあん
|
| 提出日時 | 2020-11-20 23:53:15 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 12,919 bytes |
| コンパイル時間 | 3,232 ms |
| コンパイル使用メモリ | 122,904 KB |
| 実行使用メモリ | 83,040 KB |
| 最終ジャッジ日時 | 2024-07-23 14:02:47 |
| 合計ジャッジ時間 | 21,630 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 33 ms
25,340 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | AC | 36 ms
25,580 KB |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | AC | 35 ms
25,388 KB |
| testcase_10 | AC | 35 ms
25,580 KB |
| testcase_11 | AC | 35 ms
27,516 KB |
| testcase_12 | AC | 34 ms
25,732 KB |
| testcase_13 | AC | 35 ms
27,644 KB |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | AC | 467 ms
76,316 KB |
| testcase_17 | AC | 474 ms
78,432 KB |
| testcase_18 | AC | 462 ms
76,640 KB |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | AC | 405 ms
74,964 KB |
| testcase_24 | AC | 406 ms
81,224 KB |
| testcase_25 | AC | 408 ms
81,104 KB |
| testcase_26 | AC | 328 ms
77,264 KB |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | AC | 439 ms
76,368 KB |
| testcase_34 | AC | 480 ms
76,628 KB |
| testcase_35 | AC | 450 ms
76,368 KB |
| testcase_36 | AC | 434 ms
78,564 KB |
| testcase_37 | AC | 445 ms
74,380 KB |
| testcase_38 | AC | 454 ms
78,468 KB |
| testcase_39 | WA | - |
| testcase_40 | AC | 470 ms
76,444 KB |
| testcase_41 | AC | 445 ms
80,808 KB |
| testcase_42 | AC | 480 ms
82,728 KB |
| testcase_43 | AC | 450 ms
80,736 KB |
| testcase_44 | AC | 460 ms
82,880 KB |
| testcase_45 | AC | 455 ms
80,688 KB |
| testcase_46 | AC | 485 ms
83,040 KB |
| testcase_47 | AC | 481 ms
80,996 KB |
| testcase_48 | AC | 465 ms
82,864 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;
class Program {
static void Main(string[] args) {
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
var solver = new Solver(sw);
// var t = new Thread(solver.solve, 1 << 28); // 256 MB
// t.Start();
// t.Join();
solver.solve();
sw.Flush();
}
}
class Solver {
StreamWriter sw;
Scan sc;
void Prt(string a) => sw.WriteLine(a);
void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
void Prt(params object[] a) => Prt(string.Join(" ", a));
public Solver(StreamWriter sw) {
this.sw = sw;
this.sc = new Scan();
}
public void solve() {
int n = sc.Int;
var edges = new int[n - 1][];
for (int i = 0; i < n - 1; i++)
{
edges[i] = sc.IntArr.Select(x => x - 1).ToArray();
}
var reRooting = new ReRooting<node>(n, edges, node.identity, node.operate, node.operateNode);
for (int i = 0; i < n; i++)
{
// Prt(reRooting.Query(i).status);
Prt(reRooting.Query(i).status == 3 ? "No" : "Yes");
}
}
struct node {
// 0: can return
// 1: cannot return, but minchild
// 2: cannot return
// 3: cannot tour subtree
public int status;
public int maxvalue;
public int minvalue;
public int childminonlymaxv;
public int childminonlyminv;
public int childminexceptminvandmaxv;
public node(int st, int ma, int mi, int cmoma, int cmomi, int cme) {
status = st;
maxvalue = ma;
minvalue = mi;
childminonlymaxv = cmoma;
childminonlyminv = cmomi;
childminexceptminvandmaxv = cme;
}
public static node identity = new node(0, -M, M, M, M, M);
public static node operate(node a, node b) {
if (a.maxvalue > b.maxvalue) {
return operate(b, a);
}
int ma = Math.Max(a.maxvalue, b.maxvalue);
int mi = Math.Min(a.minvalue, b.minvalue);
int cmoma = b.childminonlymaxv;
int cmomi;
int cme = Math.Min(a.childminexceptminvandmaxv, b.childminexceptminvandmaxv);
int st = Math.Max(a.status, b.status);
if (a.minvalue < b.minvalue) {
cmomi = a.childminonlyminv;
if (a.minvalue != a.maxvalue)
cme = Math.Min(cme, a.childminonlymaxv);
if (b.minvalue != b.maxvalue)
cme = Math.Min(cme, b.childminonlyminv);
if (a.status >= 1 && b.status >= 1) {
st = 3;
}
else if (b.status == 1) {
st = Math.Max(st, 2);
}
}
else {
cmomi = b.childminonlyminv;
cme = Math.Min(cme, a.childminonlymaxv);
cme = Math.Min(cme, a.childminonlyminv);
if (a.status >= 1 && b.status >= 1) {
st = 3;
}
else if (a.status == 1) {
st = Math.Max(st, 2);
}
}
return new node(st, ma, mi, cmoma, cmomi, cme);
}
public static node operateNode(node a, int index, int par) {
if (par == -1) par = M;
int st = a.status;
if (index > a.childminexceptminvandmaxv || index > a.childminonlymaxv && a.childminonlymaxv > par) {
st = 3;
}
else if (st < 2 && (index > a.childminonlymaxv || index > a.childminonlyminv)) {
st = 2;
}
return new node(st, index, index, a.minvalue, a.minvalue, M);
}
}
}
class pair<T, U> : IComparable<pair<T, U>> {
public T v1;
public U v2;
public pair() : this(default(T), default(U)) {}
public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
public int CompareTo(pair<T, U> a) {
int c = Comparer<T>.Default.Compare(v1, a.v1);
return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
}
public override string ToString() => v1 + " " + v2;
public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
public static readonly int M = 1000000007;
// public static readonly int M = 998244353;
public static readonly long LM = 1L << 60;
public static readonly double eps = 1e-11;
public static void DBG(string a) => Console.Error.WriteLine(a);
public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
public static void DBG(params object[] a) => DBG(string.Join(" ", a));
public static void Assert(params bool[] conds) {
if (conds.Any(x => !x)) throw new Exception();
}
public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
for (int i = 0; i < a.Count && i < b.Count; i++)
if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
return a.Count.CompareTo(b.Count);
}
public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
public static readonly int[] dd = { 0, 1, 0, -1 };
// static readonly string dstring = "RDLU";
public static IEnumerable<P> adjacents(int i, int j)
=> Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]));
public static IEnumerable<P> adjacents(int i, int j, int h, int w)
=> adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
public static IEnumerable<int> all_subset(this int p) {
for (int i = 0; ; i = i - p & p) {
yield return i;
if (i == p) break;
}
}
public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
=> a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.SelectMany(x => x));
public static T[] inv<T>(this Dictionary<T, int> dic) {
var res = new T[dic.Count];
foreach (var item in dic) res[item.Value] = item.Key;
return res;
}
public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
public static T[] copy<T>(this IList<T> a) {
var ret = new T[a.Count];
for (int i = 0; i < a.Count; i++) ret[i] = a[i];
return ret;
}
}
class Scan {
StreamReader sr;
public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
public Scan(string path) { sr = new StreamReader(path); }
public int Int => int.Parse(Str);
public long Long => long.Parse(Str);
public double Double => double.Parse(Str);
public string Str => ReadLine.Trim();
public string ReadLine => sr.ReadLine();
public pair<T, U> Pair<T, U>() {
T a; U b;
Multi(out a, out b);
return new pair<T, U>(a, b);
}
public P P => Pair<int, int>();
public int[] IntArr => StrArr.Select(int.Parse).ToArray();
public long[] LongArr => StrArr.Select(long.Parse).ToArray();
public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
bool eq<T, U>() => typeof(T).Equals(typeof(U));
T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s))
: eq<T, long>() ? ct<T, long>(long.Parse(s))
: eq<T, double>() ? ct<T, double>(double.Parse(s))
: eq<T, char>() ? ct<T, char>(s[0])
: ct<T, string>(s);
public void Multi<T>(out T a) => a = cv<T>(Str);
public void Multi<T, U>(out T a, out U b) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
}
public void Multi<T, U, V>(out T a, out U b, out V c) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
}
public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
}
public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
}
}
class ReRooting<T>
{
public int NodeCount { get; private set; }
int[][] Adjacents;
int[][] IndexForAdjacent;
T[] Res;
T[][] DP;
T Identity;
Func<T, T, T> Operate;
Func<T, int, int, T> OperateNode;
public ReRooting(int nodeCount, int[][] edges, T identity, Func<T, T, T> operate, Func<T, int, int, T> operateNode)
{
NodeCount = nodeCount;
Identity = identity;
Operate = operate;
OperateNode = operateNode;
List<int>[] adjacents = new List<int>[nodeCount];
List<int>[] indexForAdjacents = new List<int>[nodeCount];
for (int i = 0; i < nodeCount; i++)
{
adjacents[i] = new List<int>();
indexForAdjacents[i] = new List<int>();
}
for (int i = 0; i < edges.Length; i++)
{
var edge = edges[i];
indexForAdjacents[edge[0]].Add(adjacents[edge[1]].Count);
indexForAdjacents[edge[1]].Add(adjacents[edge[0]].Count);
adjacents[edge[0]].Add(edge[1]);
adjacents[edge[1]].Add(edge[0]);
}
Adjacents = new int[nodeCount][];
IndexForAdjacent = new int[nodeCount][];
for (int i = 0; i < nodeCount; i++)
{
Adjacents[i] = adjacents[i].ToArray();
IndexForAdjacent[i] = indexForAdjacents[i].ToArray();
}
DP = new T[Adjacents.Length][];
Res = new T[Adjacents.Length];
for (int i = 0; i < Adjacents.Length; i++) DP[i] = new T[Adjacents[i].Length];
if (NodeCount > 1) Initialize();
else if (NodeCount == 1) Res[0] = OperateNode(Identity, 0, -1);
}
public T Query(int node) => Res[node];
private void Initialize()
{
int[] parents = new int[NodeCount];
int[] order = new int[NodeCount];
#region InitOrderedTree
var index = 0;
Stack<int> stack = new Stack<int>();
stack.Push(0);
parents[0] = -1;
while (stack.Count > 0)
{
var node = stack.Pop();
order[index++] = node;
for (int i = 0; i < Adjacents[node].Length; i++)
{
var adjacent = Adjacents[node][i];
if (adjacent == parents[node]) continue;
stack.Push(adjacent);
parents[adjacent] = node;
}
}
#endregion
#region fromLeaf
for (int i = order.Length - 1; i >= 1; i--)
{
var node = order[i];
var parent = parents[node];
T accum = Identity;
int parentIndex = -1;
for (int j = 0; j < Adjacents[node].Length; j++)
{
if (Adjacents[node][j] == parent)
{
parentIndex = j;
continue;
}
accum = Operate(accum, DP[node][j]);
}
DP[parent][IndexForAdjacent[node][parentIndex]] = OperateNode(accum, node, parent);
}
#endregion
#region toLeaf
for (int i = 0; i < order.Length; i++)
{
var node = order[i];
T accum = Identity;
T[] accumsFromTail = new T[Adjacents[node].Length];
accumsFromTail[accumsFromTail.Length - 1] = Identity;
for (int j = accumsFromTail.Length - 1; j >= 1; j--) accumsFromTail[j - 1] = Operate(DP[node][j], accumsFromTail[j]);
for (int j = 0; j < accumsFromTail.Length; j++)
{
DP[Adjacents[node][j]][IndexForAdjacent[node][j]] = OperateNode(Operate(accum, accumsFromTail[j]), node, Adjacents[node][j]);
accum = Operate(accum, DP[node][j]);
}
Res[node] = OperateNode(accum, node, -1);
}
#endregion
}
}