oj.uz

Submission #104160

# Submission time Handle Problem Language Result Execution time Memory
104160 2019-04-04T09:05:03 Z Bodo171 Bulldozer (JOI17_bulldozer) C++14
75 / 100
 1138 ms 47608 KB 
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int nmax=2005;
struct point
{
    long long x,y,val;
}v[nmax];
struct line
{
    long long nr,nm;
    int i1,i2;
}pp[nmax*nmax/2];
struct node
{
    long long mxsuf,mxpref,sum,mx;
}arb[4*nmax],ans;
//pair<long long,long long> lin=make_pair(-2*1000*1000*1000-1,1);
bool compP(point unu,point doi)
{
    if(unu.x==doi.x) return unu.y>doi.y;
    return (unu.x>doi.x);
  //  return (1LL*unu.x*lin.first+1LL*unu.y*lin.second<1LL*doi.x*lin.first+1LL*doi.y*lin.second);
}
bool compL(line unu,line doi)
{
    return (1LL*unu.nr*doi.nm<1LL*unu.nm*doi.nr);
}
int ord[nmax];
long long A[nmax];
int n,i,j,nr,I,J,poz;
long long act,mx;
void mrg(node &A,node B,node C)
{
    A.sum=1LL*B.sum+C.sum;
    A.mxpref=max(B.mxpref,B.sum+C.mxpref);
    A.mxsuf=max(C.mxsuf,C.sum+B.mxsuf);
    A.mx=max(B.mx,C.mx);
    A.mx=max(A.mx,B.mxsuf+C.mxpref);
}
void update(int nod,int l,int r,int poz,long long val)
{
    if(l==r)
    {
        arb[nod].mx=max(val,0LL);
        arb[nod].mxpref=arb[nod].mxsuf=max(val,0LL);
        arb[nod].sum=val;
        return;
    }
    int m=(l+r)/2;
    if(poz<=m) update(2*nod,l,m,poz,val);
    else update(2*nod+1,m+1,r,poz,val);
    mrg(arb[nod],arb[2*nod],arb[2*nod+1]);
}
int abss(int x)
{
    if(x<0) return -x;
    return x;
}
int main()
{
    //freopen("data.in","r",stdin);
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>v[i].x>>v[i].y>>v[i].val;
    }
    sort(v+1,v+n+1,compP);
    for(i=1;i<=n;i++)
    {
        ord[i]=i;
        update(1,1,n,i,v[i].val);
    }
    for(i=1;i<=n;i++)
        for(j=i+1;j<=n;j++)
            if(v[i].x!=v[j].x)
    {
        pp[++nr]={v[j].y-v[i].y,v[j].x-v[i].x,i,j};
        if(pp[nr].nm<0)
            pp[nr].nr*=-1,pp[nr].nm*=-1;
    }
    mx=arb[1].mx;
    sort(pp+1,pp+nr+1,compL);
    int lim;
    for(i=1;i<=nr;i++)
    {
         for(j=i;j<=nr&&1LL*pp[i].nm*pp[j].nr==1LL*pp[i].nr*pp[j].nm;j++);
        j--;
        lim=j;
        for(j=i;j<=lim;j++)
        {
            I=pp[j].i1;
            J=pp[j].i2;
            swap(ord[I],ord[J]);
            poz=min(ord[I],ord[J]);
            update(1,1,n,ord[I],v[I].val);
            update(1,1,n,ord[J],v[J].val);
        }
        mx=max(mx,arb[1].mx);
        i=lim;
    }
    cout<<mx;
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Incorrect 3 ms 512 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 4 ms 512 KB Output is correct
22 Correct 4 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 4 ms 512 KB Output is correct
25 Correct 3 ms 560 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 4 ms 512 KB Output is correct
29 Correct 4 ms 512 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 4 ms 512 KB Output is correct
22 Correct 4 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 4 ms 512 KB Output is correct
25 Correct 3 ms 560 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 4 ms 512 KB Output is correct
29 Correct 4 ms 512 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 1004 ms 47600 KB Output is correct
34 Correct 1050 ms 47500 KB Output is correct
35 Correct 1024 ms 47496 KB Output is correct
36 Correct 1012 ms 47496 KB Output is correct
37 Correct 1014 ms 47492 KB Output is correct
38 Correct 989 ms 47608 KB Output is correct
39 Correct 998 ms 47496 KB Output is correct
40 Correct 998 ms 47496 KB Output is correct
41 Correct 990 ms 47608 KB Output is correct
42 Correct 994 ms 47496 KB Output is correct
43 Correct 1002 ms 47496 KB Output is correct
44 Correct 979 ms 47496 KB Output is correct
45 Correct 985 ms 47492 KB Output is correct
46 Correct 990 ms 47608 KB Output is correct
47 Correct 1020 ms 47508 KB Output is correct
48 Correct 1026 ms 47496 KB Output is correct
49 Correct 1018 ms 47496 KB Output is correct
50 Correct 988 ms 47496 KB Output is correct
51 Correct 1006 ms 47508 KB Output is correct
52 Correct 987 ms 47504 KB Output is correct
53 Correct 998 ms 47500 KB Output is correct
54 Correct 996 ms 47492 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 4 ms 512 KB Output is correct
22 Correct 4 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 4 ms 512 KB Output is correct
25 Correct 3 ms 560 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 4 ms 512 KB Output is correct
29 Correct 4 ms 512 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 1004 ms 47600 KB Output is correct
34 Correct 1050 ms 47500 KB Output is correct
35 Correct 1024 ms 47496 KB Output is correct
36 Correct 1012 ms 47496 KB Output is correct
37 Correct 1014 ms 47492 KB Output is correct
38 Correct 989 ms 47608 KB Output is correct
39 Correct 998 ms 47496 KB Output is correct
40 Correct 998 ms 47496 KB Output is correct
41 Correct 990 ms 47608 KB Output is correct
42 Correct 994 ms 47496 KB Output is correct
43 Correct 1002 ms 47496 KB Output is correct
44 Correct 979 ms 47496 KB Output is correct
45 Correct 985 ms 47492 KB Output is correct
46 Correct 990 ms 47608 KB Output is correct
47 Correct 1020 ms 47508 KB Output is correct
48 Correct 1026 ms 47496 KB Output is correct
49 Correct 1018 ms 47496 KB Output is correct
50 Correct 988 ms 47496 KB Output is correct
51 Correct 1006 ms 47508 KB Output is correct
52 Correct 987 ms 47504 KB Output is correct
53 Correct 998 ms 47500 KB Output is correct
54 Correct 996 ms 47492 KB Output is correct
55 Correct 1008 ms 47492 KB Output is correct
56 Correct 1022 ms 47496 KB Output is correct
57 Correct 1034 ms 47480 KB Output is correct
58 Correct 1008 ms 47496 KB Output is correct
59 Correct 998 ms 47492 KB Output is correct
60 Correct 991 ms 47480 KB Output is correct
61 Correct 993 ms 47496 KB Output is correct
62 Correct 1012 ms 47608 KB Output is correct
63 Correct 1030 ms 47500 KB Output is correct
64 Correct 1027 ms 47496 KB Output is correct
65 Correct 1031 ms 47484 KB Output is correct
66 Correct 1044 ms 47472 KB Output is correct
67 Correct 1039 ms 47476 KB Output is correct
68 Correct 1104 ms 47476 KB Output is correct
69 Correct 1076 ms 47476 KB Output is correct
70 Correct 1138 ms 47480 KB Output is correct
71 Correct 1022 ms 47544 KB Output is correct
72 Correct 1050 ms 47472 KB Output is correct
73 Correct 1026 ms 47480 KB Output is correct
74 Correct 984 ms 47480 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Incorrect 3 ms 512 KB Output isn't correct
7 Halted 0 ms 0 KB -