Submission #459242

#	Time	Username	Problem	Language	Result	Execution time	Memory
459242		dxz05	Divide and conquer (IZhO14_divide)	C++14	100 / 100	199 ms	43140 KiB

divide

#pragma GCC optimize("Ofast,O2,O3")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define revall(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 2e6 + 3e2;
const int M = 2522;

ll x[N], pd[N], pg[N];

ll t[N];

void update(int pos, ll val, int v = 1, int tl = 1, int tr = 3e5){
    if (tl == tr){
        t[v] = min(t[v], val);
        return;
    }

    int tm = (tl + tr) >> 1;
    if (pos <= tm) update(pos, val, v + v, tl, tm); else
        update(pos, val, v + v + 1, tm + 1, tr);

    t[v] = min(t[v + v], t[v + v + 1]);
}

ll get(int l, int r, int v = 1, int tl = 1, int tr = 3e5){
    if (l <= tl && tr <= r) return t[v];
    if (tl > r || tr < l) return LLINF;
    int tm = (tl + tr) >> 1;
    return min(get(l, r, v + v, tl, tm), get(l, r, v + v + 1, tm + 1, tr));
}

void solve(int TC) {
    fill(t, t + N, LLINF);

    int n;
    cin >> n;

    for (int i = 1; i <= n; i++){
        cin >> x[i] >> pg[i] >> pd[i];
        pg[i] += pg[i - 1];
        pd[i] += pd[i - 1];
    }

    set<ll> s;
    for (int i = 1; i <= n; i++){
        s.insert(pd[i - 1] - x[i]);
        s.insert(pd[i] - x[i]);
    }

    map<ll, int> mp;
    for (ll k : s) mp[k] = mp.size() + 1;

    ll ans = 0;
    for (int i = 1; i <= n; i++){
        int pos = mp[pd[i - 1] - x[i]];
        update(pos, pg[i - 1]);

        pos = mp[pd[i] - x[i]];
        ans = max(ans, pg[i] - get(1, pos));
    }

    cout << ans;

}

int main() {
    startTime = clock();
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    bool llololcal = false;
#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    llololcal = true;
#endif

    int TC = 1;
    //cin >> TC;

    for (int test = 1; test <= TC; test++) {
        debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    if (llololcal) cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Compilation message (stderr)

divide.cpp: In function 'int main()':
divide.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
divide.cpp:118:9: note: in expansion of macro 'debug'
  118 |         debug(test);
      |         ^~~~~

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