結果
| 問題 | No.2808 Concentration |
| ユーザー |
👑  Nachia
|
| 提出日時 | 2024-07-12 21:31:02 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 191 ms / 2,000 ms |
| コード長 | 9,121 bytes |
| コンパイル時間 | 1,394 ms |
| コンパイル使用メモリ | 118,368 KB |
| 最終ジャッジ日時 | 2025-02-22 03:36:37 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 57 |
ソースコード
#ifdef NACHIA#define _GLIBCXX_DEBUG#else#define NDEBUG#endif#include <iostream>#include <string>#include <vector>#include <algorithm>#include <utility>#include <queue>#include <array>#include <cmath>using i64 = long long;using u64 = unsigned long long;#define rep(i,n) for(int i=0; i<int(n); i++)#define repr(i,n) for(int i=int(n)-1; i>=0; i--)const i64 INF = 1001001001001001001;const char* yn(bool x){ return x ? "Yes" : "No"; }template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;template<class R> auto ComparingBy(R f){ return [g=std::move(f)](auto l, auto r) -> bool { return g(l) < g(r); }; }#include <atcoder/modint>using Modint = atcoder::static_modint<998244353>;#include <iterator>#include <functional>template<class Elem> struct vec;template<class Iter>struct seq_view{using Ref = typename std::iterator_traits<Iter>::reference;using Elem = typename std::iterator_traits<Iter>::value_type;Iter a, b;Iter begin() const { return a; }Iter end() const { return b; }int size() const { return (int)(b-a); }seq_view(Iter first, Iter last) : a(first), b(last) {}seq_view sort() const { std::sort(a, b); return *this; }Ref& operator[](int x){ return *(a+x); }template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {ret x(size()); for(int i=0; i<size(); i++) x[i] = i;x().sort([&](int l, int r){ return f(a[l],a[r]); });return x;}template<class ret = vec<Elem>> ret col() const { return ret(begin(), end()); }template<class F = std::equal_to<Elem>, class ret = vec<std::pair<Elem, int>>>ret rle(F eq = F()) const {auto x = ret();for(auto& a : (*this)){if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++;} return x;}template<class F> seq_view sort(F f) const { std::sort(a, b, f); return *this; }Iter uni() const { return std::unique(a, b); }Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); }Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); }int lbi(const Elem& x) const { return lb(x) - a; }int ubi(const Elem& x) const { return ub(x) - a; }seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; }template<class F> Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); }template<class F> Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); }template<class F> Iter when_true_to_false(F f) const {if(a == b) return a;return std::lower_bound(a, b, *a,[&](const Elem& x, const Elem&){ return f(x); });}seq_view same(Elem x) const { return { lb(x), ub(x) }; }template<class F> auto map(F f) const {vec<typename Iter::value_type> r;for(auto& x : *this) r.emp(f(x));return r;}Iter max() const { return std::max_element(a, b); }Iter min() const { return std::min_element(a, b); }template<class F = std::less<Elem>>Iter min(F f) const { return std::min_element(a, b, f); }seq_view rev() const { std::reverse(a, b); return *this; }};template<class Elem>struct vec {using Base = typename std::vector<Elem>;using Iter = typename Base::iterator;using CIter = typename Base::const_iterator;using View = seq_view<Iter>;using CView = seq_view<CIter>;vec(){}explicit vec(int n, const Elem& value = Elem()) : a(0<n?n:0, value) {}template <class I2> vec(I2 first, I2 last) : a(first, last) {}vec(std::initializer_list<Elem> il) : a(std::move(il)) {}vec(Base b) : a(std::move(b)) {}operator Base() const { return a; }Iter begin(){ return a.begin(); }CIter begin() const { return a.begin(); }Iter end(){ return a.end(); }CIter end() const { return a.end(); }int size() const { return a.size(); }bool empty() const { return a.empty(); }Elem& back(){ return a.back(); }const Elem& back() const { return a.back(); }vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; }Iter operator()(int x){ return a.begin() + x; }CIter operator()(int x) const { return a.begin() + x; }View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; }CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; }View operator()(){ return (*this)(0,size()); }CView operator()() const { return (*this)(0,size()); }Elem& operator[](int x){ return a[x]; }const Elem& operator[](int x) const { return a[x]; }Base& operator*(){ return a; }const Base& operator*() const { return a; }vec& push(Elem args){a.push_back(std::move(args));return *this;}template<class... Args>vec& emp(Args &&... args){a.emplace_back(std::forward<Args>(args) ...);return *this;}template<class Range>vec& app(Range& x){ for(auto& v : a) emp(v); }Elem pop(){Elem x = std::move(a.back());a.pop_back(); return x;}bool operator==(const vec& r) const { return a == r.a; }bool operator!=(const vec& r) const { return a != r.a; }bool operator<(const vec& r) const { return a < r.a; }bool operator<=(const vec& r) const { return a <= r.a; }bool operator>(const vec& r) const { return a > r.a; }bool operator>=(const vec& r) const { return a >= r.a; }vec<vec<Elem>> pile(int n) const { return vec<vec<Elem>>(n, *this); }template<class F> vec& filter(F f){int p = 0;for(int q=0; q<size(); q++) if(f(a[q])) std::swap(a[p++],a[q]);a.resize(p); return *this;}private: Base a;};template<class IStr, class U, class T>IStr& operator>>(IStr& is, vec<std::pair<U,T>>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; }template<class IStr, class T>IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }template<class OStr, class T>OStr& operator<<(OStr& os, const vec<T>& v){for(int i=0; i<v.size(); i++){if(i){ os << ' '; } os << v[i];} return os;}template<class OStr, class U, class T>OStr& operator<<(OStr& os, const vec<std::pair<U,T>>& v){for(int i=0; i<v.size(); i++){if(i){ os << ' '; } os << '(' << v[i].first << ',' << v[i].second << ')';} return os;}namespace nachia{template<class F,F composition(F f, F x)>struct DualSegtree {struct Node { F f; bool propagated; };int N;int logN;std::vector<Node> A;void mapf(Node& a, F f) {a.propagated = false;a.f = composition(f, a.f);}void spread(int i) {if(A[i].propagated || !(i < N)) return;mapf(A[i*2], A[i].f);mapf(A[i*2+1], A[i].f);A[i] = A[0];}DualSegtree(int n, F id) {N=1; logN=0;while(N<n){ N *= 2; logN++; }A.assign(N*2, { id, true });}DualSegtree(const std::vector<F>& a, F id) : DualSegtree(a.size(), id) {for(int i=0; i<a.size(); i++){ A[i+N].f = a[i]; A[i+N].propagated = false; }}void clear(int p) {p += N;for(int d=logN; d; d--) spread(p >> d);A[p] = A[0];}F get(int p){p += N;for(int d=logN; d; d--) spread(p >> d);return A[p].f;}void apply(int l, int r, F f){if(!(l < r)) return;if(l == 0 && r == N){ mapf(A[1], f); return; }l += N; r += N;for(int d=logN; d; d--){if((l >> d) << d != l) spread(l >> d);if((r >> d) << d != r) spread(r >> d);}while(l < r){if(l&1){ mapf(A[l++], f); } l /= 2;if(r&1){ mapf(A[--r], f); } r /= 2;}}void apply(int p, F f){p += N;for(int d=logN; d; d--) spread(p >> d);mapf(A[p], f);}};} // namespace nachia;using namespace std;i64 minint(i64 a, i64 b){ return min(a,b); }i64 maxint(i64 a, i64 b){ return max(a,b); }void testcase(){i64 N, S, H; cin >> N >> S >> H;vec<i64> X(N), Y(N), Z(N);rep(i,N) cin >> X[i] >> Y[i] >> Z[i];vector<i64> Zsum(N+1); rep(i,N) Zsum[i+1] = Zsum[i] + Z[i];auto Ds0 = nachia::DualSegtree<i64, maxint>(N+1, 0);auto Ds1 = nachia::DualSegtree<i64, minint>(N+1, INF);rep(i,N+1) Ds1.apply(i, Zsum[i]);rep(s,N){if(s != 0){i64 q = Zsum[s] - Ds1.get(s);int h = X().lbi(Y[s-1] + H);Ds0.apply(h, N+1, q);}{i64 q = Zsum[s] - Ds0.get(s);int h = Y().ubi(X[s] + S);Ds1.apply(s, h+1, q);}}i64 ans = 0;chmax(ans, Ds0.get(N));chmax(ans, Zsum[N] - Ds1.get(N));cout << ans << endl;}int main(){ios::sync_with_stdio(false); cin.tie(nullptr);testcase();return 0;}