結果
問題 | No.389 ロジックパズルの組み合わせ |
ユーザー | threepipes_s |
提出日時 | 2016-07-08 22:40:01 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 449 ms / 2,000 ms |
コード長 | 7,330 bytes |
コンパイル時間 | 2,893 ms |
コンパイル使用メモリ | 98,372 KB |
実行使用メモリ | 74,220 KB |
最終ジャッジ日時 | 2024-04-21 06:06:25 |
合計ジャッジ時間 | 24,676 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 109 ms
40,692 KB |
testcase_01 | AC | 117 ms
40,080 KB |
testcase_02 | AC | 112 ms
40,400 KB |
testcase_03 | AC | 111 ms
40,608 KB |
testcase_04 | AC | 114 ms
45,328 KB |
testcase_05 | AC | 116 ms
40,976 KB |
testcase_06 | AC | 110 ms
41,004 KB |
testcase_07 | AC | 117 ms
41,308 KB |
testcase_08 | AC | 112 ms
40,456 KB |
testcase_09 | AC | 254 ms
54,152 KB |
testcase_10 | AC | 221 ms
47,144 KB |
testcase_11 | AC | 282 ms
53,956 KB |
testcase_12 | AC | 181 ms
44,448 KB |
testcase_13 | AC | 363 ms
61,924 KB |
testcase_14 | AC | 246 ms
47,380 KB |
testcase_15 | AC | 213 ms
44,492 KB |
testcase_16 | AC | 217 ms
46,544 KB |
testcase_17 | AC | 257 ms
52,168 KB |
testcase_18 | AC | 417 ms
71,568 KB |
testcase_19 | AC | 112 ms
40,488 KB |
testcase_20 | AC | 106 ms
39,992 KB |
testcase_21 | AC | 110 ms
40,744 KB |
testcase_22 | AC | 123 ms
41,084 KB |
testcase_23 | AC | 118 ms
40,908 KB |
testcase_24 | AC | 115 ms
39,920 KB |
testcase_25 | AC | 111 ms
40,516 KB |
testcase_26 | AC | 111 ms
40,684 KB |
testcase_27 | AC | 118 ms
40,908 KB |
testcase_28 | AC | 115 ms
40,416 KB |
testcase_29 | AC | 119 ms
41,256 KB |
testcase_30 | AC | 109 ms
40,384 KB |
testcase_31 | AC | 120 ms
40,364 KB |
testcase_32 | AC | 116 ms
40,420 KB |
testcase_33 | AC | 109 ms
40,020 KB |
testcase_34 | AC | 118 ms
40,692 KB |
testcase_35 | AC | 113 ms
40,692 KB |
testcase_36 | AC | 118 ms
40,668 KB |
testcase_37 | AC | 115 ms
39,768 KB |
testcase_38 | AC | 111 ms
40,228 KB |
testcase_39 | AC | 110 ms
40,840 KB |
testcase_40 | AC | 121 ms
41,100 KB |
testcase_41 | AC | 114 ms
39,956 KB |
testcase_42 | AC | 120 ms
40,668 KB |
testcase_43 | AC | 116 ms
40,504 KB |
testcase_44 | AC | 117 ms
40,284 KB |
testcase_45 | AC | 115 ms
40,456 KB |
testcase_46 | AC | 117 ms
39,884 KB |
testcase_47 | AC | 110 ms
40,588 KB |
testcase_48 | AC | 117 ms
40,588 KB |
testcase_49 | AC | 449 ms
71,464 KB |
testcase_50 | AC | 197 ms
43,696 KB |
testcase_51 | AC | 173 ms
42,940 KB |
testcase_52 | AC | 259 ms
47,392 KB |
testcase_53 | AC | 196 ms
44,360 KB |
testcase_54 | AC | 259 ms
47,348 KB |
testcase_55 | AC | 136 ms
41,176 KB |
testcase_56 | AC | 194 ms
44,064 KB |
testcase_57 | AC | 297 ms
54,604 KB |
testcase_58 | AC | 405 ms
64,500 KB |
testcase_59 | AC | 351 ms
59,396 KB |
testcase_60 | AC | 262 ms
51,392 KB |
testcase_61 | AC | 432 ms
74,220 KB |
testcase_62 | AC | 282 ms
51,480 KB |
testcase_63 | AC | 416 ms
64,352 KB |
testcase_64 | AC | 260 ms
47,732 KB |
testcase_65 | AC | 225 ms
47,828 KB |
testcase_66 | AC | 280 ms
51,312 KB |
testcase_67 | AC | 273 ms
50,860 KB |
testcase_68 | AC | 260 ms
47,552 KB |
testcase_69 | AC | 122 ms
46,404 KB |
testcase_70 | AC | 125 ms
47,812 KB |
testcase_71 | AC | 118 ms
42,800 KB |
testcase_72 | AC | 123 ms
47,144 KB |
testcase_73 | AC | 113 ms
43,032 KB |
testcase_74 | AC | 119 ms
42,588 KB |
testcase_75 | AC | 112 ms
43,100 KB |
testcase_76 | AC | 119 ms
44,752 KB |
testcase_77 | AC | 119 ms
44,396 KB |
testcase_78 | AC | 105 ms
41,736 KB |
testcase_79 | AC | 109 ms
42,224 KB |
testcase_80 | AC | 120 ms
41,664 KB |
testcase_81 | AC | 126 ms
41,672 KB |
testcase_82 | AC | 132 ms
47,272 KB |
testcase_83 | AC | 122 ms
43,508 KB |
testcase_84 | AC | 116 ms
42,336 KB |
testcase_85 | AC | 132 ms
47,936 KB |
testcase_86 | AC | 123 ms
46,552 KB |
testcase_87 | AC | 113 ms
40,848 KB |
testcase_88 | AC | 110 ms
40,620 KB |
testcase_89 | AC | 291 ms
52,844 KB |
testcase_90 | AC | 379 ms
62,748 KB |
testcase_91 | AC | 423 ms
70,896 KB |
testcase_92 | AC | 230 ms
47,968 KB |
testcase_93 | AC | 382 ms
62,472 KB |
testcase_94 | AC | 152 ms
46,256 KB |
testcase_95 | AC | 367 ms
60,812 KB |
testcase_96 | AC | 371 ms
61,520 KB |
testcase_97 | AC | 341 ms
55,904 KB |
testcase_98 | AC | 275 ms
54,124 KB |
ソースコード
import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.Closeable; import java.io.FileInputStream; import java.io.FileWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.ArrayList; import java.util.HashMap; import java.util.List; import java.util.Scanner; import java.util.TreeMap; public class Main { static ContestScanner in;static Writer out;public static void main(String[] args) {try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve(); in.close();out.flush();out.close();}catch(IOException e){e.printStackTrace();}} static void dump(int[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();} static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();} static void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();} static void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();} static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;} static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');} static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);} static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);} static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);} static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);} static void m_sort(int[]a,int s,int sz,int[]b) {if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;} m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz; while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];} while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i]; } /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */ static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);} static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);} static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);} static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);} static void m_sort(long[]a,int s,int sz,long[]b) {if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;} m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz; while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];} while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];} static void swap(long[] a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;} static void swap(int[] a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;} static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v {int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;} static int binarySearchSmallerMax(int[]a,int v,int l,int r) {int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;} static List<Integer>[]createGraph(int n) {List<Integer>[]g=new List[n];for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;} void solve() throws NumberFormatException, IOException{ Scanner in = new Scanner(System.in); int n = Integer.parseInt(in.nextLine()); String[] s = in.nextLine().trim().split(" "); int[] x = new int[s.length]; int sum = 0; for(int i=0; i<s.length; i++){ x[i] = Integer.parseInt(s[i]); if(i<s.length-1){ x[i]++; } sum += x[i]; } int sp = n-sum; if(sum==0){ System.out.println(1); return; } if(sp<0){ System.out.println("NA"); return; } final long mod = 1000000007; long[] map = new long[n]; System.out.println(modcomb(sp+x.length, x.length, mod)); } long modcomb(long n, long r, long mod){ if(n-r < r) r = n-r; long res = 1; for(long i=0; i<r; i++){ res = (res*(n-i))%mod; } for(long i=2; i<=r; i++){ res = (res*modinv(i, mod))%mod; } return (long)res; } long modinv(long n, long mod){ return modpow(n, mod-2, mod); } long modpow(long n, long a, long mod){ long res = 1; while(a > 0){ if((a&1)==1) res = (res*n)%mod; n = n*n%mod; a >>= 1; } return res; } } class MultiSet<T> extends HashMap<T, Integer>{ @Override public Integer get(Object key){return containsKey(key)?super.get(key):0;} public void add(T key,int v){put(key,get(key)+v);} public void add(T key){put(key,get(key)+1);} public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);} public MultiSet<T> merge(MultiSet<T> set) {MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;} for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;} } class OrderedMultiSet<T> extends TreeMap<T, Integer>{ @Override public Integer get(Object key){return containsKey(key)?super.get(key):0;} public void add(T key,int v){put(key,get(key)+v);} public void add(T key){put(key,get(key)+1);} public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);} public OrderedMultiSet<T> merge(OrderedMultiSet<T> set) {OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;} while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;} } class Pair implements Comparable<Pair>{ int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;} public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;} public int hashCode(){return hash;} public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;} } class Timer{ long time;public void set(){time=System.currentTimeMillis();} public long stop(){return time=System.currentTimeMillis()-time;} public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");} @Override public String toString(){return"Time: "+time+"ms";} } class Writer extends PrintWriter{ public Writer(String filename)throws IOException {super(new BufferedWriter(new FileWriter(filename)));} public Writer()throws IOException{super(System.out);} } class ContestScanner implements Closeable{ private BufferedReader in;private int c=-2; public ContestScanner()throws IOException {in=new BufferedReader(new InputStreamReader(System.in));} public ContestScanner(String filename)throws IOException {in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));} public String nextToken()throws IOException { StringBuilder sb=new StringBuilder(); while((c=in.read())!=-1&&Character.isWhitespace(c)); while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();} return sb.toString(); } public String readLine()throws IOException{ StringBuilder sb=new StringBuilder();if(c==-2)c=in.read(); while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();} return sb.toString(); } public long nextLong()throws IOException,NumberFormatException {return Long.parseLong(nextToken());} public int nextInt()throws NumberFormatException,IOException {return(int)nextLong();} public double nextDouble()throws NumberFormatException,IOException {return Double.parseDouble(nextToken());} public void close() throws IOException {in.close();} }