結果
問題 | No.1982 [Cherry 4th Tune B] 絶険 |
ユーザー | fgwiebfaoish |
提出日時 | 2022-06-18 19:07:22 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,803 ms / 3,000 ms |
コード長 | 9,622 bytes |
コンパイル時間 | 1,576 ms |
コンパイル使用メモリ | 117,492 KB |
実行使用メモリ | 91,388 KB |
最終ジャッジ日時 | 2024-06-10 08:11:01 |
合計ジャッジ時間 | 35,591 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 24 ms
18,304 KB |
testcase_01 | AC | 22 ms
18,176 KB |
testcase_02 | AC | 24 ms
18,212 KB |
testcase_03 | AC | 644 ms
57,860 KB |
testcase_04 | AC | 779 ms
58,400 KB |
testcase_05 | AC | 532 ms
48,676 KB |
testcase_06 | AC | 929 ms
73,288 KB |
testcase_07 | AC | 1,077 ms
81,752 KB |
testcase_08 | AC | 797 ms
58,280 KB |
testcase_09 | AC | 972 ms
71,688 KB |
testcase_10 | AC | 888 ms
75,764 KB |
testcase_11 | AC | 496 ms
44,264 KB |
testcase_12 | AC | 979 ms
66,816 KB |
testcase_13 | AC | 569 ms
46,908 KB |
testcase_14 | AC | 629 ms
40,948 KB |
testcase_15 | AC | 587 ms
47,876 KB |
testcase_16 | AC | 739 ms
56,936 KB |
testcase_17 | AC | 1,493 ms
85,588 KB |
testcase_18 | AC | 1,311 ms
81,352 KB |
testcase_19 | AC | 1,454 ms
86,316 KB |
testcase_20 | AC | 265 ms
54,528 KB |
testcase_21 | AC | 388 ms
54,380 KB |
testcase_22 | AC | 694 ms
51,264 KB |
testcase_23 | AC | 353 ms
56,960 KB |
testcase_24 | AC | 488 ms
42,876 KB |
testcase_25 | AC | 1,341 ms
73,664 KB |
testcase_26 | AC | 1,392 ms
79,352 KB |
testcase_27 | AC | 234 ms
34,684 KB |
testcase_28 | AC | 271 ms
29,952 KB |
testcase_29 | AC | 1,557 ms
78,060 KB |
testcase_30 | AC | 917 ms
68,880 KB |
testcase_31 | AC | 288 ms
31,232 KB |
testcase_32 | AC | 1,803 ms
91,388 KB |
testcase_33 | AC | 1,348 ms
83,816 KB |
testcase_34 | AC | 1,055 ms
69,000 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.Collections; using System.Collections.Specialized; using System.Linq; using System.Text; using System.Text.RegularExpressions; using System.IO; using System.Reflection; using static System.Math; using System.Numerics; using System.Threading; using System.Runtime.CompilerServices; using System.Diagnostics; using nint=System.Int64; static class Program{ const long inf=long.MaxValue>>1; const int mod=998244353; static Sc sc=new Sc(); static void Main(){ Pt pt=new Pt(Solve); pt.Sm(); } static void Solve(Pt pt) { var (n,k,q)=sc.Tp3<int>(); var a=new (int l,int r,int c,int h)[k]; for(int i=0;i<k;i++){a[i]=sc.Tp4<int>();} var qa=new (int i,long x)[q]; for(int i = 0;i<q;i++) {qa[i]=sc.Tp2<int,long>();} Bit2 bit=null; var pbs=new Pbs<(int l,int r,int c,int h),(int i,long x)>(a,()=>bit=new Bit2(n+1),e=>{bit.Ud(e.l,e.r,e.h);}); var ans=pbs.Fu(qa,e=>{return bit.Get(e.i,e.i)>=e.x;}); for(int i = 0;i < q;i++) { if(ans[i]>k) {pt.Wl(-1);} else {pt.Wl(a[ans[i]-1].c);} } } } public class Bit2{ private Bit bit1,bit2; public Bit2(int n){ bit1=new Bit(n); bit2=new Bit(n); } public void Ud(int l,int r,nint p){ bit1.Ud(l,-p*(l-1)); bit2.Ud(l,p); bit1.Ud(r+1,p*r); bit2.Ud(r+1,-p); } public nint Get(int l,int r){return bit2.Get(r)*r+bit1.Get(r)-bit2.Get(l-1)*(l-1)-bit1.Get(l-1);} public class Bit{ private int n; private nint[] bit; public Bit(int n){ this.n=n; bit=new nint[n+1]; } public void Ud(int a,nint p){a++;while(a<=n){bit[a]+=p;a+=a&-a;}} public nint Get(int n){ n++; nint a=0; while(n>0){a+=bit[n];n-=n&-n;} return a; } public void Clear(){bit=new nint[n+1];} } } public class Pbs<T1,T2>{ private List<int>[] liq; private T1[] cma; private Action fr; private Action<T1> cm; private int m,mid; private int[] la,ua; public Pbs(T1[] a,Action fr,Action<T1> cm){ m=a.Length+1; this.fr=fr; this.cm=cm; cma=new T1[m]; Array.Copy(a,0,cma,1,m-1); liq=new List<int>[m]; for(int i = 0;i < m;i++) {liq[i]=new List<int>();} la=new int[m]; ua=new int[m]; mid=(m-1)>>1; la[mid]=-1; ua[mid]=m; } public int[] Fu(T2[] qe,Func<T2,bool> f){ int p=0,q=qe.Length; var ans=new int[q]; for(int i = 0;i<q;i++) {liq[mid].Add(i);} while(p<q){ fr(); for(int i = 0;i<m;i++) { if(i!=0){cm(cma[i]);} for(int j = 0;j<liq[i].Count;j++) { int lb=i,ub=i; if(f(qe[liq[i][j]])){ mid=(la[i]+i)>>1; lb=la[i]; } else{ mid=(ua[i]+i)>>1; ub=ua[i]; } if(ub-lb>1){ liq[mid].Add(liq[i][j]); la[mid]=lb; ua[mid]=ub; } else{ ans[liq[i][j]]=ub; p++; } } liq[i].Clear(); } } return ans; } } public class Pt{ private StringBuilder sb=new StringBuilder(); public Pt(Action<Pt> f){f(this);} public void W(int s){sb.Append(s);} public void W(long s){sb.Append(s);} public void W(double s){sb.Append(s);} public void W(decimal s){sb.Append(s);} public void W(char s){sb.Append(s);} public void W(string s){sb.Append(s);} public void W(object s){sb.Append(s);} public void W(string f,int s){sb.Append(s.ToString(f));} public void W(string f,long s){sb.Append(s.ToString(f));} public void W(string f,double s){sb.Append(s.ToString(f));} public void W(string f,decimal s){sb.Append(s.ToString(f));} public void Wl(int s){sb.Append(s).Append(Environment.NewLine);} public void Wl(long s){sb.Append(s).Append(Environment.NewLine);} public void Wl(double s){sb.Append(s).Append(Environment.NewLine);} public void Wl(decimal s){sb.Append(s).Append(Environment.NewLine);} public void Wl(char s){sb.Append(s).Append(Environment.NewLine);} public void Wl(string s){sb.Append(s).Append(Environment.NewLine);} public void Wl(object s){sb.Append(s).Append(Environment.NewLine);} public void Wl(string f,int s){sb.Append(s.ToString(f)).Append(Environment.NewLine);} public void Wl(string f,long s){sb.Append(s.ToString(f)).Append(Environment.NewLine);} public void Wl(string f,double s){sb.Append(s.ToString(f)).Append(Environment.NewLine);} public void Wl(string f,decimal s){sb.Append(s.ToString(f)).Append(Environment.NewLine);} public void Wl(int[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);} public void Wl(long[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);} public void Wl(double[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);} public void Wl(string[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);} public void Wl(object[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);} public void Wl(){sb.Append(Environment.NewLine);} public void Sm(){Console.Write(sb);} public static bool operator==(Pt a,Pt b){return a.sb.ToString()==b.sb.ToString();} public static bool operator!=(Pt a,Pt b){return a.sb.ToString()!=b.sb.ToString();} public override bool Equals(object obj){return false;} public override int GetHashCode(){return 0;} } public class Sc{ [MethodImpl(MethodImplOptions.AggressiveInlining)] protected virtual string Rl(){return Console.ReadLine();} [MethodImpl(MethodImplOptions.AggressiveInlining)] protected virtual string[] Sp(string st){return st.Split();} [MethodImpl(MethodImplOptions.AggressiveInlining)] private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));} public virtual int I{get{return int.Parse(Rl());}} public virtual long L{get{return long.Parse(Rl());}} public virtual double D{get{return double.Parse(Rl());}} public virtual string S{get{return Rl();}} public int[] Ia{get{return Array.ConvertAll(Sp(Rl()),int.Parse);}} public long[] La{get{return Array.ConvertAll(Sp(Rl()),long.Parse);}} public double[] Da{get{return Array.ConvertAll(Sp(Rl()),double.Parse);}} public string[] Sa{get{return Sp(Rl());}} public object[] Oa{get{return Sp(Rl());}} public int[] Ia2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),int.Parse);}} public int[] Ia3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),int.Parse);} public int[] Ia3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),int.Parse);} public long[] La2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),long.Parse);}} public long[] La3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),long.Parse);} public long[] La3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),long.Parse);} public double[] Da2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),double.Parse);}} public double[] Da3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),double.Parse);} public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;} public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;} public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Sp(Rl()));}return a;} public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Sp(Rl()));}return a;} [MethodImpl(MethodImplOptions.AggressiveInlining)] public (T,T) Tp2<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]));} [MethodImpl(MethodImplOptions.AggressiveInlining)] public (T,T,T) Tp3<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]));} [MethodImpl(MethodImplOptions.AggressiveInlining)] public (T,T,T,T) Tp4<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]));} [MethodImpl(MethodImplOptions.AggressiveInlining)] public (T,T,T,T,T) Tp5<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]));} [MethodImpl(MethodImplOptions.AggressiveInlining)] public (T,T,T,T,T,T) Tp6<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]),Ct<T>(s[5]));} [MethodImpl(MethodImplOptions.AggressiveInlining)] public (T1,T2) Tp2<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T2>(s[1]));} [MethodImpl(MethodImplOptions.AggressiveInlining)] public (T1,T1,T2) Tp3<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T1>(s[1]),Ct<T2>(s[2]));} } public class Scr:Sc{ private List<string> li=new List<string>(); private int l=0; private bool bo=false; [MethodImpl(MethodImplOptions.AggressiveInlining)] protected override string Rl(){ if(bo){return li[l++%li.Count];} li.Add(Console.ReadLine()); return li[li.Count-1]; } public void Again(){bo=true;} } public class Sc2:Sc{ private string[] sps=new string[]{" "," ","\t"}; [MethodImpl(MethodImplOptions.AggressiveInlining)] protected override string[] Sp(string st){return st.Split(sps,StringSplitOptions.RemoveEmptyEntries);} public override int I{get{return int.Parse(Sp(Rl())[0]);}} public override long L{get{return long.Parse(Sp(Rl())[0]);}} public override double D{get{return double.Parse(Sp(Rl())[0]);}} public override string S{get{return Sp(Rl())[0];}} } public class Sct:Sc{ private List<string> li=new List<string>(); private int l=0; public void Add(int s){li.Add(s.ToString());} public void Add(long s){li.Add(s.ToString());} public void Add(double s){li.Add(s.ToString());} public void Add(string s){li.Add(s.ToString());} public void Add(object s){li.Add(s.ToString());} public void Add(int[] s){li.Add(string.Join(" ",s));} public void Add(long[] s){li.Add(string.Join(" ",s));} public void Add(double[] s){li.Add(string.Join(" ",s));} public void Add(string[] s){li.Add(string.Join(" ",s));} public void Add(object[] s){li.Add(string.Join(" ",s));} protected override string Rl(){return li[l++];} public void Clear(){li.Clear();l=0;} public void Again(){l=0;} public void Pf(){Console.WriteLine(string.Join("\n",li));} }