oj.uz

Submission #526629

# Submission time Handle Problem Language Result Execution time Memory
526629 2022-02-15T18:48:15 Z nitr0gen Divide and conquer (IZhO14_divide) C++14
0 / 100
 1 ms 1480 KB 
#include <bits/stdc++.h>
using namespace std;

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

    int n, ans=0;
    cin >> n;
    int x[100000], g[100000], d[100000];
    map<int,int> prefg, prefd;

    for(int i = 0; i < n; i++) {
        cin >> x[i] >> g[i] >> d[i];
        prefg[x[i]] = g[i];
        prefd[x[i]] = d[i];
        if(i) {
            prefg[x[i]] += prefg[x[i-1]];
        }
        if(i) {
            prefd[x[i]] += prefd[x[i-1]];
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = i; j < n; j++) {
            int len = x[j] - x[i];
            int power = prefd[x[j]];
            if(i) {
                power -= prefd[i-1];
            }
            if(power < len) continue;
            int local_ans = prefg[x[j]];
            if(i) {
                local_ans -= prefg[x[i-1]];
            }
            ans = max(ans, local_ans);
        }
    }
    cout << ans << '\n';

    return 0;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1480 KB Output is correct
2 Incorrect 1 ms 1480 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 1480 KB Output is correct
2 Incorrect 1 ms 1480 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 1480 KB Output is correct
2 Incorrect 1 ms 1480 KB Output isn't correct
3 Halted 0 ms 0 KB -