oj.uz

Submission #557836

# Submission time Handle Problem Language Result Execution time Memory
557836 2022-05-06T06:24:20 Z Jomnoi Divide and conquer (IZhO14_divide) C++17
100 / 100
 265 ms 6584 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int MAX_N = 1e5 + 10;
 
long long x[MAX_N], g[MAX_N], d[MAX_N];
int tree[4 * MAX_N];
 
void build(int idx, int l, int r) {
    if(l == r) {
        return void(tree[idx] = l);
    }
 
    int mid = (l + r) / 2;
    build(idx * 2, l, mid);
    build(idx * 2 + 1, mid + 1, r);
 
    int L = tree[idx * 2], R = tree[idx * 2 + 1];
    if(x[L] - d[L - 1] >= x[R] - d[R - 1]) {
        tree[idx] = L;
    }
    else {
        tree[idx] = R;
    }
}
 
int query(int idx, int l, int r, int ql, int qr) {
    if(r < ql or qr < l) {
        return -1;
    }
    if(ql <= l and r <= qr) {
        return tree[idx];
    }
 
    int mid = (l + r) / 2;
    int L = query(idx * 2, l, mid, ql, qr);
    int R = query(idx * 2 + 1, mid + 1, r, ql, qr);
 
    if(L == -1) {
        return R;
    }
    if(R == -1) {
        return L;
    }
    if(x[L] - d[L - 1] >= x[R] - d[R - 1]) {
        return L;
    }
    return R;
}
 
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int N;
    cin >> N;
    for(int i = 1; i <= N; i++) {
        cin >> x[i] >> g[i] >> d[i];
        g[i] += g[i - 1];
        d[i] += d[i - 1];
    }
 
    build(1, 1, N);
 
    long long ans = 0;
    for(int i = 1; i <= N; i++) {
        int l = 1, r = i;
        while(l < r) {
            int mid = (l + r) / 2;
 
            int j = query(1, 1, N, 1, mid);
            if(x[i] - x[j] <= d[i] - d[j - 1]) {
                r = mid;
            }
            else {
                l = mid + 1;
            }
        }
 
        ans = max(ans, g[i] - g[i - 1]);
        if(x[i] - x[l] <= d[i] - d[l - 1]) {
            ans = max(ans, g[i] - g[l - 1]);
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

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

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 7 ms 596 KB Output is correct
24 Correct 8 ms 596 KB Output is correct
25 Correct 6 ms 468 KB Output is correct
26 Correct 16 ms 724 KB Output is correct
27 Correct 15 ms 852 KB Output is correct
28 Correct 99 ms 3020 KB Output is correct
29 Correct 101 ms 3320 KB Output is correct
30 Correct 236 ms 6584 KB Output is correct
31 Correct 216 ms 5416 KB Output is correct
32 Correct 229 ms 5452 KB Output is correct
33 Correct 265 ms 5224 KB Output is correct
34 Correct 248 ms 5400 KB Output is correct
35 Correct 250 ms 5764 KB Output is correct
36 Correct 243 ms 6000 KB Output is correct