oj.uz

Submission #363822

# Submission time Handle Problem Language Result Execution time Memory
363822 2021-02-07T10:32:36 Z Sho10 Divide and conquer (IZhO14_divide) C++17
100 / 100
 39 ms 7916 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define aint(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,pref[3][100005],x[100005],g[100005],d[100005],ans,mn[100005];
int32_t main(){
CODE_START;
cin>>n;
mn[0]=LINF;
for(ll i=1;i<=n;i++)
{
    cin>>x[i]>>g[i]>>d[i];
    ans=max(ans,g[i]);
    pref[1][i]=pref[1][i-1]+g[i];
    pref[2][i]=pref[2][i-1]+d[i];
    mn[i]=min(mn[i-1],pref[2][i-1]-x[i]);
}
for(ll i=1;i<=n;i++)
{
    ll l=1,r=i,res=i;
    while(l<=r){
        ll mid=(l+r)/2;
        if(mn[mid]<=pref[2][i]-x[i]){
            res=mid;
        r=mid-1;
        }else l=mid+1;
    }
  //  cout<<pref[1][i]<<' '<<pref[1][res-1]<<' ';
    ans=max(ans,pref[1][i]-pref[1][res-1]);
}
cout<<ans<<endl;
}

Subtask #1
17.0 / 17.0

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

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 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 1 ms 364 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 2 ms 748 KB Output is correct
24 Correct 2 ms 748 KB Output is correct
25 Correct 2 ms 620 KB Output is correct
26 Correct 4 ms 1004 KB Output is correct
27 Correct 4 ms 1004 KB Output is correct
28 Correct 18 ms 3692 KB Output is correct
29 Correct 20 ms 4076 KB Output is correct
30 Correct 39 ms 7916 KB Output is correct
31 Correct 33 ms 6764 KB Output is correct
32 Correct 34 ms 6892 KB Output is correct
33 Correct 32 ms 6636 KB Output is correct
34 Correct 33 ms 6636 KB Output is correct
35 Correct 34 ms 7148 KB Output is correct
36 Correct 35 ms 7404 KB Output is correct