oj.uz

Submission #991696

# Submission time Handle Problem Language Result Execution time Memory
991696 2024-06-02T19:51:33 Z VMaksimoski008 Divide and conquer (IZhO14_divide) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    int n;
    cin >> n;

    vector<array<int, 3> > v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i][0] >> v[i][1] >> v[i][2];
    ll pref[n+1][3];
    memset(pref, 0, sizeof(pref));
    for(int i=1; i<=n; i++)
        for(int j=1; j<3; j++) pref[i][j] = pref[i-1][j] + v[i][j];

    ll ans = 0;
    vector<ll> mn(n+1, 1e18);

    for(int i=1; i<=n; i++) {
        // for(int j=i; j<=n; j++)
        //     if(pref[j][2] - v[j][0] >= pref[i-1][2] - v[i][0] + 1) ans = max(ans, pref[j][1] - pref[i-1][1]);
        mn[i] = min(mn[i], pref[i-1][2] - v[i][0] + 1);

        int l=1, r=i, p=i;
        while(l <= r) {
            int mid = (l + r) / 2;
            if(mn[mid] <= pref[i][2] - v[i][0]) p = mid, r = mid - 1;
            else l = mid + 1;
        }

        ans = max(ans, pref[i][1] - pref[p-1][1]);
    }

    cout << ans << '\n';
    return 0;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -