結果
問題 | No.389 ロジックパズルの組み合わせ |
ユーザー | koyumeishi |
提出日時 | 2016-07-08 22:29:39 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 194 ms / 2,000 ms |
コード長 | 7,571 bytes |
コンパイル時間 | 1,094 ms |
コンパイル使用メモリ | 107,636 KB |
実行使用メモリ | 35,924 KB |
最終ジャッジ日時 | 2024-10-13 04:31:34 |
合計ジャッジ時間 | 15,292 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 148 ms
34,560 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 144 ms
34,432 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 147 ms
34,560 KB |
testcase_05 | AC | 1 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 149 ms
34,688 KB |
testcase_10 | AC | 149 ms
34,816 KB |
testcase_11 | AC | 147 ms
34,864 KB |
testcase_12 | AC | 147 ms
34,688 KB |
testcase_13 | AC | 171 ms
35,216 KB |
testcase_14 | AC | 156 ms
34,944 KB |
testcase_15 | AC | 148 ms
34,748 KB |
testcase_16 | AC | 153 ms
34,816 KB |
testcase_17 | AC | 152 ms
34,816 KB |
testcase_18 | AC | 194 ms
35,892 KB |
testcase_19 | AC | 144 ms
34,560 KB |
testcase_20 | AC | 140 ms
34,552 KB |
testcase_21 | AC | 140 ms
34,432 KB |
testcase_22 | AC | 139 ms
34,560 KB |
testcase_23 | AC | 139 ms
34,560 KB |
testcase_24 | AC | 142 ms
34,560 KB |
testcase_25 | AC | 156 ms
34,432 KB |
testcase_26 | AC | 152 ms
34,560 KB |
testcase_27 | AC | 147 ms
34,432 KB |
testcase_28 | AC | 147 ms
34,560 KB |
testcase_29 | AC | 152 ms
34,432 KB |
testcase_30 | AC | 152 ms
34,432 KB |
testcase_31 | AC | 155 ms
34,544 KB |
testcase_32 | AC | 180 ms
34,432 KB |
testcase_33 | AC | 165 ms
34,540 KB |
testcase_34 | AC | 146 ms
34,432 KB |
testcase_35 | AC | 145 ms
34,432 KB |
testcase_36 | AC | 141 ms
34,432 KB |
testcase_37 | AC | 147 ms
34,560 KB |
testcase_38 | AC | 150 ms
34,560 KB |
testcase_39 | AC | 144 ms
34,432 KB |
testcase_40 | AC | 148 ms
34,560 KB |
testcase_41 | AC | 138 ms
34,560 KB |
testcase_42 | AC | 145 ms
34,560 KB |
testcase_43 | AC | 145 ms
34,560 KB |
testcase_44 | AC | 144 ms
34,560 KB |
testcase_45 | AC | 148 ms
34,432 KB |
testcase_46 | AC | 143 ms
34,560 KB |
testcase_47 | AC | 141 ms
34,560 KB |
testcase_48 | AC | 142 ms
34,432 KB |
testcase_49 | AC | 51 ms
5,584 KB |
testcase_50 | AC | 4 ms
5,248 KB |
testcase_51 | AC | 5 ms
5,248 KB |
testcase_52 | AC | 12 ms
5,248 KB |
testcase_53 | AC | 6 ms
5,248 KB |
testcase_54 | AC | 14 ms
5,248 KB |
testcase_55 | AC | 3 ms
5,248 KB |
testcase_56 | AC | 5 ms
5,248 KB |
testcase_57 | AC | 24 ms
5,248 KB |
testcase_58 | AC | 43 ms
5,588 KB |
testcase_59 | AC | 32 ms
5,248 KB |
testcase_60 | AC | 16 ms
5,248 KB |
testcase_61 | AC | 69 ms
5,584 KB |
testcase_62 | AC | 16 ms
5,248 KB |
testcase_63 | AC | 46 ms
5,456 KB |
testcase_64 | AC | 12 ms
5,248 KB |
testcase_65 | AC | 8 ms
5,248 KB |
testcase_66 | AC | 14 ms
5,248 KB |
testcase_67 | AC | 14 ms
5,248 KB |
testcase_68 | AC | 14 ms
5,248 KB |
testcase_69 | AC | 142 ms
34,560 KB |
testcase_70 | AC | 145 ms
34,560 KB |
testcase_71 | AC | 141 ms
34,560 KB |
testcase_72 | AC | 151 ms
34,560 KB |
testcase_73 | AC | 144 ms
34,560 KB |
testcase_74 | AC | 144 ms
34,560 KB |
testcase_75 | AC | 142 ms
34,560 KB |
testcase_76 | AC | 146 ms
34,560 KB |
testcase_77 | AC | 145 ms
34,560 KB |
testcase_78 | AC | 149 ms
34,432 KB |
testcase_79 | AC | 149 ms
34,432 KB |
testcase_80 | AC | 152 ms
34,560 KB |
testcase_81 | AC | 144 ms
34,432 KB |
testcase_82 | AC | 147 ms
34,544 KB |
testcase_83 | AC | 150 ms
34,560 KB |
testcase_84 | AC | 151 ms
34,560 KB |
testcase_85 | AC | 146 ms
34,432 KB |
testcase_86 | AC | 147 ms
34,484 KB |
testcase_87 | AC | 147 ms
34,432 KB |
testcase_88 | AC | 145 ms
34,560 KB |
testcase_89 | AC | 159 ms
35,024 KB |
testcase_90 | AC | 170 ms
35,412 KB |
testcase_91 | AC | 189 ms
35,924 KB |
testcase_92 | AC | 152 ms
34,876 KB |
testcase_93 | AC | 172 ms
35,520 KB |
testcase_94 | AC | 140 ms
34,588 KB |
testcase_95 | AC | 172 ms
35,492 KB |
testcase_96 | AC | 169 ms
35,280 KB |
testcase_97 | AC | 173 ms
35,152 KB |
testcase_98 | AC | 149 ms
34,956 KB |
ソースコード
/* ### # ############# # ####################### ################################ ######################################### ############################################## # ##################################### # ###### ############################ ###### ########### ################### # ########## ################ ######### ############### #################### # #################### ####### ############## ######################## ######## ######### ######################## ########### ####### ######################## ############## # ####### ######################## ######################## ######################## ######################## ######################## ######################## ######################## ###################### ####################### ################### ################### ############## ############### ########## ########## ###### ###### ## ## # # # # # # # # # # # #### #### #### #### #### # # # # # ## # # # # # # #____# ## # #/ # # ## # # # # # # # #^^^^ # ## ###/# # # # #### #### ###/# #### # # ## */ #include <iostream> #include <vector> #include <cstdio> #include <sstream> #include <map> #include <string> #include <algorithm> #include <queue> #include <cmath> #include <functional> #include <set> #include <ctime> #include <random> #include <chrono> #include <cassert> using namespace std; namespace { using Integer = long long; //__int128; template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;} template<class T> istream& operator , (istream& is, T& val){ return is >> val;} template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;} template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;} template<class H> void print(const H& head){ cout << head; } template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); } template<class ... T> void println(const T& ... values){ print(values...); cout << endl; } template<class H> void eprint(const H& head){ cerr << head; } template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); } template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; } class range{ long long start_, end_, step_; public: struct range_iterator{ long long val, step_; range_iterator(long long v, long long step) : val(v), step_(step) {} long long operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(long long len) : start_(0), end_(len), step_(1) {} range(long long start, long long end) : start_(start), end_(end), step_(1) {} range(long long start, long long end, long long step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } }; string operator "" _s (const char* str, size_t size){ return move(string(str)); } constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);} constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);} constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); } inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()); template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); } string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; } } constexpr long long mod = 9_ten + 7; // nCk mod p, O(1) // precomputation O(size) class combination_mod{ const long long mod; const long long size; vector<long long> fact; //n! vector<long long> fact_inv; // (n!)^-1 void make_fact(){ fact[0] = 1; for(long long i=1; i<size; i++){ fact[i] = fact[i-1]*i % mod; } } void make_fact_inv(){ fact_inv[0] = fact_inv[1] = 1; for(long long i=2; i<size; i++){ fact_inv[i] = fact_inv[mod%i] * (mod - mod/i) % mod; // x ^ -1 } for(int i=2; i<size; i++){ fact_inv[i] = fact_inv[i-1] * fact_inv[i] % mod; // x! ^ -1 } } public: combination_mod(long long mod_, long long size_ = 2000000) : mod(mod_), size(size_+1){ fact.resize(size); fact_inv.resize(size); make_fact(); make_fact_inv(); } //nCk mod p O(1) long long comb(long long n, long long k){ if(k==0 || n==k) return 1; long long ret = fact[n] * fact_inv[k] % mod * fact_inv[n-k] % mod; return ret; } }; int main(){ int m; cin >> m; vector<int> h; int tmp; while(cin >> tmp){ h.push_back(tmp); } if(accumulate(h.begin(), h.end(), 0) + h.size() - 1 > m){ println("NA"); return 0; } if(accumulate(h.begin(), h.end(), 0) == 0){ println(1); return 0; } int r = m - accumulate(h.begin(), h.end(), 0) - h.size() + 1; combination_mod c(mod, 2000000); println( c.comb(h.size() + r, h.size()) ); return 0; }