Submission #1221899

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221899		M_SH_O	금 캐기 (IZhO14_divide)	C++20	100 / 100	67 ms	5068 KiB

divide

#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
//#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
//#define sort(a) sort(a.begin(), a.end())
#define all(a) a.begin(), a.end()
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000000
#define ordered_set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(1488);
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

int main() {
    ll n;
    cin >> n;
    vector<pair<ll, pll>> a(n);
    map<ll, pll> m;
    for (int i =0 ; i < n; i ++) {
        cin >> a[i].fr >> a[i].se.se >> a[i].se.fr;
    }

    ll l = 0;
    ll maxl = 0;
    deque<ll> d;
    vll pref(n+7, 0), p(n+7, 0);
    for (int i = 0; i < n ;i ++) {
        pref[i+1] += pref[i];
        pref[i+1] += a[i].se.fr;
        p[i+1] += p[i];
        p[i+1] += a[i].se.se;
        while (!d.empty()) {
            ll x = d.back();
            if (pref[i+1]-a[i].fr >= pref[x+1]-a[x].fr) d.pop_back();
            else break;
        }
        d.pb(i);
    }

    for (int i = 0; i < n; i ++) {
        ll l = 0, r = d.size();
        while (r-l > 1) {
            ll x = (l+r)/2;
            if (pref[d[x]+1]-pref[i] >= a[d[x]].fr-a[i].fr) l = x;
            else r = x;
        }
        maxl = max(maxl, p[d[l]+1]-p[i]);
        if (d[0] == i) d.pop_front();
    }

    cout << maxl << endl;
}

• Subtask 1: 17 / 17
• Subtask 2: 31 / 31
• Subtask 3: 52 / 52