結果
問題 | No.196 典型DP (1) |
ユーザー | ゆにぽけ |
提出日時 | 2023-10-02 22:43:46 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 3,778 bytes |
コンパイル時間 | 1,193 ms |
コンパイル使用メモリ | 119,840 KB |
実行使用メモリ | 50,944 KB |
最終ジャッジ日時 | 2024-07-26 13:55:45 |
合計ジャッジ時間 | 3,635 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 8 ms
19,200 KB |
testcase_01 | AC | 8 ms
19,072 KB |
testcase_02 | AC | 8 ms
19,200 KB |
testcase_03 | AC | 7 ms
19,200 KB |
testcase_04 | AC | 7 ms
19,204 KB |
testcase_05 | AC | 8 ms
19,176 KB |
testcase_06 | AC | 8 ms
19,188 KB |
testcase_07 | AC | 8 ms
19,200 KB |
testcase_08 | AC | 9 ms
19,200 KB |
testcase_09 | AC | 7 ms
19,072 KB |
testcase_10 | AC | 7 ms
19,200 KB |
testcase_11 | AC | 8 ms
19,328 KB |
testcase_12 | AC | 7 ms
19,196 KB |
testcase_13 | AC | 8 ms
19,220 KB |
testcase_14 | AC | 8 ms
19,328 KB |
testcase_15 | AC | 11 ms
19,328 KB |
testcase_16 | AC | 10 ms
19,416 KB |
testcase_17 | AC | 10 ms
19,424 KB |
testcase_18 | AC | 12 ms
19,492 KB |
testcase_19 | AC | 16 ms
19,708 KB |
testcase_20 | AC | 15 ms
19,380 KB |
testcase_21 | AC | 15 ms
19,460 KB |
testcase_22 | AC | 18 ms
19,584 KB |
testcase_23 | AC | 26 ms
32,896 KB |
testcase_24 | AC | 25 ms
27,776 KB |
testcase_25 | AC | 26 ms
27,264 KB |
testcase_26 | AC | 42 ms
50,816 KB |
testcase_27 | AC | 43 ms
50,772 KB |
testcase_28 | AC | 41 ms
50,708 KB |
testcase_29 | AC | 41 ms
50,688 KB |
testcase_30 | AC | 43 ms
50,944 KB |
testcase_31 | AC | 21 ms
19,204 KB |
testcase_32 | AC | 23 ms
19,160 KB |
testcase_33 | AC | 20 ms
19,292 KB |
testcase_34 | AC | 21 ms
19,228 KB |
testcase_35 | AC | 20 ms
19,232 KB |
testcase_36 | AC | 19 ms
19,328 KB |
testcase_37 | AC | 16 ms
19,244 KB |
testcase_38 | AC | 20 ms
19,208 KB |
testcase_39 | AC | 20 ms
19,328 KB |
testcase_40 | AC | 23 ms
19,248 KB |
testcase_41 | AC | 8 ms
19,156 KB |
testcase_42 | AC | 8 ms
19,200 KB |
testcase_43 | AC | 8 ms
19,072 KB |
ソースコード
#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cassert> #include<cmath> #include<ctime> #include<iomanip> #include<numeric> #include<stack> #include<queue> #include<map> #include<set> #include<bitset> #include<random> using namespace std; template<long long MOD>struct Modint { private: unsigned int value; public: constexpr Modint(const long long x = 0) noexcept { long long y = x; if(y < 0 || y >= MOD) { y %= MOD; if(y < 0) y += MOD; } value = (unsigned int)y; } constexpr unsigned int &val() noexcept {return value;} constexpr Modint operator+(const Modint &other) noexcept { Modint tmp = *this; return tmp += other; } constexpr Modint operator-(const Modint &other) noexcept { Modint tmp = *this; return tmp -= other; } constexpr Modint operator*(const Modint &other) noexcept { Modint tmp = *this; return tmp *= other; } constexpr Modint operator/(const Modint &other) noexcept { Modint tmp = *this; return tmp /= other; } constexpr Modint &operator+=(const Modint &other) noexcept { value += other.value; if(value >= MOD) value -= MOD; return *this; } constexpr Modint &operator-=(const Modint &other) noexcept { unsigned long long x = value; if(x < other.value) x += MOD; x -= other.value; value = (unsigned int) x; return *this; } constexpr Modint &operator*=(const Modint &other) noexcept { unsigned long long x = value; x *= other.value; value = (unsigned int)(x%MOD); return *this; } constexpr Modint &operator/=(const Modint &other) noexcept { return *this = *this * other.inverse(); } constexpr Modint power(long long ex) const noexcept { assert(ex >= 0); Modint p = *this,res = 1; while(ex) { if(ex & 1) res *= p; p *= p; ex >>= 1; } return res; } constexpr Modint inverse() const noexcept { assert(value); long long a = value,b = MOD,x = 1,y = 0; while(b) { long long q = a/b; a -= q*b; swap(a,b); x -= q*y; swap(x,y); } return Modint(x); } constexpr Modint &operator++(int) noexcept {return *this += 1;} constexpr Modint &operator--(int) noexcept {return *this -= 1;} constexpr bool operator==(const Modint &other){return value == other.value;} constexpr bool operator!=(const Modint &other){return value != other.value;} template<long long mod> friend ostream &operator<<(ostream &os,const Modint<mod> &x); }; template<long long mod> ostream &operator<<(ostream &os,const Modint<mod> &x){os << x.value; return os;} //using mint = Modint<998244353>; using mint = Modint<1000000007>; int N,K,ch[2000]; vector<int> G[2000]; mint dp[2000][2001]; void dfs(int u,int p) { ch[u] = 1; mint ep[2][2001]; int now = 0; for(int i = 0;i <= N;i++) ep[now][i] = 0; ep[now][0] = 1; for(int v:G[u]) if(v != p) { dfs(v,u); int nxt = 1-now; for(int i = 0;i <= ch[u]+ch[v];i++) ep[nxt][i] = 0; for(int i = 0;i < ch[u];i++)for(int j = 0;j <= ch[v];j++) ep[nxt][i+j] += ep[now][i]*dp[v][j]; now = nxt; ch[u] += ch[v]; } for(int i = 0;i <= N;i++) dp[u][i] = ep[now][i]; dp[u][ch[u]] = 1; } void solve() { cin >> N >> K; for(int i = 1;i < N;i++) { int u,v; cin >> u >> v; G[u].push_back(v); G[v].push_back(u); } dfs(0,-1); cout << dp[0][K] << "\n"; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int T = 1; //cin >> T; while(T--) solve(); }