結果

問題 No.844 split game
ユーザー fumiphysfumiphys
提出日時 2019-06-30 19:08:23
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 55 ms / 2,000 ms
コード長 3,980 bytes
コンパイル時間 2,432 ms
コンパイル使用メモリ 171,132 KB
実行使用メモリ 9,584 KB
最終ジャッジ日時 2023-09-20 17:41:19
合計ジャッジ時間 8,233 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 20 ms
5,564 KB
testcase_01 AC 19 ms
7,436 KB
testcase_02 AC 42 ms
6,916 KB
testcase_03 AC 32 ms
7,836 KB
testcase_04 AC 16 ms
5,192 KB
testcase_05 AC 47 ms
8,600 KB
testcase_06 AC 15 ms
5,192 KB
testcase_07 AC 14 ms
6,628 KB
testcase_08 AC 8 ms
4,380 KB
testcase_09 AC 31 ms
5,644 KB
testcase_10 AC 49 ms
8,200 KB
testcase_11 AC 49 ms
9,020 KB
testcase_12 AC 30 ms
5,548 KB
testcase_13 AC 19 ms
4,740 KB
testcase_14 AC 21 ms
6,448 KB
testcase_15 AC 53 ms
9,524 KB
testcase_16 AC 53 ms
9,536 KB
testcase_17 AC 55 ms
9,564 KB
testcase_18 AC 52 ms
9,556 KB
testcase_19 AC 53 ms
9,516 KB
testcase_20 AC 51 ms
9,584 KB
testcase_21 AC 52 ms
9,552 KB
testcase_22 AC 55 ms
9,556 KB
testcase_23 AC 3 ms
4,380 KB
testcase_24 AC 4 ms
4,380 KB
testcase_25 AC 3 ms
4,380 KB
testcase_26 AC 2 ms
4,380 KB
testcase_27 AC 4 ms
4,376 KB
testcase_28 AC 2 ms
4,380 KB
testcase_29 AC 4 ms
4,376 KB
testcase_30 AC 5 ms
4,376 KB
testcase_31 AC 4 ms
4,380 KB
testcase_32 AC 2 ms
4,380 KB
testcase_33 AC 5 ms
4,380 KB
testcase_34 AC 3 ms
4,380 KB
testcase_35 AC 5 ms
4,380 KB
testcase_36 AC 4 ms
4,376 KB
testcase_37 AC 7 ms
4,376 KB
testcase_38 AC 14 ms
4,600 KB
testcase_39 AC 30 ms
6,156 KB
testcase_40 AC 12 ms
5,648 KB
testcase_41 AC 2 ms
4,380 KB
testcase_42 AC 2 ms
4,376 KB
testcase_43 AC 2 ms
4,380 KB
testcase_44 AC 1 ms
4,380 KB
testcase_45 AC 1 ms
4,380 KB
testcase_46 AC 2 ms
4,380 KB
testcase_47 AC 2 ms
4,380 KB
testcase_48 AC 1 ms
4,380 KB
testcase_49 AC 2 ms
4,380 KB
testcase_50 AC 2 ms
4,380 KB
testcase_51 AC 1 ms
4,380 KB
testcase_52 AC 2 ms
4,380 KB
testcase_53 AC 2 ms
4,376 KB
testcase_54 AC 2 ms
4,380 KB
testcase_55 AC 2 ms
4,376 KB
testcase_56 AC 2 ms
4,380 KB
testcase_57 AC 2 ms
4,380 KB
testcase_58 AC 1 ms
4,376 KB
testcase_59 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

ll dp[100010];
ll dpc[100010];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n); INT(m); LL(a);
  vector<vector<pair<int, ll>>> v(n+1);
  rep(i, n + 1)dp[i] = - linf;
  rep(i, n + 1)dpc[i] = - linf;
  a = - a;
  rep(i, m){
    INT(l); INT(r); LL(p);
    v[r].pb(mk(l, p));
  }
  dp[0] = 0;
  dpc[0] = 0;
  FOR(i, 1, n + 1){
    for(auto e: v[i]){
      int l = e.FI; ll p = e.SE;
      if(l-2>=0)dp[i] = max(dp[i], dpc[l-2] + 2 * a + p);
      dp[i] = max(dp[i], dp[l-1] + a + p);
    }
    dpc[i] = max(dpc[i-1], dp[i]);
  }
  ll res = dp[n] - a;
  rep(i, n){
    res = max(res, dp[i]);
  }
  cout << res << endl;
  return 0;
}
0