結果
問題 | No.844 split game |
ユーザー | lumc_ |
提出日時 | 2019-06-28 21:45:10 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 56 ms / 2,000 ms |
コード長 | 4,676 bytes |
コンパイル時間 | 1,126 ms |
コンパイル使用メモリ | 113,120 KB |
実行使用メモリ | 12,400 KB |
最終ジャッジ日時 | 2023-09-14 21:46:59 |
合計ジャッジ時間 | 4,522 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 22 ms
10,488 KB |
testcase_01 | AC | 19 ms
11,076 KB |
testcase_02 | AC | 43 ms
11,108 KB |
testcase_03 | AC | 34 ms
11,364 KB |
testcase_04 | AC | 18 ms
10,376 KB |
testcase_05 | AC | 50 ms
11,660 KB |
testcase_06 | AC | 17 ms
10,360 KB |
testcase_07 | AC | 15 ms
10,700 KB |
testcase_08 | AC | 11 ms
10,016 KB |
testcase_09 | AC | 33 ms
10,400 KB |
testcase_10 | AC | 51 ms
11,436 KB |
testcase_11 | AC | 50 ms
11,992 KB |
testcase_12 | AC | 32 ms
10,276 KB |
testcase_13 | AC | 21 ms
10,120 KB |
testcase_14 | AC | 24 ms
10,848 KB |
testcase_15 | AC | 54 ms
12,108 KB |
testcase_16 | AC | 54 ms
12,144 KB |
testcase_17 | AC | 55 ms
12,100 KB |
testcase_18 | AC | 55 ms
12,084 KB |
testcase_19 | AC | 56 ms
12,136 KB |
testcase_20 | AC | 54 ms
12,148 KB |
testcase_21 | AC | 53 ms
12,400 KB |
testcase_22 | AC | 54 ms
12,132 KB |
testcase_23 | AC | 5 ms
9,628 KB |
testcase_24 | AC | 7 ms
9,800 KB |
testcase_25 | AC | 6 ms
9,568 KB |
testcase_26 | AC | 5 ms
9,648 KB |
testcase_27 | AC | 6 ms
9,656 KB |
testcase_28 | AC | 5 ms
9,604 KB |
testcase_29 | AC | 7 ms
9,736 KB |
testcase_30 | AC | 8 ms
9,868 KB |
testcase_31 | AC | 6 ms
9,624 KB |
testcase_32 | AC | 4 ms
9,664 KB |
testcase_33 | AC | 7 ms
9,608 KB |
testcase_34 | AC | 6 ms
9,744 KB |
testcase_35 | AC | 8 ms
9,680 KB |
testcase_36 | AC | 6 ms
9,696 KB |
testcase_37 | AC | 10 ms
9,676 KB |
testcase_38 | AC | 16 ms
9,996 KB |
testcase_39 | AC | 31 ms
10,528 KB |
testcase_40 | AC | 13 ms
10,512 KB |
testcase_41 | AC | 4 ms
9,804 KB |
testcase_42 | AC | 4 ms
9,576 KB |
testcase_43 | AC | 4 ms
9,496 KB |
testcase_44 | AC | 4 ms
9,496 KB |
testcase_45 | AC | 4 ms
9,516 KB |
testcase_46 | AC | 5 ms
9,576 KB |
testcase_47 | AC | 4 ms
9,576 KB |
testcase_48 | AC | 4 ms
9,520 KB |
testcase_49 | AC | 4 ms
9,508 KB |
testcase_50 | AC | 5 ms
9,516 KB |
testcase_51 | AC | 4 ms
9,544 KB |
testcase_52 | AC | 5 ms
9,516 KB |
testcase_53 | AC | 4 ms
9,560 KB |
testcase_54 | AC | 4 ms
9,700 KB |
testcase_55 | AC | 5 ms
9,560 KB |
testcase_56 | AC | 4 ms
9,504 KB |
testcase_57 | AC | 4 ms
9,588 KB |
testcase_58 | AC | 4 ms
9,764 KB |
testcase_59 | AC | 4 ms
9,640 KB |
ソースコード
// includes {{{ #include<iostream> #include<iomanip> #include<algorithm> #include<vector> #include<stack> #include<queue> #include<map> #include<set> #include<tuple> #include<cmath> #include<random> #include<cassert> #include<bitset> #include<cstdlib> // #include<deque> // #include<multiset> // #include<cstring> // #include<bits/stdc++.h> // }}} using namespace std; using ll = long long; // #undef DEBUG // #define DEBUG // DEBUG {{{ #include <array> #include <deque> #include <iostream> #include <list> #include <queue> #include <stack> #include <tuple> #include <valarray> #include <vector> template < int n, class... T > typename std::enable_if< (n >= sizeof...(T)) >::type __output_tuple( std::ostream &, std::tuple< T... > const &) {} template < int n, class... T > typename std::enable_if< (n < sizeof...(T)) >::type __output_tuple( std::ostream &os, std::tuple< T... > const &t) { os << (n == 0 ? "" : ", ") << std::get< n >(t); __output_tuple< n + 1 >(os, t); } template < class... T > std::ostream &operator<<(std::ostream &os, std::tuple< T... > const &t) { os << "("; __output_tuple< 0 >(os, t); os << ")"; return os; } template < class T, class U > std::ostream &operator<<(std::ostream &os, std::pair< T, U > const &p) { os << "(" << p.first << ", " << p.second << ")"; return os; } template < class T > std::ostream &operator<<(std::ostream &os, const std::stack< T > &a) { os << "{"; for(auto tmp = a; tmp.size(); tmp.pop()) os << (a.size() == tmp.size() ? "" : ", ") << tmp.top(); os << "}"; return os; } template < class T, class Container, class Compare > std::ostream &operator<<(std::ostream &os, std::priority_queue< T, Container, Compare > a) { os << "{ (top) "; while(a.size()) os << a.top() << (a.size() == 1 ? "" : ", "), a.pop(); os << " }"; return os; } template < class T, class Container > std::ostream &operator<<(std::ostream &os, std::queue< T, Container > a) { os << "{ "; while(a.size()) os << a.front() << (a.size() == 1 ? "" : ", "), a.pop(); os << " }"; return os; } #ifdef DEBUG #if !defined(DEBUG_OUT) #define DEBUG_OUT std::cerr #endif #define dump(...) \ [&]() { \ auto __debug_tap = std::make_tuple(__VA_ARGS__); \ DEBUG_OUT << "[" << __LINE__ << "] " << #__VA_ARGS__ << " = " << __debug_tap \ << std::endl; \ }() template < class T > inline void dump2D(T &d, size_t sizey, size_t sizex) { for(size_t i = 0; i < sizey; i++) { DEBUG_OUT << "\t"; for(size_t j = 0; j < sizex; j++) DEBUG_OUT << d[i][j] << (j + 1 == sizex ? "" : "\t"); DEBUG_OUT << std::endl; } } template < class T > inline void dump1D(T &d, size_t sizey) { for(size_t i = 0; i < sizey; i++) { DEBUG_OUT << d[i] << (i + 1 == sizey ? "" : " "); } DEBUG_OUT << std::endl; } template < class T, class = typename std::iterator_traits< decltype(begin(T())) >::value_type, class = typename std::enable_if< !std::is_same< T, std::string >::value >::type > std::ostream &operator<<(std::ostream &os, const T &a) { os << "{"; for(auto ite = begin(a); ite != end(a); ++ite) os << (ite == begin(a) ? "" : ", ") << *ite; os << "}"; return os; } #else #define dump(...) ((void) 42) #define dump2D(...) ((void) 42) #define dump1D(...) ((void) 42) template < class T, class = typename std::iterator_traits< decltype(begin(T())) >::value_type, class = typename std::enable_if< !std::is_same< T, std::string >::value >::type > std::ostream &operator<<(std::ostream &os, const T &a) { for(auto ite = begin(a); ite != end(a); ++ite) os << (ite == begin(a) ? "" : " ") << *ite; return os; } #endif // }}} ll dp[112345]; ll dp2[112345]; ll l[112345], r[112345], p[112345]; vector<int> q[112345]; template <class T, class U> inline void smax(T &a, U b) { a = a > b ? a : b; } template <class T, class U> inline void smin(T &a, U b) { a = a < b ? a : b; } int main() { std::ios::sync_with_stdio(false), std::cin.tie(0); int n, m; ll a; cin >> n >> m >> a; for(int i = 0; i < m; i++) { cin >> l[i] >> r[i] >> p[i]; q[r[i] + 1].push_back(i); } for(int i = 2; i <= n + 1; i++) { dp[i] = -1e18; for(int j : q[i]) { smax(dp[i], dp[l[j]] + p[j] - a + a * (i == n + 1)); smax(dp[i], dp2[l[j]-1] + p[j] - 2 * a + a * (i == n + 1)); } dp2[i] = max(dp2[i-1], dp[i]); } cout << dp2[n + 1] << endl; return 0; }