#355031 (C++14) No.844 split game

• 問題: No.844 split game
• ユーザー: Tiramister
• 提出日時: 2019-06-28 22:09:35
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 130 ms / 2,000 ms
• コード長: 3,479 bytes
• コンパイル時間: 1,111 ms
• コンパイル使用メモリ: 117,700 KB
• 実行使用メモリ: 13,748 KB
• 最終ジャッジ日時: 2024-07-02 04:49:03
• 合計ジャッジ時間: 5,196 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
sample	AC * 4
other	AC * 56

ソースコード

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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <vector>
#include <string>
#include <tuple>
#include <set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
// others
#include <random>
#include <limits>
#include <functional>
#include <ctime>
#include <cassert>
// type alias
using lint = long long;
using ldouble = long double;
template <class T>
using greater_priority_queue = std::priority_queue<T, std::vector<T>, std::greater<T>>;
/* ----- class ----- */
template <class Cost = int>
struct Edge {
    int src, dst;
    Cost cost;
    Edge(int src = -1, int dst = -1, Cost cost = 1)
        : src(src), dst(dst), cost(cost){};
    bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }
};
template <class Cost = int>
using Edges = std::vector<Edge<Cost>>;
template <class Cost = int>
using Graph = std::vector<std::vector<Edge<Cost>>>;
/* ----- debug ----- */
#if __has_include("../setting/source/debug.hpp")
#include "../setting/source/debug.hpp"
#endif
/* ----- short functions ----- */
template <class T>
inline T sq(T a) { return a * a; }
template <class T>
inline T iceil(T n, T d) { return (n + d - 1) / d; }
template <class T>
T gcd(T a, T b) {
    while (b > 0) {
        a %= b;
        std::swap(a, b);
    }
    return a;
}
template <class T, class U>
T ipow(T b, U n) {
    T ret = 1;
    while (n > 0) {
        if (n & 1) ret *= b;
        n >>= 1;
        b *= b;
    }
    return ret;
}
// 0-indexed
template <class T, class U>
inline T kthbit(T a, U k) { return (a >> k) & 1; }
template <class T, class U>
inline T mask(T a, U k) { return a & ((1 << k) - 1); }
template <class T>
std::map<T, int> compress(std::vector<T>& v) {
    std::sort(v.begin(), v.end());
    v.erase(std::unique(v.begin(), v.end()), v.end());
    std::map<T, int> rev;
    for (int i = 0; i < v.size(); ++i) rev[v[i]] = i;
    return rev;
}
template <class T>
T Vec(T v) { return v; }
template <class T, class... Ts>
auto Vec(size_t l, Ts... ts) {
    return std::vector<decltype(Vec<T>(ts...))>(l, Vec<T>(ts...));
}
/* ----- constants ----- */
// const int INF = std::numeric_limits<int>::max() / 3;
const lint INF = std::numeric_limits<lint>::max() / 3;
// const ldouble PI = acos(-1);
// const ldouble EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));
using namespace std;
int main() {
    int N, M, A;
    cin >> N >> M >> A;
    vector<vector<pair<int, lint>>> segs(N);
    for (int i = 0; i < M; ++i) {
        int l, r;
        lint p;
        cin >> l >> r >> p;
        --l, --r;
        segs[l].emplace_back(r, p);
    }
    auto dp = Vec<lint>(N + 1, 2, -INF);
    dp[0][1] = 0;
    // dp[i][b] = [0, i]まで決定済み
    //            iの左に線が引かれて[いる/いない]ときの最適解
    for (int i = 0; i < N; ++i) {
        dp[i + 1][0] = max({dp[i + 1][0], dp[i][0], dp[i][1]});
        for (auto q : segs[i]) {
            lint cost = A * 2;
            if (q.first == N - 1) cost -= A;
            dp[q.first + 1][1] =
                max({dp[q.first + 1][1],
                     dp[i][0] + q.second - cost,
                     dp[i][1] + q.second - (cost - A)});
        }
    }
    cout << max(dp[N][0], dp[N][1]) << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX