Submission #344682

#	Time	Username	Problem	Language	Result	Execution time	Memory
344682		bachaquer	Divide and conquer (IZhO14_divide)	C++14	17 / 100	1 ms	364 KiB

divide

#include <bits/stdc++.h>
 
#define ll long long
#define pb push_back
 
using namespace std;
 
ll n, x, g, d;
 
struct lol {
    ll x;
    ll g;
    ll d;
};
vector<lol> v, khm;
 
int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> x >> g >> d;
        v.pb({x, g, d});
    }
    ll mx = 0;
    for (int i = 0; i < n; i++) {
        khm = v;
        ll sum = 0;
        for (int j = i; j < n; j++) {
            sum += khm[j].g;
            if (khm[j + 1].d + khm[j].d < (khm[j + 1].x - khm[j].x)) break;
            else {
                ll rozn = (khm[j + 1].x - khm[j].x);
                khm[j].d -= rozn;
                if (khm[j].d < 0) {
                    khm[j + 1].d += khm[j].d;
                    khm[j].d = 0;
                }
                khm[j + 1].d = khm[j].d + khm[j + 1].d;
            }
        }
        mx = max(mx, sum);
    }
    cout << mx;
    return 0;
}

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