結果
| 問題 | No.389 ロジックパズルの組み合わせ |
| ユーザー |
 koyumeishi
|
| 提出日時 | 2016-07-08 22:29:39 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.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 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 99 |
ソースコード
/*### ############## ################################################################################################################################################ ##################################### ####### ############################ ################# ################### # ########################## ######### ################################### # ########################### ############## ################################ ######### ################################### ####### ###################################### # ####### ################################################ ################################################ ################################################ ############################################## ########################################## ################################# ######################### ################ ######## ### ## # ## # # # # # #### #### #### #### ##### # # # # ## # # # # # # #____# ### #/ # # ## # # # # # # # #^^^^ ### ###/# # # # #### #### ###/# #### ####*/#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-indexedmt19937 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!)^-1void 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;}