結果
問題 | No.2927 Reverse Polish Equation |
ユーザー | KumaTachiRen |
提出日時 | 2024-10-12 15:25:26 |
言語 | C# (.NET 8.0.203) |
結果 |
AC
|
実行時間 | 335 ms / 2,000 ms |
コード長 | 7,258 bytes |
コンパイル時間 | 8,076 ms |
コンパイル使用メモリ | 167,092 KB |
実行使用メモリ | 219,676 KB |
最終ジャッジ日時 | 2024-10-16 00:22:53 |
合計ジャッジ時間 | 16,237 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
29,312 KB |
testcase_01 | AC | 51 ms
29,184 KB |
testcase_02 | AC | 51 ms
29,440 KB |
testcase_03 | AC | 51 ms
29,440 KB |
testcase_04 | AC | 50 ms
29,312 KB |
testcase_05 | AC | 53 ms
29,184 KB |
testcase_06 | AC | 51 ms
29,280 KB |
testcase_07 | AC | 69 ms
31,872 KB |
testcase_08 | AC | 68 ms
32,000 KB |
testcase_09 | AC | 67 ms
32,128 KB |
testcase_10 | AC | 51 ms
29,312 KB |
testcase_11 | AC | 68 ms
32,096 KB |
testcase_12 | AC | 131 ms
40,192 KB |
testcase_13 | AC | 181 ms
46,080 KB |
testcase_14 | AC | 148 ms
41,720 KB |
testcase_15 | AC | 165 ms
45,440 KB |
testcase_16 | AC | 102 ms
36,224 KB |
testcase_17 | AC | 202 ms
50,048 KB |
testcase_18 | AC | 241 ms
54,656 KB |
testcase_19 | AC | 74 ms
33,152 KB |
testcase_20 | AC | 204 ms
49,636 KB |
testcase_21 | AC | 271 ms
57,984 KB |
testcase_22 | AC | 86 ms
34,404 KB |
testcase_23 | AC | 50 ms
29,184 KB |
testcase_24 | AC | 44 ms
23,680 KB |
testcase_25 | AC | 52 ms
29,280 KB |
testcase_26 | AC | 51 ms
29,184 KB |
testcase_27 | AC | 264 ms
55,808 KB |
testcase_28 | AC | 273 ms
52,072 KB |
testcase_29 | AC | 97 ms
34,304 KB |
testcase_30 | AC | 300 ms
54,784 KB |
testcase_31 | AC | 79 ms
33,280 KB |
testcase_32 | AC | 119 ms
36,992 KB |
testcase_33 | AC | 165 ms
41,696 KB |
testcase_34 | AC | 189 ms
44,416 KB |
testcase_35 | AC | 52 ms
29,312 KB |
testcase_36 | AC | 227 ms
54,912 KB |
testcase_37 | AC | 145 ms
39,552 KB |
testcase_38 | AC | 335 ms
57,856 KB |
testcase_39 | AC | 175 ms
42,752 KB |
testcase_40 | AC | 286 ms
54,400 KB |
testcase_41 | AC | 251 ms
50,432 KB |
testcase_42 | AC | 231 ms
54,016 KB |
testcase_43 | AC | 231 ms
54,144 KB |
testcase_44 | AC | 234 ms
54,144 KB |
testcase_45 | AC | 223 ms
219,676 KB |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (96 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/
ソースコード
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 q = ri; long y = rl; var ops = new (int t, long v)[q]; for (int i = 0; i < q; i++) { var s = rs; if (s[0] == '+') { ops[i] = (0, 0); } else if (s[0] == 'm') { if (s[1] == 'i') { ops[i] = (1, 0); } else { ops[i] = (2, 0); } } else if (s[0] == 'X') { ops[i] = (-1, 0); } else { long v = long.Parse(s); ops[i] = (-2, v); } } var st = new Stack<long>(); long lt = -1, geq = y + 1; while (geq - lt > 1) { long x = (geq + lt) / 2; foreach (var (t, v) in ops) { if (t == 0) st.Push(st.Pop() + st.Pop()); if (t == 1) st.Push(Math.Min(st.Pop(), st.Pop())); if (t == 2) st.Push(Math.Max(st.Pop(), st.Pop())); if (t == -1) st.Push(x); if (t == -2) st.Push(v); } long z = st.Pop(); if (z < y) lt = x; else geq = x; } { long x = geq; foreach (var (t, v) in ops) { if (t == 0) st.Push(st.Pop() + st.Pop()); if (t == 1) st.Push(Math.Min(st.Pop(), st.Pop())); if (t == 2) st.Push(Math.Max(st.Pop(), st.Pop())); if (t == -1) st.Push(x); if (t == -2) st.Push(v); } long z = st.Pop(); Write(z == y ? x : -1); } } #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 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;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