Submission #433446

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
433446	2021-06-19T20:05:25 Z	MilosMilutinovic	Divide and conquer (IZhO14_divide)	C++14	48 / 100	1000 ms	1908 KB

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.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct

Subtask #2

31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct
21	Correct	3 ms	332 KB	Output is correct
22	Correct	4 ms	320 KB	Output is correct
23	Correct	17 ms	476 KB	Output is correct
24	Correct	17 ms	488 KB	Output is correct

Subtask #3

0 / 52.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct
21	Correct	3 ms	332 KB	Output is correct
22	Correct	4 ms	320 KB	Output is correct
23	Correct	17 ms	476 KB	Output is correct
24	Correct	17 ms	488 KB	Output is correct
25	Correct	22 ms	428 KB	Output is correct
26	Correct	79 ms	460 KB	Output is correct
27	Correct	83 ms	588 KB	Output is correct
28	Execution timed out	1084 ms	1908 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-