結果
問題 | No.2840 RGB Plates |
ユーザー | KumaTachiRen |
提出日時 | 2024-08-09 22:54:54 |
言語 | C# (.NET 8.0.203) |
結果 |
TLE
|
実行時間 | - |
コード長 | 7,910 bytes |
コンパイル時間 | 12,235 ms |
コンパイル使用メモリ | 165,732 KB |
実行使用メモリ | 35,456 KB |
最終ジャッジ日時 | 2024-08-09 22:55:11 |
合計ジャッジ時間 | 11,314 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
28,000 KB |
testcase_01 | AC | 43 ms
35,456 KB |
testcase_02 | AC | 47 ms
24,448 KB |
testcase_03 | AC | 42 ms
24,448 KB |
testcase_04 | TLE | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (140 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.Numerics; 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 int[] a, n); int m = a.Sum(); var bs = new BitSetArray(m + 1, 3); bs[1, 0] = true; for (int i = 0; i < n; i++) { bs.Copy(0, 2); bs.LeftShift(0, a[i]); bs.Or(2, 0); bs.Copy(0, 1); bs.LeftShift(0, a[i]); bs.And(0, 1); bs.Or(2, 0); bs.Copy(0, 1); bs.LeftShift(0, a[i]); bs.Or(1, 0); } int ans = -1; for (int k = 1; m - 2 * k > 0; k++) if (bs[2, k]) ans = Math.Max(ans, m - 2 * k); Write(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 BitSetArray{private const int SHIFT=6;private const int B=1<<SHIFT;private const int MASK=B-1;public readonly int Size;private readonly ulong[][]data;public BitSetArray(int n,int m){Size=n;data=new ulong[m][];for(int i=0;i<m;i++)data[i]=new ulong[(n+MASK)>>SHIFT];}public bool this[int k,int i]{get=>((data[k][i>>SHIFT]>>(i&MASK))&1)==1;set{int x=i>>SHIFT,y=i&MASK;var v=data[k][x];v^=v&(1ul<<y);v^=(value?1ul:0ul)<<y;data[k][x]=v;}}public void Clear()=>data.AsSpan().Clear();public void Clear(int x)=>data[x].AsSpan().Clear();public void Copy(int to,int with){data[with].CopyTo(data[to],0);}public void And(int to,int with){for(int i=0;i<data[to].Length;i++)data[to][i]&=data[with][i];}public void Or(int to,int with){for(int i=0;i<data[to].Length;i++)data[to][i]|=data[with][i];}public void Xor(int to,int with){for(int i=0;i<data[to].Length;i++)data[to][i]^=data[with][i];}public void LeftShift(int x,int k){if(k>=Size){data[x].AsSpan().Clear();return;}int q=k>>SHIFT,r=k&MASK;if(r==0){for(int i=data[x].Length-1;i>=q;i--)data[x][i]=data[x][i-q];}else{for(int i=data[x].Length-1;i>q;i--)data[x][i]=(data[x][i-q]<<r)|(data[x][i-q-1]>>(B-r));data[x][q]=data[x][0]<<r;}data[x].AsSpan(0,q).Clear();}public void RightShift(int x,int k){if(k>=Size){data[x].AsSpan().Clear();return;}int q=k>>SHIFT,r=k&MASK;if(r==0){for(int i=q;i<data[x].Length;i++)data[x][i-q]=data[x][i];}else{for(int i=q;i+1<data[x].Length;i++)data[x][i-q]=(data[x][i]>>r)|(data[x][i+1]<<(B-r));data[x][data[x].Length-1-q]=data[x][data[x].Length-1]>>r;}data[x].AsSpan(data.Length-q).Clear();}public int Popcount(int x){int ret=0;for(int i=0;i<data[x].Length;i++)ret+=BitOperations.PopCount(data[x][i]);return ret;}} 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