結果

問題 No.3094 Stapler
ユーザー KumaTachiRen
提出日時 2025-04-06 15:59:29
言語 C#
(.NET 8.0.404)
結果
AC  
実行時間 259 ms / 2,000 ms
コード長 9,345 bytes
コンパイル時間 13,990 ms
コンパイル使用メモリ 171,076 KB
実行使用メモリ 188,504 KB
最終ジャッジ日時 2025-06-20 02:30:19
合計ジャッジ時間 27,032 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 72
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (114 ミリ秒)。
  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.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 data = new S[n - 1];
        for (int i = 0; i < n - 1; i++) data[i] = new S(0, 1);
        var seg = new LazySegTree<S, int, Op>(data);

        int q = ri;
        var qs = new (int l, int r)[q];
        for (int qi = 0; qi < q; qi++)
        {
            int t = ri;
            if (t == 1)
            {
                int l = ri - 1, r = ri - 1;
                qs[qi] = (l, r);
                seg.Apply(l, r, 1);
            }
            if (t == 2)
            {
                var (l, r) = qs[ri - 1];
                seg.Apply(l, r, -1);
            }
            if (t == 3)
            {
                var r = seg.AllProd();
                int ans = 1;
                if (r.min == 0) ans += r.cnt;
                Write(ans);
            }
        }
    }

    struct S
    {
        public int min, cnt;
        public S(int m, int c) { min = m; cnt = c; }
    }
    struct Op : ILazySegTreeOperator<S, int>
    {
        public S Identity => new S(1000000, 0);
        public S Operate(S x, S y)
        {
            if (x.min == y.min) return new S(x.min, x.cnt + y.cnt);
            return x.min < y.min ? x : y;
        }
        public int FIdentity => 0;
        public S Mapping(int f, S x) => new S(x.min + f, x.cnt);
        public int Composition(int f, int g) => f + g;
    }

#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 interface ILazySegTreeOperator<T,F>{T Identity{get;}F FIdentity{get;}T Operate(T x,T y);T Mapping(F f,T x);F Composition(F f,F g);}
public class LazySegTree<T,F,Op>where Op:struct,ILazySegTreeOperator<T,F>{protected static readonly Op op=default;public int Length{get;}protected readonly int size,log;protected readonly T[]d;protected readonly F[]lz;public LazySegTree(int n){Length=n;log=0;while((1<<log)<Length)log++;size=1<<log;d=new T[2*size];lz=new F[size];Array.Fill(d,op.Identity);Array.Fill(lz,op.FIdentity);}public LazySegTree(T[]v):this(v.Length){for(int i=0;i<v.Length;i++)d[size+i]=v[i];for(int i=size-1;i>=1;i--)Update(i);}[MethodImpl(256)]public void Clear(){Array.Fill(d,op.Identity);Array.Fill(lz,op.FIdentity);}[MethodImpl(256)]public void Set(int p,T x){p+=size;for(int i=log;i>=1;i--)Push(p>>i);d[p]=x;for(int i=1;i<=log;i++)Update(p>>i);}[MethodImpl(256)]public T Get(int p){p+=size;for(int i=log;i>=1;i--)Push(p>>i);return d[p];}[MethodImpl(256)]public T Prod(int l,int r){if(l==r)return op.Identity;l+=size;r+=size;for(int i=log;i>=1;i--){if(((l>>i)<<i)!=l)Push(l>>i);if(((r>>i)<<i)!=r)Push((r-1)>>i);}T sml=op.Identity,smr=op.Identity;while(l<r){if((l&1)!=0)sml=op.Operate(sml,d[l++]);if((r&1)!=0)smr=op.Operate(d[ --r],smr);l>>=1;r>>=1;}return op.Operate(sml,smr);}public T AllProd()=>d[1];[MethodImpl(256)]public void Apply(int p,F f){p+=size;for(int i=log;i>=1;i--)Push(p>>i);d[p]=op.Mapping(f,d[p]);for(int i=1;i<=log;i++)Update(p>>i);}[MethodImpl(256)]public void Apply(int l,int r,F f){if(l>=r)return;l+=size;r+=size;for(int i=log;i>=1;i--){if(((l>>i)<<i)!=l)Push(l>>i);if(((r>>i)<<i)!=r)Push((r-1)>>i);}{int l2=l,r2=r;while(l<r){if((l&1)!=0)AllApply(l++,f);if((r&1)!=0)AllApply( --r,f);l>>=1;r>>=1;}l=l2;r=r2;}for(int i=1;i<=log;i++){if(((l>>i)<<i)!=l)Update(l>>i);if(((r>>i)<<i)!=r)Update((r-1)>>i);}}[MethodImpl(256)]protected void Update(int k)=>d[k]=op.Operate(d[2*k],d[2*k+1]);[MethodImpl(256)]protected virtual void AllApply(int k,F f){d[k]=op.Mapping(f,d[k]);if(k<size)lz[k]=op.Composition(f,lz[k]);}[MethodImpl(256)]protected void Push(int k){AllApply(2*k,lz[k]);AllApply(2*k+1,lz[k]);lz[k]=op.FIdentity;}[MethodImpl(256)]public int MaxRight(int l,Predicate<T>f){if(l==Length)return Length;l+=size;for(int i=log;i>=1;i--)Push(l>>i);var s=op.Identity;do{while(l%2==0)l>>=1;if(!f(op.Operate(s,d[l]))){while(l<size){Push(l);l<<=1;if(f(op.Operate(s,d[l]))){s=op.Operate(s,d[l]);l++;}}return l-size;}s=op.Operate(s,d[l]);l++;}while((l&-l)!=l);return Length;}[MethodImpl(256)]public int MinLeft(int r,Predicate<T>f){if(r==0)return 0;r+=size;for(int i=log;i>=1;i--)Push((r-1)>>i);var s=op.Identity;do{r--;while(r>1&&(r%2)!=0)r>>=1;if(!f(op.Operate(d[r],s))){while(r<size){Push(r);r=(r<<1)|1;if(f(op.Operate(d[r],s))){s=op.Operate(d[r],s);r--;}}return r+1-size;}s=op.Operate(d[r],s);}while((r&-r)!=r);return 0;}}
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