結果

問題 No.2808 Concentration
ユーザー woodywoodywoodywoody
提出日時 2024-07-13 01:40:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,371 ms / 2,000 ms
コード長 6,230 bytes
コンパイル時間 4,819 ms
コンパイル使用メモリ 283,100 KB
実行使用メモリ 103,388 KB
最終ジャッジ日時 2024-07-13 01:41:35
合計ジャッジ時間 52,600 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,330 ms
103,388 KB
testcase_01 AC 1,371 ms
103,260 KB
testcase_02 AC 1,304 ms
103,256 KB
testcase_03 AC 1,335 ms
103,384 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 442 ms
46,916 KB
testcase_08 AC 149 ms
22,692 KB
testcase_09 AC 5 ms
5,376 KB
testcase_10 AC 600 ms
63,440 KB
testcase_11 AC 688 ms
60,848 KB
testcase_12 AC 295 ms
29,832 KB
testcase_13 AC 1,025 ms
98,160 KB
testcase_14 AC 121 ms
17,100 KB
testcase_15 AC 913 ms
95,640 KB
testcase_16 AC 931 ms
93,648 KB
testcase_17 AC 1,269 ms
100,008 KB
testcase_18 AC 1,052 ms
103,188 KB
testcase_19 AC 581 ms
51,860 KB
testcase_20 AC 959 ms
99,812 KB
testcase_21 AC 903 ms
91,632 KB
testcase_22 AC 677 ms
59,560 KB
testcase_23 AC 522 ms
57,500 KB
testcase_24 AC 1,005 ms
96,416 KB
testcase_25 AC 530 ms
52,184 KB
testcase_26 AC 1,124 ms
95,492 KB
testcase_27 AC 1,230 ms
103,264 KB
testcase_28 AC 1,110 ms
103,104 KB
testcase_29 AC 994 ms
103,264 KB
testcase_30 AC 1,021 ms
103,320 KB
testcase_31 AC 1,019 ms
103,388 KB
testcase_32 AC 1,008 ms
103,240 KB
testcase_33 AC 1,130 ms
103,388 KB
testcase_34 AC 1,052 ms
103,264 KB
testcase_35 AC 1,124 ms
103,260 KB
testcase_36 AC 1,055 ms
103,260 KB
testcase_37 AC 1,204 ms
103,376 KB
testcase_38 AC 1,112 ms
103,316 KB
testcase_39 AC 1,172 ms
103,332 KB
testcase_40 AC 1,173 ms
103,388 KB
testcase_41 AC 1,070 ms
103,260 KB
testcase_42 AC 1,197 ms
103,188 KB
testcase_43 AC 1,191 ms
103,256 KB
testcase_44 AC 1,218 ms
103,256 KB
testcase_45 AC 1,099 ms
103,388 KB
testcase_46 AC 1,127 ms
103,292 KB
testcase_47 AC 2 ms
5,376 KB
testcase_48 AC 1 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 2 ms
5,376 KB
testcase_55 AC 2 ms
5,376 KB
testcase_56 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 2001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

ll op(ll a,ll b){
    return max(a,b);
}
 
ll e(){
    return -LINF;
}
 
ll mapping(pll p,ll a){
    return a*p.fi + p.se;
}
 
pll composition(pll p,pll q){
    return {p.fi*q.fi , p.fi*q.se + p.se};
}
 
pll id(){
    return {1 , 0};
}


void solve(){
    ll n,s,h; cin>>n>>s>>h;
    map<ll,ll> mp;
    vl x(n),y(n),z(n);
    set<ll> st;
    vl val;
    rep(i,n){
        cin>>x[i]>>y[i]>>z[i];
        mp[x[i]] = 0;
        mp[y[i]] = 0;
        st.insert(x[i]);
        st.insert(y[i]);
    }
    int m = 0;
    fore(y , mp){
        y.se = m++;
        val.pb(y.fi);
    }
    lazy_segtree<ll , op , e , pll , mapping , composition , id> ls1(m); // iで起き始める
    lazy_segtree<ll , op , e , pll , mapping , composition , id> ls2(m); // iで寝る
    vvi idx(m);
    rep(i,n){
        idx[mp[y[i]]].pb(i);
    }
    rep(i,m){
        if (i==0){
            ls1.set(i,0);
            ls2.set(i,0);
            continue;
        }
        auto it = st.lower_bound(val[i]-s);
        if (it!=st.begin()){
            it--;
            ls1.apply(0,mp[*it]+1,{0,-LINF});
        }
        fore(yy, idx[i]){
            int id = mp[x[yy]];
            int l = mp[*st.lower_bound(val[i]-s)];
            if (l<=id) ls1.apply(l,id+1,{1,z[yy]});
        }
        ll mx1 = 0;
        ll mx2 = 0;
        it = st.upper_bound(val[i]-h);
        if (it !=st.begin()){
            it--;
            chmax(mx1,ls2.prod(0,mp[*it]+1));
        }
        it = st.lower_bound(val[i]-s);
        chmax(mx2,ls1.prod(mp[*it],i+1));
        ls1.set(i,mx1);
        ls2.set(i,mx2);
    }
    ll ans = max(ls1.all_prod(), ls2.all_prod());
    chmax(ans,0ll);
    out;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0