oj.uz

Submission #337564

# Submission time Handle Problem Language Result Execution time Memory
337564 2020-12-21T05:51:18 Z BY_KUTBILIM Divide and conquer (IZhO14_divide) C++14
100 / 100
 40 ms 4992 KB 
/** @BY_KUTBILIM **/
#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define pb push_back
#define ll long long

ll mn[100100];

int binsearch(int pos, ll find){
    int l = 1, r = pos;
    while(l < r){
        int m = (l + r) / 2;
        if(mn[m] <= find){
            r = m;
        } else l = m + 1;
    }
    return r;
}

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

    int n;
    cin >> n;
    ll x[n+1], g[n+1], d[n+1];
    ll pg[n+1], pd[n+1];
    pg[0] = pd[0] = 0;
    ll ans = 0;
    for(int i = 1; i <= n; i++){
        cin >> x[i] >> g[i] >> d[i];
        pg[i] = pg[i-1] + g[i];
        pd[i] = pd[i-1] + d[i];
    }
    mn[0] = 1e18;
    for(int r = 1; r <= n; r++){
        mn[r] = min(mn[r-1], pd[r-1] - x[r]);
        
        int l = binsearch(r, pd[r] - x[r]);
        ans = max(ans, pg[r] - pg[l-1]);
        
    }
    
    cout << ans;
    
    return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 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 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 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 384 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 2 ms 620 KB Output is correct
24 Correct 2 ms 620 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 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 384 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 2 ms 620 KB Output is correct
24 Correct 2 ms 620 KB Output is correct
25 Correct 2 ms 620 KB Output is correct
26 Correct 4 ms 748 KB Output is correct
27 Correct 4 ms 748 KB Output is correct
28 Correct 20 ms 2688 KB Output is correct
29 Correct 19 ms 2668 KB Output is correct
30 Correct 40 ms 4972 KB Output is correct
31 Correct 31 ms 4972 KB Output is correct
32 Correct 34 ms 4972 KB Output is correct
33 Correct 33 ms 4992 KB Output is correct
34 Correct 34 ms 4972 KB Output is correct
35 Correct 38 ms 4972 KB Output is correct
36 Correct 37 ms 4972 KB Output is correct