結果

問題 No.389 ロジックパズルの組み合わせ
ユーザー ぴろずぴろず
提出日時 2016-07-08 22:33:38
言語 Java21
(openjdk 21)
結果
AC  
実行時間 235 ms / 2,000 ms
コード長 5,160 bytes
コンパイル時間 2,489 ms
コンパイル使用メモリ 79,268 KB
実行使用メモリ 63,496 KB
最終ジャッジ日時 2024-10-13 04:35:16
合計ジャッジ時間 14,690 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,028 KB
testcase_01 AC 53 ms
50,108 KB
testcase_02 AC 53 ms
50,028 KB
testcase_03 AC 53 ms
50,212 KB
testcase_04 AC 128 ms
63,136 KB
testcase_05 AC 51 ms
37,076 KB
testcase_06 AC 49 ms
37,120 KB
testcase_07 AC 48 ms
36,644 KB
testcase_08 AC 50 ms
36,760 KB
testcase_09 AC 181 ms
57,860 KB
testcase_10 AC 114 ms
41,888 KB
testcase_11 AC 185 ms
57,700 KB
testcase_12 AC 102 ms
40,572 KB
testcase_13 AC 216 ms
61,388 KB
testcase_14 AC 128 ms
44,360 KB
testcase_15 AC 115 ms
42,436 KB
testcase_16 AC 141 ms
48,000 KB
testcase_17 AC 156 ms
52,148 KB
testcase_18 AC 212 ms
54,908 KB
testcase_19 AC 50 ms
36,668 KB
testcase_20 AC 54 ms
36,984 KB
testcase_21 AC 50 ms
37,052 KB
testcase_22 AC 49 ms
37,048 KB
testcase_23 AC 49 ms
37,112 KB
testcase_24 AC 49 ms
36,996 KB
testcase_25 AC 49 ms
36,824 KB
testcase_26 AC 50 ms
36,980 KB
testcase_27 AC 50 ms
36,680 KB
testcase_28 AC 50 ms
36,524 KB
testcase_29 AC 50 ms
37,064 KB
testcase_30 AC 50 ms
36,684 KB
testcase_31 AC 54 ms
37,020 KB
testcase_32 AC 50 ms
36,768 KB
testcase_33 AC 49 ms
37,104 KB
testcase_34 AC 48 ms
36,936 KB
testcase_35 AC 50 ms
37,172 KB
testcase_36 AC 49 ms
36,724 KB
testcase_37 AC 49 ms
36,900 KB
testcase_38 AC 51 ms
36,984 KB
testcase_39 AC 47 ms
37,248 KB
testcase_40 AC 52 ms
36,572 KB
testcase_41 AC 49 ms
37,048 KB
testcase_42 AC 50 ms
36,768 KB
testcase_43 AC 50 ms
37,100 KB
testcase_44 AC 50 ms
37,016 KB
testcase_45 AC 50 ms
37,056 KB
testcase_46 AC 53 ms
36,516 KB
testcase_47 AC 49 ms
37,176 KB
testcase_48 AC 49 ms
36,796 KB
testcase_49 AC 137 ms
44,224 KB
testcase_50 AC 80 ms
38,396 KB
testcase_51 AC 77 ms
37,932 KB
testcase_52 AC 91 ms
39,468 KB
testcase_53 AC 85 ms
38,644 KB
testcase_54 AC 92 ms
39,396 KB
testcase_55 AC 52 ms
36,668 KB
testcase_56 AC 80 ms
38,448 KB
testcase_57 AC 107 ms
40,620 KB
testcase_58 AC 134 ms
44,180 KB
testcase_59 AC 121 ms
41,996 KB
testcase_60 AC 100 ms
39,924 KB
testcase_61 AC 143 ms
44,648 KB
testcase_62 AC 99 ms
39,864 KB
testcase_63 AC 134 ms
44,384 KB
testcase_64 AC 95 ms
39,796 KB
testcase_65 AC 87 ms
39,304 KB
testcase_66 AC 96 ms
40,060 KB
testcase_67 AC 94 ms
40,016 KB
testcase_68 AC 94 ms
39,416 KB
testcase_69 AC 129 ms
53,908 KB
testcase_70 AC 107 ms
49,516 KB
testcase_71 AC 90 ms
45,116 KB
testcase_72 AC 142 ms
57,468 KB
testcase_73 AC 97 ms
46,064 KB
testcase_74 AC 96 ms
45,248 KB
testcase_75 AC 93 ms
45,612 KB
testcase_76 AC 107 ms
49,272 KB
testcase_77 AC 107 ms
49,224 KB
testcase_78 AC 81 ms
43,708 KB
testcase_79 AC 88 ms
44,028 KB
testcase_80 AC 80 ms
43,208 KB
testcase_81 AC 59 ms
38,272 KB
testcase_82 AC 137 ms
56,576 KB
testcase_83 AC 99 ms
46,904 KB
testcase_84 AC 82 ms
43,616 KB
testcase_85 AC 146 ms
58,628 KB
testcase_86 AC 136 ms
56,400 KB
testcase_87 AC 60 ms
38,348 KB
testcase_88 AC 52 ms
36,660 KB
testcase_89 AC 157 ms
49,212 KB
testcase_90 AC 235 ms
63,496 KB
testcase_91 AC 221 ms
56,552 KB
testcase_92 AC 139 ms
45,580 KB
testcase_93 AC 210 ms
55,584 KB
testcase_94 AC 133 ms
52,940 KB
testcase_95 AC 183 ms
50,492 KB
testcase_96 AC 231 ms
63,012 KB
testcase_97 AC 206 ms
58,432 KB
testcase_98 AC 191 ms
58,224 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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) {}}
}

0