oj.uz

Submission #17463

# Submission time Handle Problem Language Result Execution time Memory
17463 2015-12-17T15:37:25 Z azecoder Divide and conquer (IZhO14_divide) C++
0 / 100
 25 ms 2768 KB 
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
    //freopen ("divide.in","r",stdin);
    //freopen ("divide.out","w",stdout);
    int n,x[100010],g[100010],d[100010],i,j,sg=0,sg1,s=0,s1,ans=0;
    cin>>n;
    for (i=0;i<n;i++)
    {
        cin>>x[i]>>g[i]>>d[i];
        s+=d[i];
        sg+=g[i];
    }
    for (i=0;i<n;i++)
    {
        s1=s;
        sg1=sg;
        for (j=n-1;j>=i;j--)
        {
            if (i==j || (x[j]-x[i]==s1))
            {
                ans=max(ans,sg1);
            }
            s1-=d[j];
            sg1-=g[j];
        }
        s-=d[i];
        sg-=g[i];
    }
    cout<<ans<<endl;
    return 0;
}

Subtask #1
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2768 KB Output is correct
2 Incorrect 0 ms 2764 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 52.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 2760 KB Output isn't correct
2 Halted 0 ms 0 KB -