Submission #433446

#	Time	Username	Problem	Language	Result	Execution time	Memory
433446		MilosMilutinovic	Divide and conquer (IZhO14_divide)	C++14	48 / 100	1084 ms	1908 KiB

divide

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    vector<int> X(N), G(N), D(N);

    for (int i = 0; i < N; i++)
        cin >> X[i] >> G[i] >> D[i];

    int64_t answer = 0;
    for (int i = 0; i < N; i++) {
        int64_t sum_gold = 0, sum_energy = 0;
        for (int j = i; j < N; j++) {
            sum_gold += G[j];
            sum_energy += D[j];

            if (sum_energy >= X[j] - X[i])
                answer = max(answer, sum_gold);
        }
    }
    cout << answer << "\n";
}

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