結果
問題 | No.389 ロジックパズルの組み合わせ |
ユーザー | freecss00 |
提出日時 | 2020-02-27 01:47:02 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 213 ms / 2,000 ms |
コード長 | 3,273 bytes |
コンパイル時間 | 1,715 ms |
コンパイル使用メモリ | 168,860 KB |
実行使用メモリ | 153,908 KB |
最終ジャッジ日時 | 2024-04-21 16:43:21 |
合計ジャッジ時間 | 11,344 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 5 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 147 ms
105,472 KB |
testcase_05 | AC | 19 ms
16,384 KB |
testcase_06 | AC | 69 ms
62,672 KB |
testcase_07 | AC | 191 ms
149,744 KB |
testcase_08 | AC | 70 ms
67,348 KB |
testcase_09 | AC | 156 ms
127,116 KB |
testcase_10 | AC | 26 ms
22,172 KB |
testcase_11 | AC | 163 ms
128,484 KB |
testcase_12 | AC | 18 ms
13,896 KB |
testcase_13 | AC | 213 ms
153,244 KB |
testcase_14 | AC | 30 ms
24,320 KB |
testcase_15 | AC | 28 ms
24,320 KB |
testcase_16 | AC | 64 ms
57,344 KB |
testcase_17 | AC | 129 ms
89,036 KB |
testcase_18 | AC | 145 ms
103,576 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 2 ms
5,376 KB |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 2 ms
5,376 KB |
testcase_31 | AC | 2 ms
5,376 KB |
testcase_32 | AC | 2 ms
5,376 KB |
testcase_33 | AC | 2 ms
5,376 KB |
testcase_34 | AC | 2 ms
5,376 KB |
testcase_35 | AC | 2 ms
5,376 KB |
testcase_36 | AC | 2 ms
5,376 KB |
testcase_37 | AC | 2 ms
5,376 KB |
testcase_38 | AC | 2 ms
5,376 KB |
testcase_39 | AC | 2 ms
5,376 KB |
testcase_40 | AC | 2 ms
5,376 KB |
testcase_41 | AC | 2 ms
5,376 KB |
testcase_42 | AC | 2 ms
5,376 KB |
testcase_43 | AC | 2 ms
5,376 KB |
testcase_44 | AC | 2 ms
5,376 KB |
testcase_45 | AC | 2 ms
5,376 KB |
testcase_46 | AC | 2 ms
5,376 KB |
testcase_47 | AC | 2 ms
5,376 KB |
testcase_48 | AC | 2 ms
5,376 KB |
testcase_49 | AC | 150 ms
109,040 KB |
testcase_50 | AC | 37 ms
33,508 KB |
testcase_51 | AC | 16 ms
13,508 KB |
testcase_52 | AC | 160 ms
123,392 KB |
testcase_53 | AC | 38 ms
33,152 KB |
testcase_54 | AC | 197 ms
148,576 KB |
testcase_55 | AC | 30 ms
26,624 KB |
testcase_56 | AC | 15 ms
11,264 KB |
testcase_57 | AC | 90 ms
76,400 KB |
testcase_58 | AC | 191 ms
138,204 KB |
testcase_59 | AC | 159 ms
108,764 KB |
testcase_60 | AC | 51 ms
40,948 KB |
testcase_61 | AC | 210 ms
146,636 KB |
testcase_62 | AC | 93 ms
81,408 KB |
testcase_63 | AC | 148 ms
110,880 KB |
testcase_64 | AC | 168 ms
133,120 KB |
testcase_65 | AC | 30 ms
24,832 KB |
testcase_66 | AC | 40 ms
31,360 KB |
testcase_67 | AC | 92 ms
82,048 KB |
testcase_68 | AC | 197 ms
144,640 KB |
testcase_69 | AC | 132 ms
110,484 KB |
testcase_70 | AC | 84 ms
79,748 KB |
testcase_71 | AC | 52 ms
49,056 KB |
testcase_72 | AC | 165 ms
132,352 KB |
testcase_73 | AC | 57 ms
54,784 KB |
testcase_74 | AC | 53 ms
51,712 KB |
testcase_75 | AC | 53 ms
52,480 KB |
testcase_76 | AC | 82 ms
77,792 KB |
testcase_77 | AC | 83 ms
77,976 KB |
testcase_78 | AC | 32 ms
30,936 KB |
testcase_79 | AC | 48 ms
43,880 KB |
testcase_80 | AC | 31 ms
28,204 KB |
testcase_81 | AC | 11 ms
10,240 KB |
testcase_82 | AC | 150 ms
124,544 KB |
testcase_83 | AC | 66 ms
61,056 KB |
testcase_84 | AC | 35 ms
32,256 KB |
testcase_85 | AC | 179 ms
140,880 KB |
testcase_86 | AC | 156 ms
126,256 KB |
testcase_87 | AC | 16 ms
13,696 KB |
testcase_88 | AC | 3 ms
5,376 KB |
testcase_89 | AC | 82 ms
70,272 KB |
testcase_90 | AC | 212 ms
153,908 KB |
testcase_91 | AC | 159 ms
114,432 KB |
testcase_92 | AC | 38 ms
32,016 KB |
testcase_93 | AC | 137 ms
105,284 KB |
testcase_94 | AC | 121 ms
102,784 KB |
testcase_95 | AC | 93 ms
74,228 KB |
testcase_96 | AC | 205 ms
150,976 KB |
testcase_97 | AC | 170 ms
129,264 KB |
testcase_98 | AC | 168 ms
131,164 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define REP(i,m,n) for(int i=(m); i<(int)(n); i++) #define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--) #define rep(i,n) REP(i,0,n) #define rrep(i,n) RREP(i,0,n) #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() #define aut(r,v) __typeof(v) r = (v) #define each(it,o) for(aut(it,(o).begin()); it!=(o).end(); ++it) #define reach(it,o) for(aut(it,(o).rbegin()); it!=(o).rend(); ++it) #define fi first #define se second #define debug(...) {cerr<<"[L"<<__LINE__<<"] "; _debug(__VA_ARGS__);} template<typename T1, typename T2> ostream& operator<<(ostream& o, const pair<T1, T2>& p) {return o<<"("<<p.first<<", "<<p.second<<")";} template<typename T>string join(const vector<T>&v, string del=", ") {stringstream s;rep(i,v.size())s<<del<<v[i];return s.str().substr(del.size());} template<typename T>ostream& operator<<(ostream& o, const vector<T>&v) {if(v.size())o<<"["<<join(v)<<"]";return o;} template<typename T>ostream& operator<<(ostream& o, const vector<vector<T> >&vv) {int l=vv.size();if(l){o<<endl;rep(i,l){o<<(i==0?"[ ":",\n ")<<vv[i]<<(i==l-1?" ]":"");}}return o;} template<typename T>ostream& operator<<(ostream& o, const set<T>& st) {vector<T> v(st.begin(),st.end());o<<"{ "<<join(v)<<" }";return o;} template<typename T1, typename T2>ostream& operator<<(ostream& o, const map<T1, T2>& m) {each(p,m){o<<(p==m.begin()?"{ ":",\n ")<<*p<<(p==--m.end()?" }":"");}return o;} inline void _debug(){cerr<<endl;} template<class First, class... Rest> void _debug(const First& first, const Rest&... rest){cerr<<first<<" ";_debug(rest...);} typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ll> vl; typedef vector<vl> vvl; const double PI = (1*acos(0.0)); const double EPS = 1e-9; const ll INF = 0x3f3f3f3f; const ll INFL = 0x3f3f3f3f3f3f3f3fLL; const ll mod = 1e9 + 7; inline void finput(string filename) { freopen(filename.c_str(), "r", stdin); } ll mod_pow(ll x, ll n){ ll v = 1; for(; n; x=x*x%mod, n>>=1) if(n & 1) v = v * x % mod; return v; } ll mod_inv(ll x){ return mod_pow(x, mod-2); } struct Factorial{ vector<ll> fact; vector<ll> factinv; Factorial(int n){ fact = vector<ll>(n+1); factinv = vector<ll>(n+1); fact[0] = 1; REP(i,1,n+1) fact[i] = fact[i-1] * i % mod; factinv[n] = mod_inv(fact[n]); RREP(i,1,n+1) factinv[i-1] = factinv[i] * i % mod; } ll C(int n, int k){ if(k<0 || k>n) return 0; return fact[n] * factinv[n-k] % mod * factinv[k] % mod; } ll P(int n, int k){ if(k<0 || k>n) return 0; return fact[n] * factinv[n-k] % mod; } ll H(int n, int k){ if(n==0 && k==0) return 1; return C(n+k-1, k); } }; int main(){ ios_base::sync_with_stdio(0); // finput("./input"); int m; cin >> m; Factorial fa(10*m); vi H; int h; while(cin>>h){ H.push_back(h); } if(H[0] == 0){ cout << 1 << endl; } else{ int k = H.size(); int n = m - accumulate(all(H), 0) - (k-1); ll ans = fa.H(k+1,n); if(ans == 0) cout << "NA" << endl; else cout << ans << endl; } return 0; }