#102140 (C++14) No.389 ロジックパズルの組み合わせ

• 問題: No.389 ロジックパズルの組み合わせ
• ユーザー: anta
• 提出日時: 2016-07-08 22:51:47
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 16 ms / 2,000 ms
• コード長: 5,437 bytes
• コンパイル時間: 1,695 ms
• コンパイル使用メモリ: 171,944 KB
• 実行使用メモリ: 11,400 KB
• 最終ジャッジ日時: 2023-08-03 08:48:45
• 合計ジャッジ時間: 5,295 ms
• ジャッジサーバーID （参考情報）: judge15 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,380 KB
testcase_01	AC	1 ms; 4,380 KB
testcase_02	AC	2 ms; 4,376 KB
testcase_03	AC	2 ms; 4,376 KB
testcase_04	AC	10 ms; 8,060 KB
testcase_05	AC	2 ms; 4,376 KB
testcase_06	AC	2 ms; 4,380 KB
testcase_07	AC	2 ms; 4,380 KB
testcase_08	AC	1 ms; 4,376 KB
testcase_09	AC	13 ms; 9,596 KB
testcase_10	AC	4 ms; 4,380 KB
testcase_11	AC	14 ms; 9,744 KB
testcase_12	AC	3 ms; 4,376 KB
testcase_13	AC	16 ms; 11,400 KB
testcase_14	AC	4 ms; 4,416 KB
testcase_15	AC	4 ms; 4,384 KB
testcase_16	AC	7 ms; 6,116 KB
testcase_17	AC	11 ms; 7,700 KB
testcase_18	AC	15 ms; 9,388 KB
testcase_19	AC	1 ms; 4,376 KB
testcase_20	AC	2 ms; 4,376 KB
testcase_21	AC	2 ms; 4,376 KB
testcase_22	AC	2 ms; 4,380 KB
testcase_23	AC	2 ms; 4,376 KB
testcase_24	AC	2 ms; 4,376 KB
testcase_25	AC	2 ms; 4,380 KB
testcase_26	AC	1 ms; 4,376 KB
testcase_27	AC	2 ms; 4,380 KB
testcase_28	AC	2 ms; 4,380 KB
testcase_29	AC	1 ms; 4,380 KB
testcase_30	AC	2 ms; 4,376 KB
testcase_31	AC	1 ms; 4,376 KB
testcase_32	AC	1 ms; 4,380 KB
testcase_33	AC	1 ms; 4,380 KB
testcase_34	AC	1 ms; 4,380 KB
testcase_35	AC	2 ms; 4,376 KB
testcase_36	AC	1 ms; 4,376 KB
testcase_37	AC	1 ms; 4,376 KB
testcase_38	AC	2 ms; 4,380 KB
testcase_39	AC	2 ms; 4,380 KB
testcase_40	AC	1 ms; 4,380 KB
testcase_41	AC	2 ms; 4,376 KB
testcase_42	AC	1 ms; 4,380 KB
testcase_43	AC	1 ms; 4,380 KB
testcase_44	AC	1 ms; 4,376 KB
testcase_45	AC	1 ms; 4,380 KB
testcase_46	AC	1 ms; 4,376 KB
testcase_47	AC	1 ms; 4,376 KB
testcase_48	AC	2 ms; 4,376 KB
testcase_49	AC	6 ms; 5,176 KB
testcase_50	AC	2 ms; 4,380 KB
testcase_51	AC	2 ms; 4,380 KB
testcase_52	AC	3 ms; 4,380 KB
testcase_53	AC	2 ms; 4,376 KB
testcase_54	AC	2 ms; 4,376 KB
testcase_55	AC	1 ms; 4,380 KB
testcase_56	AC	2 ms; 4,380 KB
testcase_57	AC	3 ms; 4,376 KB
testcase_58	AC	6 ms; 5,112 KB
testcase_59	AC	4 ms; 4,376 KB
testcase_60	AC	3 ms; 4,376 KB
testcase_61	AC	8 ms; 4,992 KB
testcase_62	AC	3 ms; 4,376 KB
testcase_63	AC	6 ms; 5,056 KB
testcase_64	AC	2 ms; 4,376 KB
testcase_65	AC	2 ms; 4,380 KB
testcase_66	AC	3 ms; 4,380 KB
testcase_67	AC	3 ms; 4,376 KB
testcase_68	AC	3 ms; 4,376 KB
testcase_69	AC	11 ms; 8,204 KB
testcase_70	AC	9 ms; 7,128 KB
testcase_71	AC	6 ms; 5,476 KB
testcase_72	AC	13 ms; 9,384 KB
testcase_73	AC	7 ms; 5,680 KB
testcase_74	AC	6 ms; 5,296 KB
testcase_75	AC	6 ms; 5,472 KB
testcase_76	AC	9 ms; 6,616 KB
testcase_77	AC	9 ms; 6,696 KB
testcase_78	AC	4 ms; 4,380 KB
testcase_79	AC	6 ms; 5,152 KB
testcase_80	AC	4 ms; 4,420 KB
testcase_81	AC	3 ms; 4,376 KB
testcase_82	AC	13 ms; 8,928 KB
testcase_83	AC	7 ms; 5,880 KB
testcase_84	AC	4 ms; 4,380 KB
testcase_85	AC	14 ms; 10,016 KB
testcase_86	AC	12 ms; 9,304 KB
testcase_87	AC	3 ms; 4,376 KB
testcase_88	AC	1 ms; 4,380 KB
testcase_89	AC	9 ms; 6,840 KB
testcase_90	AC	16 ms; 11,252 KB
testcase_91	AC	16 ms; 9,656 KB
testcase_92	AC	5 ms; 4,704 KB
testcase_93	AC	14 ms; 9,136 KB
testcase_94	AC	10 ms; 8,004 KB
testcase_95	AC	11 ms; 7,660 KB
testcase_96	AC	16 ms; 10,928 KB
testcase_97	AC	15 ms; 10,248 KB
testcase_98	AC	15 ms; 9,980 KB

ソースコード

#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }


template<int MOD>
struct ModInt {
	static const int Mod = MOD;
	unsigned x;
	ModInt() : x(0) {}
	ModInt(signed sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	ModInt(signed long long sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	int get() const { return (int)x; }

	ModInt &operator+=(ModInt that) { if((x += that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator-=(ModInt that) { if((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
	ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }

	ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
	ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
	ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
	ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }

	ModInt inverse() const {
		signed a = x, b = MOD, u = 1, v = 0;
		while(b) {
			signed t = a / b;
			a -= t * b; std::swap(a, b);
			u -= t * v; std::swap(u, v);
		}
		if(u < 0) u += Mod;
		ModInt res; res.x = (unsigned)u;
		return res;
	}
};
typedef ModInt<1000000007> mint;

vector<mint> fact, factinv;
void nCr_computeFactinv(int N) {
	N = min(N, mint::Mod - 1);
	fact.resize(N + 1); factinv.resize(N + 1);
	fact[0] = 1;
	rer(i, 1, N) fact[i] = fact[i - 1] * i;
	factinv[N] = fact[N].inverse();
	for(int i = N; i >= 1; i --) factinv[i - 1] = factinv[i] * i;
}
mint nCr(int n, int r) {
	if(n >= mint::Mod)
		return nCr(n % mint::Mod, r % mint::Mod) * nCr(n / mint::Mod, r / mint::Mod);
	return r > n ? 0 : fact[n] * factinv[n - r] * factinv[r];
}

class FastInput {
	bool _end;
public:
	FastInput() : _end(false) {}

	operator void*() { return _end ? 0 : (void*)this; }

	template<typename T>
	void read_unsigned(T *res) {
		T x = 0;
		for(char c = skip(); '0' <= c && c <= '9'; c = gc())
			x = x * 10 + (c - '0');
		*res = x;
	}

	template<typename T>
	void read_signed(T *res) {
		char c = skip();
		bool sign = false;
		if(c == '-') sign = true, c = gc();
		T x = 0;
		for(; '0' <= c && c <= '9'; c = gc())
			x = x * 10 + (c - '0');
		*res = !sign ? x : -x;
	}

	void read_c_string(char *str, int *len) {
		int n = 0;
		for(char c = skip(); !is_delim(c); c = gc())
			str[n ++] = c;
		str[n] = 0;
		*len = n;
	}

	void read_string(std::string *str) {
		str->clear();
		for(char c = skip(); !is_delim(c); c = gc())
			*str += c;
	}

	void read_line(std::string *str) {
		str->clear();
		for(char c = gc(); c != '\n'; c = gc())
			*str += c;
		if(!str->empty() && (*str)[str->size() - 1] == '\r') str->resize(str->size() - 1);
	}

	void read_double(double *res) {
		std::string buf;
		read_string(&buf);
		sscanf(buf.c_str(), "%lf", res);
	}

	void read_char(char *res) {
		*res = skip();
	}

	void read_string_buf(char *res, int n) {
		*res = skip();
	}

	FastInput &operator()(char &res) { read_char(&res); return *this; }
	FastInput &operator()(int &res) { read_signed(&res); return *this; }
	FastInput &operator()(unsigned &res) { read_unsigned(&res); return *this; }
	FastInput &operator()(long long &res) { read_signed(&res); return *this; }
	FastInput &operator()(unsigned long long &res) { read_unsigned(&res); return *this; }
	FastInput &operator()(char *res) { int len; read_c_string(res, &len); return *this; }
	FastInput &operator()(std::string &res) { read_string(&res); return *this; }
	FastInput &operator()(double &res) { read_double(&res); return *this; }

	template<typename T1, typename T2>
	FastInput &operator()(T1 &res1, T2 &res2) {
		return operator()(res1)(res2);
	}
	template<typename T1, typename T2, typename T3>
	FastInput &operator()(T1 &res1, T2 &res2, T3 &res3) {
		return operator()(res1)(res2)(res3);
	}

	template<typename T>
	FastInput &a(T *a, int n) {
		for(int i = 0; i < n; ++ i)
			operator()(a[i]);
		return *this;
	}

	template<typename T>
	FastInput &operator()(vector<T> &v) {
		for(size_t i = 0; i < v.size(); ++ i)
			operator()(v[i]);
		return *this;
	}

private:
	static char gc() {
#if defined(__GNUC__) && !defined(__MINGW32__)
		return (char)getchar_unlocked();
#elif defined(_MSC_VER)
		return (char)_getchar_nolock();
#else
		return (char)getchar();
#endif
	}

	static bool is_delim(char c) {
		return c == ' ' || c == '\t' || c == '\n' || c == '\r' || c == EOF;
	}

	char skip() {
		if(_end) return EOF;
		char c;
		for(c = gc(); c != -1 && is_delim(c); c = gc());
		if(c == EOF) _end = true;
		return c;
	}
} in;

int main() {
	int N;
	in(N);
	vector<int> H;
	{
		int h;
		while(in(h))
			H.push_back(h);
	}
	int sum = accumulate(H.begin(), H.end(), 0);
	if(sum == 0) {
		puts("1");
	} else if(sum + (int)H.size() - 1 > N) {
		puts("NA");
	} else {
		nCr_computeFactinv(N);
		mint ans = nCr(N - sum + 1, H.size());
		printf("%d\n", ans.get());
	}
	return 0;
}