#102093 (Java21) No.389 ロジックパズルの組み合わせ

提出ソース

結果

問題	No.389 ロジックパズルの組み合わせ
ユーザー	threepipes_s
提出日時	2016-07-08 22:40:01
言語	Java21 (openjdk 21)
結果	AC
実行時間	469 ms / 2,000 ms
コード長	7,330 bytes
コンパイル時間	3,363 ms
コンパイル使用メモリ	97,728 KB
実行使用メモリ	74,364 KB
最終ジャッジ日時	2024-10-13 04:41:59
合計ジャッジ時間	24,315 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	115 ms 43,088 KB
testcase_01	AC	122 ms 42,880 KB
testcase_02	AC	122 ms 42,924 KB
testcase_03	AC	118 ms 42,740 KB
testcase_04	AC	107 ms 46,276 KB
testcase_05	AC	117 ms 41,968 KB
testcase_06	AC	119 ms 42,996 KB
testcase_07	AC	123 ms 42,900 KB
testcase_08	AC	118 ms 43,008 KB
testcase_09	AC	255 ms 54,328 KB
testcase_10	AC	240 ms 47,256 KB
testcase_11	AC	268 ms 55,492 KB
testcase_12	AC	192 ms 46,912 KB
testcase_13	AC	359 ms 61,808 KB
testcase_14	AC	239 ms 47,888 KB
testcase_15	AC	223 ms 46,448 KB
testcase_16	AC	222 ms 46,852 KB
testcase_17	AC	281 ms 52,364 KB
testcase_18	AC	456 ms 71,588 KB
testcase_19	AC	119 ms 41,992 KB
testcase_20	AC	117 ms 41,688 KB
testcase_21	AC	119 ms 41,916 KB
testcase_22	AC	118 ms 41,896 KB
testcase_23	AC	117 ms 42,840 KB
testcase_24	AC	113 ms 42,332 KB
testcase_25	AC	119 ms 42,812 KB
testcase_26	AC	109 ms 41,896 KB
testcase_27	AC	121 ms 42,108 KB
testcase_28	AC	111 ms 42,252 KB
testcase_29	AC	126 ms 43,036 KB
testcase_30	AC	126 ms 42,892 KB
testcase_31	AC	114 ms 42,272 KB
testcase_32	AC	115 ms 41,680 KB
testcase_33	AC	122 ms 42,812 KB
testcase_34	AC	119 ms 41,752 KB
testcase_35	AC	118 ms 41,820 KB
testcase_36	AC	125 ms 42,460 KB
testcase_37	AC	116 ms 43,216 KB
testcase_38	AC	118 ms 41,904 KB
testcase_39	AC	118 ms 42,124 KB
testcase_40	AC	118 ms 42,168 KB
testcase_41	AC	117 ms 42,120 KB
testcase_42	AC	121 ms 43,180 KB
testcase_43	AC	118 ms 42,388 KB
testcase_44	AC	111 ms 42,892 KB
testcase_45	AC	117 ms 41,960 KB
testcase_46	AC	118 ms 42,184 KB
testcase_47	AC	116 ms 43,300 KB
testcase_48	AC	120 ms 41,412 KB
testcase_49	AC	467 ms 71,332 KB
testcase_50	AC	189 ms 43,628 KB
testcase_51	AC	181 ms 42,976 KB
testcase_52	AC	254 ms 47,648 KB
testcase_53	AC	202 ms 44,272 KB
testcase_54	AC	265 ms 47,816 KB
testcase_55	AC	141 ms 40,896 KB
testcase_56	AC	196 ms 44,312 KB
testcase_57	AC	333 ms 54,604 KB
testcase_58	AC	427 ms 64,452 KB
testcase_59	AC	395 ms 59,100 KB
testcase_60	AC	278 ms 51,036 KB
testcase_61	AC	469 ms 74,364 KB
testcase_62	AC	274 ms 52,112 KB
testcase_63	AC	430 ms 64,608 KB
testcase_64	AC	260 ms 48,664 KB
testcase_65	AC	227 ms 47,948 KB
testcase_66	AC	258 ms 51,124 KB
testcase_67	AC	245 ms 50,780 KB
testcase_68	AC	276 ms 47,540 KB
testcase_69	AC	122 ms 46,712 KB
testcase_70	AC	127 ms 48,236 KB
testcase_71	AC	111 ms 43,484 KB
testcase_72	AC	111 ms 48,008 KB
testcase_73	AC	117 ms 43,912 KB
testcase_74	AC	122 ms 43,784 KB
testcase_75	AC	110 ms 43,740 KB
testcase_76	AC	118 ms 45,380 KB
testcase_77	AC	114 ms 45,020 KB
testcase_78	AC	116 ms 42,432 KB
testcase_79	AC	116 ms 43,344 KB
testcase_80	AC	118 ms 41,436 KB
testcase_81	AC	120 ms 40,540 KB
testcase_82	AC	120 ms 47,428 KB
testcase_83	AC	116 ms 44,240 KB
testcase_84	AC	116 ms 42,624 KB
testcase_85	AC	123 ms 47,624 KB
testcase_86	AC	127 ms 46,832 KB
testcase_87	AC	125 ms 40,640 KB
testcase_88	AC	109 ms 41,300 KB
testcase_89	AC	295 ms 53,300 KB
testcase_90	AC	367 ms 62,204 KB
testcase_91	AC	439 ms 70,928 KB
testcase_92	AC	227 ms 48,292 KB
testcase_93	AC	365 ms 62,084 KB
testcase_94	AC	153 ms 46,068 KB
testcase_95	AC	377 ms 61,624 KB
testcase_96	AC	367 ms 61,768 KB
testcase_97	AC	342 ms 56,164 KB
testcase_98	AC	272 ms 54,156 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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();}
}

yukicoder

結果

テストケース

ソースコード