oj.uz

Submission #92773

# Submission time Handle Problem Language Result Execution time Memory
92773 2019-01-04T13:23:30 Z SamAnd Divide and conquer (IZhO14_divide) C++17
100 / 100
 136 ms 9592 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
struct ban
{
    long long x,g,d;
};
struct ban1
{
    long long y,i;
};
bool operator<(const ban1 a,const ban1 b)
{
    if(a.y<b.y)
        return true;
    if(a.y>b.y)
        return false;
    return a.i<b.i;
}
const int N=100005;

int n;
ban a[N];
long long pg[N],pd[N];
ban1 t[N];
long long minu[N];
int byn(long long y)
{
    int l=1,r=n-1;
    while((r-l)>3)
    {
        int m=(l+r)/2;
        if(t[m].y>y)
            r=m;
        else
            l=m;
    }
    for(int i=r;i>=l;--i)
        if(t[i].y<=y)
            return i;
}
int main()
{
    //freopen("divide.in","r",stdin);
    //freopen("divide.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;++i)
        cin>>a[i].x>>a[i].g>>a[i].d;
    a[0].x=-1;
    a[0].g=0;
    a[0].d=0;
    ++n;

    for(int i=1;i<n;++i)
        pg[i]=pg[i-1]+a[i].g;
    for(int i=1;i<n;++i)
        pd[i]=pd[i-1]+a[i].d;

    for(int i=1;i<n;++i)
    {
        t[i].i=i;
        t[i].y=pd[i-1]-a[i].x;
    }
    sort(t+1,t+n);
    minu[1]=t[1].i;
    for(int i=2;i<n;++i)
        minu[i]=min(minu[i-1],t[i].i);

    long long ans=0;
    for(int i=1;i<n;++i)
    {
        long long y=pd[i]-a[i].x;
        int j=byn(y);
        ans=max(ans,pg[i]-pg[minu[j]-1]);
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

divide.cpp: In function 'int byn(long long int)':
divide.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

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

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 632 KB Output is correct
2 Correct 10 ms 1144 KB Output is correct
3 Correct 12 ms 1144 KB Output is correct
4 Correct 57 ms 4524 KB Output is correct
5 Correct 63 ms 4856 KB Output is correct
6 Correct 136 ms 9592 KB Output is correct
7 Correct 100 ms 8440 KB Output is correct
8 Correct 104 ms 8524 KB Output is correct
9 Correct 99 ms 8304 KB Output is correct
10 Correct 97 ms 8312 KB Output is correct
11 Correct 111 ms 8964 KB Output is correct
12 Correct 115 ms 8952 KB Output is correct