oj.uz

Submission #344718

# Submission time Handle Problem Language Result Execution time Memory
344718 2021-01-06T10:33:29 Z bachaquer Divide and conquer (IZhO14_divide) C++14
48 / 100
 1000 ms 1644 KB 
#include <bits/stdc++.h>
 
#define ll long long
#define pb push_back
 
using namespace std;
 
ll n, x, g, d;
 
int main() {
    ios_base::sync_with_stdio(false);   
    cin.tie(NULL); cout.tie(NULL);
    cin >> n;
    ll prefd[n], prefg[n], xx[n];
    ll mx = 0;
    for (int i = 0; i < n; i++) {
        cin >> x >> g >> d;
        xx[i] = x;
        if (i == 0) {
            prefg[i] = g;
            prefd[i] = d;
        }
        else {
            prefd[i] = prefd[i - 1] + d;
            prefg[i] = prefg[i - 1] + g;
        }
        for (int j = 0; j <= i; j++) {
            if (j == 0){
                if (xx[i] - xx[j] <= prefd[i]) {
                    mx = max(mx, prefg[i]);
                }
            } 
            else if (xx[i] - xx[j] <= prefd[i] - prefd[j - 1]) {
                mx = max(mx, prefg[i] - prefg[j - 1]);
            }
        }
    }
    
    cout << mx;
    return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

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

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 3 ms 364 KB Output is correct
22 Correct 4 ms 364 KB Output is correct
23 Correct 21 ms 492 KB Output is correct
24 Correct 21 ms 492 KB Output is correct
25 Correct 18 ms 492 KB Output is correct
26 Correct 69 ms 620 KB Output is correct
27 Correct 70 ms 620 KB Output is correct
28 Execution timed out 1093 ms 1644 KB Time limit exceeded
29 Halted 0 ms 0 KB -