結果

問題 No.3058 Deque and Brackets
ユーザー KumaTachiRen
提出日時 2025-03-14 22:28:34
言語 C#
(.NET 8.0.404)
結果
AC  
実行時間 183 ms / 2,000 ms
コード長 8,512 bytes
コンパイル時間 9,994 ms
コンパイル使用メモリ 170,380 KB
実行使用メモリ 222,004 KB
最終ジャッジ日時 2025-03-14 22:29:00
合計ジャッジ時間 15,319 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (150 ミリ秒)。
  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;
        ReadArray(out (char c, long l, long r)[] qs, n * 2, () => (rs[0], ri, ri));

        Array.Reverse(qs);
        // c=(, l<r のとき
        // 一旦後ろにつけて足りなくなったら前へ
        // l-r(<0) 増える

        // c=), l>r のとき
        // 前つけられるなら一旦前

        long ans = 0;
        int s = 0, t = 0;
        var pq = new MyPriorityQueue<long, long>(x => -x);
        foreach (var (c, l, r) in qs)
        {
            if (c == '(')
            {
                if (l < r)
                {
                    t--;
                    ans += r;
                    pq.Enqueue(l - r);
                    while (t < 0)
                    {
                        ans += pq.Dequeue();
                        s++; t++;
                    }
                }
                else
                {
                    ans += l;
                    s++;
                }
            }
            else
            {
                if (l > r)
                {
                    s--;
                    ans += l;
                    pq.Enqueue(r - l);
                    while (s < 0)
                    {
                        ans += pq.Dequeue();
                        s++; t++;
                    }
                }
                else
                {
                    ans += r;
                    t++;
                }
            }
        }
        Write(ans);
    }

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

    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 KeyValuePair<TKey,TValue>[]_data;private readonly Func<TValue,TKey>_keySelector;private readonly IComparer<TKey>_keyComparer;public MyPriorityQueue(Func<TValue,TKey>keySelector,int initial_capacity=1):this(keySelector,Comparer<TKey>.Default,initial_capacity){}public MyPriorityQueue(Func<TValue,TKey>keySelector,IComparer<TKey>keyComparer,int initial_capacity=1){_keySelector=keySelector;_keyComparer=keyComparer;_data=new KeyValuePair<TKey,TValue>[initial_capacity];}[MethodImpl(256)]public void Clear(){Count=0;}[MethodImpl(256)]public void Enqueue(TValue item){if(Count==_data.Length)Array.Resize(ref _data,_data.Length*2+1);_data[Count]=new KeyValuePair<TKey,TValue>(_keySelector(item),item);var childIndex=Count++;while(childIndex>0){var parentIndex=(childIndex-1)/2;if(_keyComparer.Compare(_data[childIndex].Key,_data[parentIndex].Key)>=0)break;Swap(childIndex,parentIndex);childIndex=parentIndex;}}[MethodImpl(256)]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&&_keyComparer.Compare(_data[rightChild].Key,_data[childIndex].Key)<0)childIndex=rightChild;if(_keyComparer.Compare(_data[parentIndex].Key,_data[childIndex].Key)<=0)break;Swap(parentIndex,childIndex);parentIndex=childIndex;}return firstItem.Value;}[MethodImpl(256)]public TValue Peek()=>_data[0].Value;[MethodImpl(256)]private void Swap(int a,int b){var tmp=_data[a];_data[a]=_data[b];_data[b]=tmp;}[MethodImpl(256)]public IEnumerator<TValue>GetEnumerator()=>_data.Select(r=>r.Value).GetEnumerator();[MethodImpl(256)]IEnumerator IEnumerable.GetEnumerator()=>GetEnumerator();}
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;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;var ng=false;byte b;do b=Read();while(b!='-'&&(b<'0'||'9'<b));if(b=='-'){ng=true;b=Read();}for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(b^'0');return ng?-ret:ret;}[MethodImpl(256)]public ulong UInteger(){ulong ret=0;byte b;do b=Read();while(b<'0'||'9'<b);for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(ulong)(b^'0');return ret;}[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=" "){foreach(var ar in a)WriteJoin(sep,ar);}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,Func<T,string>map,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar.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