oj.uz

Submission #765628

# Submission time Handle Problem Language Result Execution time Memory
765628 2023-06-24T23:53:45 Z LeaRouse Divide and conquer (IZhO14_divide) C++14
100 / 100
 34 ms 12604 KB 
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define ll long long
#define ff first
#define ss second
using namespace std;
const int MAX = 2e5+5;
const ll INF=1e18;
ll O[MAX],E[MAX],A[MAX],B[MAX],C[MAX],P[MAX];
pair<int,int>dp[(1<<21)+5];
vector<int>v[MAX];
int bi(int x){
    int ini=1;
    int fin=x;
    while(ini<fin){
        int mid=(ini+fin-1)/2;
        if(P[mid]>E[x]-A[x]){
            ini=mid+1;
        }
        else{
            fin=mid;
        }
    }
    return ini;
}

void go(){
    int n;  cin>>n;
    E[0]=0; O[0]=0; P[0]=INF;
    for(int i=1;i<=n;i++){
        cin>>A[i]>>B[i]>>C[i];
        O[i]=O[i-1]+B[i];//oro acumulado 
        E[i]=E[i-1]+C[i];//energia acumulada
        P[i]=min(P[i-1],E[i-1]-A[i]);//dif energia - pos
    }
    ll ans=0;
    for(int i=1;i<=n;i++){
        int a=bi(i);//buscamos el indice j <i / jes el minimo y cumpla la barrera
        //cout<<a<<endl;
        if(P[a]<=E[i]-A[i]){
            ans=max(ans,O[i]-O[a-1]);
        }
    }
    cout<<ans<<endl;
}
 
int main(){
    fastio;
    go();
    return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

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

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4944 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 5012 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 5076 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 2 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 2 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 5 ms 5204 KB Output is correct
24 Correct 3 ms 5204 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 4 ms 5472 KB Output is correct
27 Correct 4 ms 5460 KB Output is correct
28 Correct 13 ms 7352 KB Output is correct
29 Correct 16 ms 8612 KB Output is correct
30 Correct 34 ms 12604 KB Output is correct
31 Correct 22 ms 11492 KB Output is correct
32 Correct 23 ms 11584 KB Output is correct
33 Correct 21 ms 11300 KB Output is correct
34 Correct 23 ms 11304 KB Output is correct
35 Correct 28 ms 11820 KB Output is correct
36 Correct 33 ms 11932 KB Output is correct