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

提出ソース

結果

問題	No.389 ロジックパズルの組み合わせ
ユーザー	uwi
提出日時	2016-07-08 22:39:16
言語	Java21 (openjdk 21)
結果	AC
実行時間	316 ms / 2,000 ms
コード長	3,942 bytes
コンパイル時間	4,358 ms
コンパイル使用メモリ	82,664 KB
実行使用メモリ	75,228 KB
最終ジャッジ日時	2024-10-13 04:39:51
合計ジャッジ時間	21,188 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	112 ms 46,000 KB
testcase_01	AC	53 ms 36,816 KB
testcase_02	AC	111 ms 46,016 KB
testcase_03	AC	65 ms 37,584 KB
testcase_04	AC	111 ms 45,748 KB
testcase_05	AC	53 ms 36,924 KB
testcase_06	AC	53 ms 36,880 KB
testcase_07	AC	54 ms 36,968 KB
testcase_08	AC	53 ms 36,988 KB
testcase_09	AC	168 ms 49,632 KB
testcase_10	AC	177 ms 48,952 KB
testcase_11	AC	200 ms 51,112 KB
testcase_12	AC	168 ms 48,648 KB
testcase_13	AC	262 ms 53,688 KB
testcase_14	AC	198 ms 51,176 KB
testcase_15	AC	163 ms 47,808 KB
testcase_16	AC	174 ms 48,804 KB
testcase_17	AC	194 ms 50,672 KB
testcase_18	AC	310 ms 68,972 KB
testcase_19	AC	111 ms 46,044 KB
testcase_20	AC	111 ms 45,676 KB
testcase_21	AC	116 ms 45,884 KB
testcase_22	AC	112 ms 45,952 KB
testcase_23	AC	112 ms 45,996 KB
testcase_24	AC	111 ms 46,008 KB
testcase_25	AC	112 ms 46,108 KB
testcase_26	AC	112 ms 45,940 KB
testcase_27	AC	112 ms 46,136 KB
testcase_28	AC	111 ms 46,020 KB
testcase_29	AC	112 ms 45,680 KB
testcase_30	AC	110 ms 45,696 KB
testcase_31	AC	109 ms 45,680 KB
testcase_32	AC	111 ms 46,088 KB
testcase_33	AC	111 ms 46,148 KB
testcase_34	AC	111 ms 45,824 KB
testcase_35	AC	110 ms 46,080 KB
testcase_36	AC	110 ms 46,136 KB
testcase_37	AC	112 ms 45,676 KB
testcase_38	AC	113 ms 45,952 KB
testcase_39	AC	111 ms 45,944 KB
testcase_40	AC	112 ms 46,020 KB
testcase_41	AC	111 ms 46,036 KB
testcase_42	AC	112 ms 46,136 KB
testcase_43	AC	111 ms 45,732 KB
testcase_44	AC	112 ms 46,040 KB
testcase_45	AC	112 ms 45,800 KB
testcase_46	AC	112 ms 45,956 KB
testcase_47	AC	112 ms 45,952 KB
testcase_48	AC	111 ms 45,676 KB
testcase_49	AC	253 ms 66,224 KB
testcase_50	AC	113 ms 40,192 KB
testcase_51	AC	123 ms 39,988 KB
testcase_52	AC	147 ms 45,548 KB
testcase_53	AC	133 ms 41,004 KB
testcase_54	AC	174 ms 45,940 KB
testcase_55	AC	83 ms 38,688 KB
testcase_56	AC	117 ms 40,872 KB
testcase_57	AC	175 ms 51,384 KB
testcase_58	AC	243 ms 58,340 KB
testcase_59	AC	249 ms 56,240 KB
testcase_60	AC	159 ms 45,764 KB
testcase_61	AC	316 ms 75,228 KB
testcase_62	AC	163 ms 45,764 KB
testcase_63	AC	239 ms 58,824 KB
testcase_64	AC	170 ms 45,724 KB
testcase_65	AC	145 ms 42,492 KB
testcase_66	AC	163 ms 46,020 KB
testcase_67	AC	152 ms 45,976 KB
testcase_68	AC	160 ms 45,764 KB
testcase_69	AC	111 ms 46,008 KB
testcase_70	AC	111 ms 46,004 KB
testcase_71	AC	111 ms 45,668 KB
testcase_72	AC	111 ms 45,888 KB
testcase_73	AC	110 ms 45,804 KB
testcase_74	AC	111 ms 46,004 KB
testcase_75	AC	111 ms 45,952 KB
testcase_76	AC	110 ms 45,948 KB
testcase_77	AC	112 ms 45,692 KB
testcase_78	AC	112 ms 46,004 KB
testcase_79	AC	112 ms 46,016 KB
testcase_80	AC	112 ms 45,736 KB
testcase_81	AC	112 ms 45,692 KB
testcase_82	AC	111 ms 45,944 KB
testcase_83	AC	110 ms 45,732 KB
testcase_84	AC	109 ms 45,796 KB
testcase_85	AC	110 ms 45,760 KB
testcase_86	AC	111 ms 46,008 KB
testcase_87	AC	110 ms 46,028 KB
testcase_88	AC	110 ms 45,688 KB
testcase_89	AC	231 ms 50,036 KB
testcase_90	AC	269 ms 54,272 KB
testcase_91	AC	310 ms 69,760 KB
testcase_92	AC	178 ms 50,560 KB
testcase_93	AC	293 ms 59,980 KB
testcase_94	AC	132 ms 46,640 KB
testcase_95	AC	293 ms 61,816 KB
testcase_96	AC	260 ms 53,692 KB
testcase_97	AC	293 ms 58,536 KB
testcase_98	AC	215 ms 50,244 KB

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

ソースコード

raw source code

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class N389 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		String line = ns();
		String[] sp = line.split(" ");
		int[] a = new int[sp.length];
		for(int i = 0;i < sp.length;i++){
			a[i] = Integer.parseInt(sp[i]);
		}
		if(a[0] == 0){
			out.println(1);
			return;
		}
		int sum = n-(Arrays.stream(a).sum()+sp.length-1);
		if(sum < 0){
			out.println("NA");
			return;
		}
		int num = sp.length;
		int mod = 1000000007;
		int[][] fif = enumFIF(1000000, mod);
		out.println(C(sum+num,num,mod,fif));
		
	}
	
	public static long C(int n, int r, int mod, int[][] fif) {
		if (n < 0 || r < 0 || r > n)
			return 0;
		return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;
	}

	
	public static int[][] enumFIF(int n, int mod) {
		int[] f = new int[n + 1];
		int[] invf = new int[n + 1];
		f[0] = 1;
		for (int i = 1; i <= n; i++) {
			f[i] = (int) ((long) f[i - 1] * i % mod);
		}
		long a = f[n];
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		invf[n] = (int) (p < 0 ? p + mod : p);
		for (int i = n - 1; i >= 0; i--) {
			invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);
		}
		return new int[][] { f, invf };
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new N389().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b) && b != ' ')){
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード