結果
問題 | 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 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
7,168 KB |
testcase_01 | AC | 43 ms
11,392 KB |
testcase_02 | AC | 95 ms
8,704 KB |
testcase_03 | AC | 72 ms
11,008 KB |
testcase_04 | AC | 37 ms
6,784 KB |
testcase_05 | AC | 113 ms
11,648 KB |
testcase_06 | AC | 35 ms
6,912 KB |
testcase_07 | AC | 33 ms
9,856 KB |
testcase_08 | AC | 19 ms
5,760 KB |
testcase_09 | AC | 81 ms
6,272 KB |
testcase_10 | AC | 120 ms
10,624 KB |
testcase_11 | AC | 119 ms
13,056 KB |
testcase_12 | AC | 77 ms
6,016 KB |
testcase_13 | AC | 48 ms
5,376 KB |
testcase_14 | AC | 52 ms
9,088 KB |
testcase_15 | AC | 130 ms
13,696 KB |
testcase_16 | AC | 130 ms
13,684 KB |
testcase_17 | AC | 129 ms
13,696 KB |
testcase_18 | AC | 129 ms
13,748 KB |
testcase_19 | AC | 129 ms
13,696 KB |
testcase_20 | AC | 130 ms
13,696 KB |
testcase_21 | AC | 128 ms
13,696 KB |
testcase_22 | AC | 130 ms
13,696 KB |
testcase_23 | AC | 5 ms
5,376 KB |
testcase_24 | AC | 10 ms
5,376 KB |
testcase_25 | AC | 6 ms
5,376 KB |
testcase_26 | AC | 4 ms
5,376 KB |
testcase_27 | AC | 8 ms
5,376 KB |
testcase_28 | AC | 4 ms
5,376 KB |
testcase_29 | AC | 8 ms
5,376 KB |
testcase_30 | AC | 10 ms
5,376 KB |
testcase_31 | AC | 8 ms
5,376 KB |
testcase_32 | AC | 4 ms
5,376 KB |
testcase_33 | AC | 11 ms
5,376 KB |
testcase_34 | AC | 6 ms
5,376 KB |
testcase_35 | AC | 12 ms
5,376 KB |
testcase_36 | AC | 8 ms
5,376 KB |
testcase_37 | AC | 17 ms
5,376 KB |
testcase_38 | AC | 32 ms
5,376 KB |
testcase_39 | AC | 65 ms
6,656 KB |
testcase_40 | AC | 25 ms
8,064 KB |
testcase_41 | AC | 2 ms
5,376 KB |
testcase_42 | AC | 2 ms
5,376 KB |
testcase_43 | AC | 2 ms
5,376 KB |
testcase_44 | AC | 2 ms
5,376 KB |
testcase_45 | AC | 2 ms
5,376 KB |
testcase_46 | AC | 2 ms
5,376 KB |
testcase_47 | AC | 2 ms
5,376 KB |
testcase_48 | AC | 2 ms
5,376 KB |
testcase_49 | AC | 2 ms
5,376 KB |
testcase_50 | AC | 2 ms
5,376 KB |
testcase_51 | AC | 2 ms
5,376 KB |
testcase_52 | AC | 2 ms
5,376 KB |
testcase_53 | AC | 2 ms
5,376 KB |
testcase_54 | AC | 1 ms
5,376 KB |
testcase_55 | AC | 2 ms
5,376 KB |
testcase_56 | AC | 2 ms
5,376 KB |
testcase_57 | AC | 2 ms
5,376 KB |
testcase_58 | AC | 2 ms
5,376 KB |
testcase_59 | AC | 2 ms
5,376 KB |
ソースコード
// 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 aliasusing 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-indexedtemplate <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;}