結果
問題 | No.8046 yukicoderの過去問 |
ユーザー | みしあ |
提出日時 | 2021-10-22 08:31:08 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,825 bytes |
コンパイル時間 | 4,247 ms |
コンパイル使用メモリ | 265,376 KB |
実行使用メモリ | 13,760 KB |
最終ジャッジ日時 | 2024-09-22 09:11:30 |
合計ジャッジ時間 | 8,008 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,760 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 3 ms
6,944 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | AC | 3 ms
6,940 KB |
testcase_06 | TLE | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
ソースコード
#pragma region Macros #include <bits/stdc++.h> #if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG) #include <atcoder/all> #endif using namespace std; #define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i) #define REPR(i, n) for(int i=(n); i>=0; --i) #define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##_len; ++i) #define EACH(i, v) for(const auto& i : v) #define ALL(x) (x).begin(),(x).end() #define ALLR(x) (x).rbegin(),(x).rend() template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } template<class T>using vec = vector<T>; template<class T, class U>using umap = unordered_map<T, U>; template<class T>using uset = unordered_set<T>; using ll = long long; using ld = long double; using P = pair<ll, ll>; using T = tuple<ll, ll, ll>; using vl = vec<ll>; #define fi first #define se second #define el endl constexpr ll INF = numeric_limits<ll>::max()/2-1; #pragma endregion #pragma region IOMacros template<class T> istream &operator>>(istream &stream, vec<T>& o){REP(i, o.size())stream >> o[i];return stream;} template<class T> ostream &operator<<(ostream &stream, vec<T>& objs){REP(i, objs.size())stream << objs[i] << " ";stream << el;return stream;} #define I(T, ...) ;T __VA_ARGS__;__i(__VA_ARGS__); void __i() {} template<class T, class... Ts> void __i(T&& o, Ts&&... args){cin >> o;__i(forward<Ts>(args)...);} void O() {cout << el;} template<class T, class... Ts> void O(T&& o, Ts&&... args){cerr << o << " ";O(forward<Ts>(args)...);} #pragma endregion void Main(); int main(){ std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(15); Main(); return 0; } // mod Pのための型 #pragma region modint template<ll m> struct modint{ protected: ll v=0; public: //コンストラクタ modint(ll x=0){while(x<0)x+=m;v=x%m;} modint(const modint &r){v=r.val();} //算術演算子(単項) modint operator -(){return modint(-v);} modint& operator ++(){if(++v>=m)v-=m; return *this;} modint operator ++(int){modint t = *this; ++*this; return t;} modint& operator --(){if(--v<0)v+=m; return *this;} modint operator --(int){modint t = *this; --*this; return t;} //算術演算子(二項) friend modint operator +(const modint &l, const modint &r){return modint(l)+=r;} friend modint operator -(const modint &l, const modint &r){return modint(l)-=r;} friend modint operator *(const modint &l, const modint &r){return modint(l)*=r;} friend modint operator /(const modint &l, const modint &r){return modint(l)/=r;} // キャスト演算子 explicit operator int() const {return val();} explicit operator ll() const {return val();} //代入演算子 modint &operator +=(const modint &r){ v+=r.val(); if(v>=m)v-=m; return *this; } modint &operator -=(const modint &r){ if(v<r.val())v+=m; v-=r.val(); return *this; } modint &operator *=(const modint &r){ v=v*r.val()%m; return *this; } modint &operator /=(const modint &r){ v=v*r.inv().val()%m; return *this; } //等価比較演算子 friend bool operator ==(const modint &l, const modint& r){return l.val()==r.val();} friend bool operator <(const modint &l, const modint& r){return l.val()<r.val();} friend bool operator >(const modint &l, const modint& r){return l.val()>r.val();} friend bool operator !=(const modint &l, const modint& r){return l.val()!=r.val();} // 各種関数 int val() const{return v;} constexpr static ll mod(){return m;} static modint raw(ll x){modint r;r.v=x;return r;} modint inv() const{ ll a=v,b=m,u=1,v=0; while(b){ ll t=a/b; a-=t*b;swap(a,b); u-=t*v;swap(u,v); } u %= m; if (u < 0) u += m; return u; } modint pow(ll n) const{ modint ret = 1, x(v); while (n > 0) { if (n & 1) ret *= x; x *= x; n >>= 1; } return ret; } //入出力ストリーム friend istream &operator>>(istream &is,modint& x){ll t;is>>t;x=t;return (is);} friend ostream &operator<<(ostream &os,const modint& x){return os<<x.val();} }; using modint1000000007 = modint<1000000007>; using modint998244353 = modint<998244353>; #pragma endregion using mint = modint1000000007; void Main(){ I(ll, K); I(ll, N); vl X(N); cin >> X; vec<mint> DP(K+2); DP[0] = 1; REP(i, K){ if(DP[i].val() == 0) continue; REP(j, N){ ll t = i+X[j]; if(t > K) break; DP[t] += DP[i]; } } cout << DP[K] << el; //cerr << DP; }