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

提出ソース

結果

問題	No.389 ロジックパズルの組み合わせ
ユーザー	ぴろず
提出日時	2016-07-08 22:33:38
言語	Java21 (openjdk 21)
結果	AC
実行時間	234 ms / 2,000 ms
コード長	5,160 bytes
コンパイル時間	2,451 ms
コンパイル使用メモリ	79,152 KB
実行使用メモリ	72,956 KB
最終ジャッジ日時	2024-04-21 06:01:16
合計ジャッジ時間	13,975 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	50 ms 50,268 KB
testcase_01	AC	56 ms 50,260 KB
testcase_02	AC	55 ms 50,272 KB
testcase_03	AC	51 ms 50,328 KB
testcase_04	AC	120 ms 63,120 KB
testcase_05	AC	49 ms 37,204 KB
testcase_06	AC	49 ms 36,532 KB
testcase_07	AC	51 ms 37,024 KB
testcase_08	AC	51 ms 37,232 KB
testcase_09	AC	172 ms 67,388 KB
testcase_10	AC	114 ms 41,648 KB
testcase_11	AC	185 ms 58,180 KB
testcase_12	AC	106 ms 53,924 KB
testcase_13	AC	229 ms 72,956 KB
testcase_14	AC	125 ms 44,576 KB
testcase_15	AC	101 ms 42,252 KB
testcase_16	AC	136 ms 48,324 KB
testcase_17	AC	156 ms 51,932 KB
testcase_18	AC	205 ms 55,120 KB
testcase_19	AC	48 ms 36,560 KB
testcase_20	AC	49 ms 36,836 KB
testcase_21	AC	48 ms 36,888 KB
testcase_22	AC	48 ms 36,916 KB
testcase_23	AC	46 ms 36,836 KB
testcase_24	AC	46 ms 37,044 KB
testcase_25	AC	47 ms 36,672 KB
testcase_26	AC	48 ms 36,960 KB
testcase_27	AC	48 ms 36,568 KB
testcase_28	AC	49 ms 36,984 KB
testcase_29	AC	47 ms 36,800 KB
testcase_30	AC	52 ms 36,672 KB
testcase_31	AC	48 ms 36,916 KB
testcase_32	AC	52 ms 37,024 KB
testcase_33	AC	48 ms 36,964 KB
testcase_34	AC	48 ms 37,068 KB
testcase_35	AC	50 ms 37,132 KB
testcase_36	AC	49 ms 36,864 KB
testcase_37	AC	49 ms 36,636 KB
testcase_38	AC	49 ms 36,836 KB
testcase_39	AC	48 ms 37,332 KB
testcase_40	AC	47 ms 36,672 KB
testcase_41	AC	48 ms 36,572 KB
testcase_42	AC	48 ms 36,876 KB
testcase_43	AC	47 ms 37,156 KB
testcase_44	AC	47 ms 37,004 KB
testcase_45	AC	49 ms 37,232 KB
testcase_46	AC	49 ms 37,004 KB
testcase_47	AC	48 ms 37,204 KB
testcase_48	AC	48 ms 36,760 KB
testcase_49	AC	136 ms 44,132 KB
testcase_50	AC	79 ms 38,024 KB
testcase_51	AC	76 ms 37,656 KB
testcase_52	AC	91 ms 39,804 KB
testcase_53	AC	82 ms 38,364 KB
testcase_54	AC	80 ms 40,076 KB
testcase_55	AC	50 ms 37,128 KB
testcase_56	AC	78 ms 37,724 KB
testcase_57	AC	111 ms 40,712 KB
testcase_58	AC	135 ms 44,024 KB
testcase_59	AC	122 ms 42,428 KB
testcase_60	AC	105 ms 40,424 KB
testcase_61	AC	146 ms 44,548 KB
testcase_62	AC	94 ms 40,168 KB
testcase_63	AC	132 ms 43,696 KB
testcase_64	AC	83 ms 40,180 KB
testcase_65	AC	89 ms 39,632 KB
testcase_66	AC	94 ms 40,164 KB
testcase_67	AC	96 ms 40,204 KB
testcase_68	AC	95 ms 39,376 KB
testcase_69	AC	125 ms 54,232 KB
testcase_70	AC	106 ms 49,628 KB
testcase_71	AC	89 ms 45,188 KB
testcase_72	AC	139 ms 57,572 KB
testcase_73	AC	95 ms 57,316 KB
testcase_74	AC	91 ms 57,292 KB
testcase_75	AC	90 ms 57,520 KB
testcase_76	AC	104 ms 59,572 KB
testcase_77	AC	107 ms 59,728 KB
testcase_78	AC	77 ms 55,544 KB
testcase_79	AC	85 ms 57,404 KB
testcase_80	AC	77 ms 55,512 KB
testcase_81	AC	57 ms 50,388 KB
testcase_82	AC	133 ms 66,204 KB
testcase_83	AC	94 ms 47,088 KB
testcase_84	AC	78 ms 43,896 KB
testcase_85	AC	148 ms 58,724 KB
testcase_86	AC	134 ms 66,320 KB
testcase_87	AC	58 ms 38,864 KB
testcase_88	AC	47 ms 36,660 KB
testcase_89	AC	156 ms 49,300 KB
testcase_90	AC	225 ms 63,060 KB
testcase_91	AC	206 ms 66,460 KB
testcase_92	AC	140 ms 45,972 KB
testcase_93	AC	201 ms 56,336 KB
testcase_94	AC	123 ms 62,964 KB
testcase_95	AC	182 ms 50,660 KB
testcase_96	AC	234 ms 62,692 KB
testcase_97	AC	200 ms 68,328 KB
testcase_98	AC	177 ms 58,588 KB

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

ソースコード

raw source code

package no389;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	public static long MOD = 1000000007;
	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		ArrayList<Integer> h = new ArrayList<>();
		while(io.hasNext()) {
			h.add(io.nextInt());
		}
		if (h.size() == 1 && h.get(0) == 0) {
			System.out.println(1);
			return;
		}
		int sum = 0;
		for(int x: h) {
			sum += x;
		}
		int m = h.size();
		int free = n - (sum + m - 1);
		if (free < 0) {
			System.out.println("NA");
			return;
		}
//		System.out.println(m + "." + free);
		//ans = fact[free+m-1] / fact[free] / fact[m-1]
		long[] fact = Mod.factorialArray(n+1, MOD);
		long[] factInv = Mod.factorialInverseArray(n+1, MOD, Mod.inverseArray(n+1, MOD));
		System.out.println(fact[free+m] * factInv[free] % MOD * factInv[m] % MOD);
	}

}
class Mod {
	public static long[] inverseArray(int maxN,long modP) {
		long[] inv = new long[maxN+1];
		inv[1] = 1;
		for(int i=2;i<=maxN;i++) {
			inv[i] = modP - (modP / i) * inv[(int) (modP%i)] % modP;
		}
		return inv;
	}
	public static long[] factorialArray(int maxN,long mod) {
		long[] fact = new long[maxN+1];
		fact[0] = 1 % mod;
		for(int i=1;i<=maxN;i++) {
			fact[i] = fact[i-1] * i % mod;
		}
		return fact;
	}
	public static long[] factorialInverseArray(int maxN,long modP,long[] inverseArray) {
		long[] factInv = new long[maxN+1];
		factInv[0] = 1;
		for(int i=1;i<=maxN;i++) {
			factInv[i] = factInv[i-1] * inverseArray[i] % modP;
		}
		return factInv;
	}
}

class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}

yukicoder

結果

テストケース

ソースコード