#842080 (C++17(gcc12)) No.417 チューリップバブル

• 問題: No.417 チューリップバブル
• ユーザー: sahiya
• 提出日時: 2023-02-20 22:21:04
• 言語: C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 308 ms / 2,000 ms
• コード長: 2,332 bytes
• コンパイル時間: 7,024 ms
• コンパイル使用メモリ: 201,476 KB
• 最終ジャッジ日時: 2025-02-10 19:19:07
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
other	AC * 40

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ALL(x) (x).begin(), (x).end()
#define PC(x) __builtin_popcount(x)
#define PCL(x) __builtin_popcountll(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T>
bool chmax(T& a, const T& b)
{
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T& a, const T& b)
{
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
const double PI = 3.14159265358979323846;
const double PI2 = PI * 2.0;
const double EPS = 1E-09;
const ll MOD = 1E+09 + 7; // =998244353;
const ll INFL = 1E18;
const int INFI = 1E09;
const int MAX_N = 2E+02;
struct edge {
    int to, cost;
};
ll di[4] = { 0, -1, 0, 1 }, dj[4] = { 1, 0, -1, 0 };
int N, M, U[MAX_N + 1];
vector<edge> G[MAX_N + 1];
vector<int> dfs(int i, int par)
{
    vector dp(M + 1, -INFI);
    dp[0] = U[i];
    for (auto& e : G[i]) {
        if (e.to == par)
            continue;
        auto v = dfs(e.to, i);
        int c = e.cost;
        auto tmp = dp;
        for (int j = 0; j <= M; ++j) {
            for (int k = 0; k <= M; ++k) {
                if (j + k + 2 * c > M)
                    break;
                chmax(tmp[j + k + 2 * c], dp[j] + v[k]);
            }
        }
        swap(dp, tmp);
    }
    return dp;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> N >> M;
    for (int i = 0; i < N; ++i) {
        cin >> U[i];
    }
    for (int i = 1; i <= N - 1; ++i) {
        int a, b, c;
        cin >> a >> b >> c;
        G[a].push_back({ b, c });
        G[b].push_back({ a, c });
    }
    auto dp = dfs(0, -1);
    int ans = -INFI;
    for (int j = 0; j <= M; ++j) {
        chmax(ans, dp[j]);
    }
    cout << ans << "\n";
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX