結果
問題 | No.914 Omiyage |
ユーザー | fgwiebfaoish |
提出日時 | 2019-10-25 21:57:18 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 26 ms / 2,000 ms |
コード長 | 5,351 bytes |
コンパイル時間 | 1,085 ms |
コンパイル使用メモリ | 115,672 KB |
実行使用メモリ | 26,044 KB |
最終ジャッジ日時 | 2024-09-24 16:27:47 |
合計ジャッジ時間 | 2,297 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
23,700 KB |
testcase_01 | AC | 26 ms
23,744 KB |
testcase_02 | AC | 26 ms
23,980 KB |
testcase_03 | AC | 25 ms
25,996 KB |
testcase_04 | AC | 26 ms
24,112 KB |
testcase_05 | AC | 25 ms
26,044 KB |
testcase_06 | AC | 26 ms
24,204 KB |
testcase_07 | AC | 26 ms
21,948 KB |
testcase_08 | AC | 25 ms
25,744 KB |
testcase_09 | AC | 25 ms
23,852 KB |
testcase_10 | AC | 24 ms
23,956 KB |
testcase_11 | AC | 25 ms
24,080 KB |
testcase_12 | AC | 26 ms
23,948 KB |
testcase_13 | AC | 26 ms
23,740 KB |
testcase_14 | AC | 25 ms
23,984 KB |
testcase_15 | AC | 25 ms
25,792 KB |
testcase_16 | AC | 25 ms
24,128 KB |
testcase_17 | AC | 26 ms
23,740 KB |
testcase_18 | AC | 25 ms
23,984 KB |
testcase_19 | AC | 25 ms
23,748 KB |
testcase_20 | AC | 25 ms
21,684 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.IO; using System.Reflection; using static System.Math; using System.Numerics; static class Program{ const int mod=(int)1e9+7; static void Main(){ Sc sc=new Sc(); var s=sc.Ia; var bs=new Bitset[s[0]+1]; bs[0]=new Bitset(s[0]+1,1); for(int i = 1;i<=s[0];i++) { var e=sc.Ia; bs[i]=new Bitset(s[2]+1); for(int j = 0;j<s[1];j++) { bs[i]|=bs[i-1]<<e[j]; } } for(int i = s[2];i>=0;i--) { if(bs[s[0]][i]==1){ Console.WriteLine("{0}",s[2]-i); return; } } Console.WriteLine("{0}",-1); } } public class Bitset{ public int n,l; public ulong[] he; public Bitset(int n){ this.n=n; l=(n>>6)+1; he=new ulong[l]; } public Bitset(int n,long a){ this.n=n; l=(n>>6)+1; he=new ulong[l]; he[0]=(ulong)a; } public Bitset(int n,bool b){ this.n=n; l=(n>>6)+1; he=new ulong[l]; int y=n%64; if(y==0){for(int i = 0;i<l;i++) {he[i]=ulong.MaxValue;}} else{ for(int i = 0;i<l-1;i++) {he[i]=ulong.MaxValue;} he[l-1]=(1UL<<y)-1; } } public int this[int i]{ set{he[i>>6]=(he[i>>6]&(ulong.MaxValue^(1UL<<i)))|((ulong)value<<i);} get{return (int)((he[i>>6]>>i)&1);} } public static Bitset operator&(Bitset a,Bitset b){ Bitset c=new Bitset(a.n); int d=Math.Min(a.l,b.l); for(int i=0;i<d;i++){c.he[i]=a.he[i]&b.he[i];} return c; } public static Bitset operator|(Bitset a,Bitset b){ Bitset c; if(a.l<b.l){c=a;a=b;b=c;} c=new Bitset(a.n); int i=0; for(;i<b.l;i++){c.he[i]=a.he[i]|b.he[i];} for(;i<a.l;i++){c.he[i]=a.he[i];} return c; } public static Bitset operator^(Bitset a,Bitset b){ Bitset c; if(a.l<b.l){c=a;a=b;b=c;} c=new Bitset(a.n); int i=0; for(;i<b.l;i++){c.he[i]=a.he[i]^b.he[i];} for(;i<a.l;i++){c.he[i]=a.he[i];} return c; } public static Bitset operator<<(Bitset a,int b){ Bitset c=new Bitset(a.n); if(b>a.l<<6){return c;} int d=(b+63)>>6; if(b%64==0){for(int i=a.l-1;i>=d;i--){c.he[i]=a.he[i-d];}} else{ for(int i=a.l-1;i>=d;i--){c.he[i]=(a.he[i-d+1]<<b)|(a.he[i-d]>>(64-b));} c.he[d-1]=a.he[0]<<b; } return c; } public static Bitset operator>>(Bitset a,int b){ Bitset c=new Bitset(a.n); if(b>a.l<<6){return c;} int d=(b+63)>>6; if(b%64==0){for(int i=0;i+d<c.l;i++){c.he[i]=a.he[i+d];}} else{ for(int i=0;i+d<c.l;i++){c.he[i]=(a.he[i+d-1]>>b)|(a.he[i+d]<<(64-b));} c.he[c.l-d]=a.he[c.l-1]>>b; } return c; } public static bool operator==(Bitset a,Bitset b){ int mx=Max(a.l,b.l),mn=Min(a.l,b.l); for(int i=0;i<mn;i++){if(a.he[i]!=b.he[i]){return false;}} if(a.l>b.l){for(int i=mn;i<mx;i++){if(a.he[i]!=0){return false;}}} else{for(int i=mn;i<mx;i++){if(b.he[i]!=0){return false;}}} return true; } public static bool operator!=(Bitset a,Bitset b){ int mx=Max(a.l,b.l),mn=Min(a.l,b.l); for(int i=0;i<mn;i++){if(a.he[i]!=b.he[i]){return true;}} if(a.l>b.l){for(int i=mn;i<mx;i++){if(a.he[i]!=0){return true;}}} else{for(int i=mn;i<mx;i++){if(b.he[i]!=0){return true;}}} return false; } public override bool Equals(object obj){return false;} public override int GetHashCode(){return 0;} public string St(){ string t="",s; for(int i = 0;i<l-1;i++) { s=Convert.ToString((long)he[i],2); s=(64>s.Length?new string('0',64-s.Length):"")+s; t=s+t; } s=Convert.ToString((long)he[l-1],2); s=((n%64)>s.Length?new string('0',(n%64)-s.Length):"")+s; return s+t; } } public class Sc{ public int I{get{return int.Parse(Console.ReadLine());}} public long L{get{return long.Parse(Console.ReadLine());}} public double D{get{return double.Parse(Console.ReadLine());}} public string S{get{return Console.ReadLine();}} public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}} public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}} public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}} public string[] Sa{get{return Console.ReadLine().Split();}} public object[] Oa{get{return Console.ReadLine().Split();}} public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}} public int[] Ia3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),int.Parse);} public int[] Ia3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),int.Parse);} public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}} public long[] La3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),long.Parse);} public long[] La3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),long.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(Console.ReadLine().Split());}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,Console.ReadLine().Split());}return a;} }