結果

問題 No.2822 Lights Up! (Tree Edition)
ユーザー KumaTachiRen
提出日時 2024-07-26 21:42:54
言語 C#
(.NET 8.0.404)
結果
TLE  
実行時間 -
コード長 8,760 bytes
コンパイル時間 19,527 ms
コンパイル使用メモリ 169,032 KB
実行使用メモリ 37,152 KB
最終ジャッジ日時 2024-07-26 21:43:22
合計ジャッジ時間 26,440 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 11 TLE * 1 -- * 130
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (162 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/

ソースコード

diff # 

using Lib;
using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using static Lib.OutputLib;
public class Solver
{
    const bool MultiTestCase = false;
    void Solve()
    {
        int n = ri;
        var p = new int[n];
        p[0] = -1;
        for (int i = 1; i < n; i++) p[i] = ri - 1;
        var s = rs;
        var black = new bool[n];
        for (int i = 1; i < n; i++) black[i] |= s[i - 1] == '#';

        int k = ri;
        var qs = new (int u, int v)[k];
        for (int i = 0; i < k; i++) qs[i] = (ri - 1, ri - 1);
        var pq = new MyPriorityQueue<long, (int u, int v)>(p => (long)p.v * IINF + p.u);
        foreach (var pair in qs) pq.Enqueue(pair);

        bool ans = true;
        var lz = new bool[n];
        for (int x = n - 1; x > 0; x--)
        {
            black[x] ^= lz[x];
            lz[p[x]] ^= lz[x];
            if (black[x] && (pq.Count == 0 || pq.Peek().v != x))
            {
                ans = false;
                break;
            }
            if (pq.Count > 0 && pq.Peek().v == x)
            {
                var (u, v) = pq.Dequeue();
                if (black[v])
                {
                    lz[u] ^= true;
                    lz[p[x]] ^= true;
                    black[v] = false;
                }
                int prv_u = u;
                while (pq.Count > 0 && pq.Peek().v == v)
                {
                    var (nu, nv) = pq.Dequeue();
                    if (nu == prv_u) continue;
                    prv_u = nu;
                    pq.Enqueue((Math.Min(nu, u), Math.Max(nu, u)));
                }
            }
        }
        Yn(ans);
    }

#pragma warning disable CS0162
    public Solver() { if (!MultiTestCase) Solve(); else for (int t = ri; t > 0; t--) Solve(); }
#pragma warning restore CS0162

    const int IINF = 1 << 30;
    const long INF = 1L << 60;
    int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
    long rl { [MethodImpl(256)] get => sc.Integer(); }
    uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); }
    ulong rul { [MethodImpl(256)] get => sc.UInteger(); }
    double rd { [MethodImpl(256)] get => sc.Double(); }
    string rs { [MethodImpl(256)] get => sc.Scan(); }
    string rline { [MethodImpl(256)] get => sc.Line(); }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
    void ReadArray(out int[] a, int n) { a = new int[n]; for (int i = 0; i < a.Length; i++) a[i] = ri; }
    void ReadArray(out long[] a, int n) { a = new long[n]; for (int i = 0; i < a.Length; i++) a[i] = rl; }
    void ReadArray<T>(out T[] a, int n, Func<T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(); }
    void ReadArray<T>(out T[] a, int n, Func<int, T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(i); }
}

static class Program
{
    static public void Main(string[] args)
    {
        SourceExpander.Expander.Expand();
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}
#region Expanded by https://github.com/kzrnm/SourceExpander
public class MyPriorityQueue<TKey,TValue>:IEnumerable<TValue>{public int Count{get;private set;}=0;private readonly List<KeyValuePair<TKey,TValue>>_data;private readonly Func<TValue,TKey>_keySelector;private readonly IComparer<TKey>_keyComparer;public MyPriorityQueue(Func<TValue,TKey>keySelector):this(keySelector,Comparer<TKey>.Default){}public MyPriorityQueue(Func<TValue,TKey>keySelector,IComparer<TKey>keyComparer){_keySelector=keySelector;_keyComparer=keyComparer;_data=new List<KeyValuePair<TKey,TValue>>();}public void Clear(){Count=0;_data.Clear();}public void Enqueue(TValue item){if(Count==_data.Count)_data.Add(new KeyValuePair<TKey,TValue>(_keySelector(item),item));else _data[Count]=new KeyValuePair<TKey,TValue>(_keySelector(item),item);var childIndex=Count++;while(childIndex>0){var parentIndex=(childIndex-1)/2;if(Compare(_data[childIndex].Key,_data[parentIndex].Key)>=0)break;Swap(childIndex,parentIndex);childIndex=parentIndex;}}public TValue Dequeue(){var lastIndex= --Count;var firstItem=_data[0];_data[0]=_data[lastIndex];lastIndex--;var parentIndex=0;while(true){var childIndex=parentIndex*2+1;if(childIndex>lastIndex)break;var rightChild=childIndex+1;if(rightChild<=lastIndex&&Compare(_data[rightChild].Key,_data[childIndex].Key)<0)childIndex=rightChild;if(Compare(_data[parentIndex].Key,_data[childIndex].Key)<=0)break;Swap(parentIndex,childIndex);parentIndex=childIndex;}return firstItem.Value;}public TValue Peek()=>_data[0].Value;private void Swap(int a,int b){var tmp=_data[a];_data[a]=_data[b];_data[b]=tmp;}private int Compare(TKey a,TKey b)=>_keyComparer.Compare(b,a);public IEnumerator<TValue>GetEnumerator()=>_data.Select(r=>r.Value).GetEnumerator();IEnumerator IEnumerable.GetEnumerator()=>GetEnumerator();}
namespace Lib{public partial class StreamScanner{public int[][]ReadUnweightedTree(int n,int origin=1){var gr=new List<int>[n];for(int i=0;i<n;i++)gr[i]=new List<int>();for(int i=0;i<n-1;i++){int u=(int)(Integer()-origin);int v=(int)(Integer()-origin);gr[u].Add(v);gr[v].Add(u);}var g=new int[n][];for(int i=0;i<n;i++)g[i]=gr[i].ToArray();return g;}}}
namespace Lib{public partial class StreamScanner{public StreamScanner(Stream stream){str=stream;}private readonly Stream str;private readonly byte[]buf=new byte[1024];private int len,ptr;public bool isEof=false;public bool IsEndOfStream{get{return isEof;}}[MethodImpl(256)]private byte Read(){if(isEof)throw new EndOfStreamException();if(ptr>=len){ptr=0;if((len=str.Read(buf,0,1024))<=0){isEof=true;return 0;}}return buf[ptr++];}[MethodImpl(256)]public char Char(){byte b=0;do b=Read();while(b<33||126<b);return(char)b;}[MethodImpl(256)]public string Line(){var sb=new StringBuilder();for(var b=Char();b!=10&&!isEof;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]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(256)]public long Integer(){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*10+b-'0';}}[MethodImpl(256)]public ulong UInteger(){ulong ret=0;byte b=0;do b=Read();while(b<'0'||'9'<b);for(;true;b=Read()){if(b<'0'||'9'<b)return ret;else ret=ret*10+b-'0';}}[MethodImpl(256)]public double Double()=>double.Parse(Scan());}}
namespace Lib{public static class OutputLib{[MethodImpl(256)]public static void WriteJoin<T>(string s,IEnumerable<T>t)=>Console.WriteLine(string.Join(s,t));[MethodImpl(256)]public static void WriteMat<T>(T[,]a,string sep=" "){int sz1=a.GetLength(0),sz2=a.GetLength(1);var b=new T[sz2];for(int i=0;i<sz1;i++){for(int j=0;j<sz2;j++)b[j]=a[i,j];WriteJoin(sep,b);}}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,string sep=" "){for(int i=0;i<a.Length;i++)WriteJoin(sep,a[i]);}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,Func<T,string>map,string sep=" "){for(int i=0;i<a.Length;i++)WriteJoin(sep,a[i].Select(x=>map(x)));}[MethodImpl(256)]public static void Write(object t)=>Console.WriteLine(t.ToString());[MethodImpl(256)]public static void Write(params object[]arg)=>Console.WriteLine(string.Join(" ",arg.Select(x=>x.ToString())));[MethodImpl(256)]public static void Write(string str)=>Console.WriteLine(str);[MethodImpl(256)]public static void WriteFlush(object t){Console.WriteLine(t.ToString());Console.Out.Flush();}[MethodImpl(256)]public static void WriteError(object t)=>Console.Error.WriteLine(t.ToString());[MethodImpl(256)]public static void Flush()=>Console.Out.Flush();[MethodImpl(256)]public static void YN(bool t)=>Console.WriteLine(t?"YES":"NO");[MethodImpl(256)]public static void Yn(bool t)=>Console.WriteLine(t?"Yes":"No");[MethodImpl(256)]public static void yn(bool t)=>Console.WriteLine(t?"yes":"no");[MethodImpl(256)]public static void DeleteLine()=>Console.Write("\x1b[1A\x1b[2K");[MethodImpl(256)]public static void ProgressBar(long now,long total,int blocks=50){int x=(int)((2*now*blocks+1)/(2*total));Console.Write($"\x1b[G[\x1b[42m{string.Concat(Enumerable.Repeat("_",x))}\x1b[0m{string.Concat(Enumerable.Repeat("_",blocks-x))}] : {now} / {total}");}}}
namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}}
#endregion Expanded by https://github.com/kzrnm/SourceExpander
0