oj.uz

Submission #502771

# Submission time Handle Problem Language Result Execution time Memory
502771 2022-01-06T15:02:35 Z LucaIlie Divide and conquer (IZhO14_divide) C++17
48 / 100
 1000 ms 1872 KB 
#include <iostream>

#define MAX_N 100000

using namespace std;


int x[MAX_N + 1], g[MAX_N + 1], d[MAX_N + 1];

int main() {
    int n, i, j;
    long long sg, sd, maxG;

    cin >> n;
    for ( i = 1; i <= n; i++ )
        cin >> x[i] >> g[i] >> d[i];

    maxG = 0;
    for ( i = 1; i <= n; i++ ) {
        sg = sd = 0;
        for ( j = i; j <= n; j++ ) {
            sg += g[j];
            sd += d[j];
            if ( x[j] - x[i] <= sd ) {
                if ( sg > maxG )
                    maxG = sg;
            }
        }
    }

    cout << maxG;

    return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 0 ms 292 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 300 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 300 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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 0 ms 292 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 300 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 300 KB Output is correct
13 Correct 0 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 308 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 3 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 2 ms 308 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 17 ms 468 KB Output is correct
24 Correct 18 ms 452 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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 0 ms 292 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 300 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 300 KB Output is correct
13 Correct 0 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 308 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 3 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 2 ms 308 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 17 ms 468 KB Output is correct
24 Correct 18 ms 452 KB Output is correct
25 Correct 20 ms 312 KB Output is correct
26 Correct 77 ms 436 KB Output is correct
27 Correct 83 ms 588 KB Output is correct
28 Execution timed out 1014 ms 1872 KB Time limit exceeded
29 Halted 0 ms 0 KB -