結果
| 問題 | No.2808 Concentration |
| ユーザー |
 fuppy_kyopro
|
| 提出日時 | 2024-07-12 22:16:56 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 259 ms / 2,000 ms |
| コード長 | 7,657 bytes |
| コンパイル時間 | 15,290 ms |
| コンパイル使用メモリ | 296,572 KB |
| 最終ジャッジ日時 | 2025-02-22 04:18:16 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge6 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 57 |
ソースコード
//*#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")//*/// #include <atcoder/all>#include <bits/stdc++.h>using namespace std;// using namespace atcoder;// #define _GLIBCXX_DEBUG#define DEBUG(x) cerr << #x << ": " << x << endl;#define DEBUG_VEC(v) \cerr << #v << ":"; \for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \cerr << " " << v[iiiiiiii]; \cerr << endl;#define DEBUG_MAT(v) \cerr << #v << endl; \for (int iv = 0; iv < v.size(); iv++) { \for (int jv = 0; jv < v[iv].size(); jv++) { \cerr << v[iv][jv] << " "; \} \cerr << endl; \}typedef long long ll;// #define int ll#define vi vector<int>#define vl vector<ll>#define vii vector<vector<int>>#define vll vector<vector<ll>>#define pii pair<int, int>#define pis pair<int, string>#define psi pair<string, int>#define pll pair<ll, ll>template <class S, class T>pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {return pair<S, T>(s.first + t.first, s.second + t.second);}template <class S, class T>pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }template <class S, class T>ostream &operator<<(ostream &os, pair<S, T> p) {os << "(" << p.first << ", " << p.second << ")";return os;}#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)#define REP(i, a, b) for (int i = a; i < b; i++)#define in(x, a, b) (a <= x && x < b)#define all(c) c.begin(), c.end()void YES(bool t = true) {cout << (t ? "YES" : "NO") << endl;}void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }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 <class T>T ceil_div(T a, T b) {return (a + b - 1) / b;}template <class T>T safe_mul(T a, T b) {if (a == 0 || b == 0) return 0;if (numeric_limits<T>::max() / a < b) return numeric_limits<T>::max();return a * b;}#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());const ll inf = 1000000001;const ll INF = (ll)1e18 + 1;const long double pi = 3.1415926535897932384626433832795028841971L;int popcount(ll t) { return __builtin_popcountll(t); }vector<int> gen_perm(int n) {vector<int> ret(n);iota(all(ret), 0);return ret;}// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};struct Setup_io {Setup_io() {ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);cout << fixed << setprecision(25);cerr << fixed << setprecision(25);}} setup_io;// constexpr ll MOD = 1000000007;constexpr ll MOD = 998244353;// #define mp make_pairtemplate <typename T>class SegmentTree {public:using F = function<T(T &, T &)>;int n;vector<T> dat;T e;F query_func;F update_func;SegmentTree(vector<T> a, F query_func, F update_func, T e) : n(a.size()), query_func(query_func), update_func(update_func), e(e) {if (n == 0) {a.push_back(e);n++;}dat.resize(4 * n);init(0, 0, n, a);}void init(int k, int l, int r, vector<T> &a) {if (r - l == 1) {dat[k] = a[l];} else {int lch = 2 * k + 1, rch = 2 * k + 2;init(lch, l, (l + r) / 2, a);init(rch, (l + r) / 2, r, a);dat[k] = query_func(dat[lch], dat[rch]);}}void update(int k, T a, int v, int l, int r) {if (r - l == 1) {dat[v] = update_func(dat[v], a);} else {if (k < (l + r) / 2)update(k, a, 2 * v + 1, l, (l + r) / 2);else {update(k, a, 2 * v + 2, (l + r) / 2, r);}dat[v] = query_func(dat[v * 2 + 1], dat[v * 2 + 2]);}}void update(int k, T a) {update(k, a, 0, 0, n);}T query(int a, int b, int k, int l, int r) {if (r <= a || b <= l) {return e;}if (a <= l && r <= b) {return dat[k];} else {T ul = query(a, b, k * 2 + 1, l, (l + r) / 2);T ur = query(a, b, k * 2 + 2, (l + r) / 2, r);return query_func(ul, ur);}}T query(int a, int b) {return query(a, b, 0, 0, n);}int find(int a, int b, int k, int l, int r, int x) {if (dat[k] < x || r <= a || b <= l) return -1;if (l + 1 == r) {if (dat[k] >= x)return l;elsereturn -1;}int rv = find(a, b, 2 * k + 2, (l + r) / 2, r, x);if (rv != -1) return rv;return find(a, b, 2 * k + 1, l, (l + r) / 2, x);}};ll f(ll a, ll b) {return max(a, b);}signed main() {ll n, s, h;cin >> n >> s >> h;vector<ll> x(n), y(n), z(n);rep(i, n) {cin >> x[i] >> y[i] >> z[i];}vl sum(n + 1, 0);rep(i, n) {sum[i + 1] = sum[i] + z[i];}vector<ll> dp0(n + 1), dp1(n);dp0[0] = 0;vl ini0(n + 1);rep(i, n + 1) {ini0[i] = -sum[i];}SegmentTree<ll> seg0(ini0, f, f, -INF), seg1(dp1, f, f, -INF);rep(i, n) {// 話 i が終わった瞬間の dp1 を更新{int ok = i + 1, ng = -1;while (ok - ng > 1) {int mid = (ok + ng) / 2;if (y[i] - x[mid] <= s) {ok = mid;} else {ng = mid;}}// 話 ok, ok + 1, ..., i の好きな時に起き始められるif (ok <= i) {dp1[i] = seg0.query(ok, i + 1) + sum[i + 1];seg1.update(i, dp1[i]);}}// i + 1 個の話を処理して（話 i が終わって）、話 i + 1 をきける状態になった時のスコア{if (i + 1 == n) {dp0[n] = seg1.query(0, n);break;}int ok = -1, ng = i + 1;while (ng - ok > 1) {int mid = (ok + ng) / 2;if (x[i + 1] - y[mid] >= h) {ok = mid;} else {ng = mid;}}// 話 0, 1, ..., ok は聞いた後寝て起きれるif (ok >= 0) {dp0[i + 1] = seg1.query(0, ok + 1);seg0.update(i + 1, dp0[i + 1] - sum[i + 1]);}}}cout << dp0[n] << endl;}