oj.uz

Submission #127568

# Submission time Handle Problem Language Result Execution time Memory
127568 2019-07-09T15:08:55 Z arnold518 Bulldozer (JOI17_bulldozer) C++14
60 / 100
 1412 ms 50124 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2000;

struct Mine
{
    ll x, y, w;
};

struct Line
{
    ll x, y;
    int m1, m2;
};

int n, pos[MAXN+10];
Mine mine[MAXN+10];
ll arr[MAXN+10], ans;

ll val[4*MAXN+10], lsum[4*MAXN+10], rsum[4*MAXN+10], sum[4*MAXN+10];

void update(int node, int tl, int tr, int pos, ll dif)
{
    if(pos<tl || tr<pos) return;
    if(tl==tr)
    {
        sum[node]=dif;
        val[node]=max(0ll, sum[node]);
        lsum[node]=max(0ll, sum[node]);
        rsum[node]=max(0ll, sum[node]);
        return;
    }
    int mid=tl+tr>>1;
    update(node*2, tl, mid, pos, dif);
    update(node*2+1, mid+1, tr, pos, dif);

    lsum[node]=max(lsum[node*2], sum[node*2]+lsum[node*2+1]);
    rsum[node]=max(rsum[node*2+1], sum[node*2+1]+rsum[node*2]);
    sum[node]=sum[node*2]+sum[node*2+1];
    val[node]=max(rsum[node*2]+lsum[node*2+1], max(val[node*2], val[node*2+1]));
}

ll query() { return val[1]; }

int main()
{
    int i, j;

    scanf("%d", &n);
    for(i=1; i<=n; i++) scanf("%lld%lld%lld", &mine[i].x, &mine[i].y, &mine[i].w);
    sort(mine+1, mine+n+1, [&](const Mine p, const Mine q)
        {
            if(p.x!=q.x) return p.x<q.x;
            return p.y<q.y;
        });

    for(i=1; i<=n; i++)
    {
        pos[i]=i;
        update(1, 1, n, i, mine[i].w);
    }
    ans=query();

    vector<Line> L;
    for(i=1; i<=n; i++) for(j=i+1; j<=n; j++)
    {
        Line now={mine[i].x-mine[j].x, mine[i].y-mine[j].y, i, j};
        if(now.x<0) now.x*=-1, now.y*=-1;
        if(now.x==0 && now.y>0) now.y*=-1;
        L.push_back(now);
    }
    sort(L.begin(), L.end(), [&](const Line p, const Line q)
        {
            if(q.x*p.y!=p.x*q.y) return q.x*p.y<p.x*q.y;
            if(p.m1!=q.m1) return p.m1<q.m1;
            return p.m2<q.m2;
        });

    for(i=0; i<L.size(); )
    {
        ll x=L[i].x, y=L[i].y;
        while(i<L.size() && L[i].x*y==L[i].y*x)
        {
            int m1=L[i].m1, m2=L[i].m2;
            update(1, 1, n, pos[m1], mine[m2].w);
            update(1, 1, n, pos[m2], mine[m1].w);
            swap(pos[m1], pos[m2]);
            i++;
        }
        ans=max(ans, query());
    }
    printf("%lld", ans);
}

Compilation message

bulldozer.cpp: In function 'void update(int, int, int, int, ll)':
bulldozer.cpp:38:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
bulldozer.cpp: In function 'int main()':
bulldozer.cpp:84:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0; i<L.size(); )
              ~^~~~~~~~~
bulldozer.cpp:87:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(i<L.size() && L[i].x*y==L[i].y*x)
               ~^~~~~~~~~
bulldozer.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
bulldozer.cpp:55:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1; i<=n; i++) scanf("%lld%lld%lld", &mine[i].x, &mine[i].y, &mine[i].w);
                         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 620 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 4 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 5 ms 696 KB Output is correct
8 Correct 5 ms 636 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 2 ms 400 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 4 ms 632 KB Output is correct
22 Correct 4 ms 632 KB Output is correct
23 Correct 4 ms 632 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 4 ms 632 KB Output is correct
26 Correct 4 ms 632 KB Output is correct
27 Correct 4 ms 632 KB Output is correct
28 Correct 5 ms 632 KB Output is correct
29 Correct 4 ms 632 KB Output is correct
30 Correct 4 ms 632 KB Output is correct
31 Correct 4 ms 632 KB Output is correct
32 Correct 4 ms 632 KB Output is correct
33 Correct 1364 ms 50124 KB Output is correct
34 Correct 1352 ms 49964 KB Output is correct
35 Correct 1351 ms 49968 KB Output is correct
36 Correct 1368 ms 49964 KB Output is correct
37 Correct 1351 ms 49968 KB Output is correct
38 Correct 1337 ms 49968 KB Output is correct
39 Correct 1352 ms 49964 KB Output is correct
40 Correct 1349 ms 49964 KB Output is correct
41 Correct 1353 ms 49964 KB Output is correct
42 Correct 1346 ms 49964 KB Output is correct
43 Correct 1337 ms 50092 KB Output is correct
44 Correct 1339 ms 49984 KB Output is correct
45 Correct 1336 ms 49964 KB Output is correct
46 Correct 1355 ms 49964 KB Output is correct
47 Correct 1362 ms 49964 KB Output is correct
48 Correct 1345 ms 49908 KB Output is correct
49 Correct 1356 ms 49960 KB Output is correct
50 Correct 1410 ms 50092 KB Output is correct
51 Correct 1348 ms 50092 KB Output is correct
52 Correct 1333 ms 49964 KB Output is correct
53 Correct 1339 ms 49936 KB Output is correct
54 Correct 1331 ms 49964 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 620 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 4 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 5 ms 696 KB Output is correct
8 Correct 5 ms 636 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 2 ms 400 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 4 ms 632 KB Output is correct
22 Correct 4 ms 632 KB Output is correct
23 Correct 4 ms 632 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 4 ms 632 KB Output is correct
26 Correct 4 ms 632 KB Output is correct
27 Correct 4 ms 632 KB Output is correct
28 Correct 5 ms 632 KB Output is correct
29 Correct 4 ms 632 KB Output is correct
30 Correct 4 ms 632 KB Output is correct
31 Correct 4 ms 632 KB Output is correct
32 Correct 4 ms 632 KB Output is correct
33 Correct 1364 ms 50124 KB Output is correct
34 Correct 1352 ms 49964 KB Output is correct
35 Correct 1351 ms 49968 KB Output is correct
36 Correct 1368 ms 49964 KB Output is correct
37 Correct 1351 ms 49968 KB Output is correct
38 Correct 1337 ms 49968 KB Output is correct
39 Correct 1352 ms 49964 KB Output is correct
40 Correct 1349 ms 49964 KB Output is correct
41 Correct 1353 ms 49964 KB Output is correct
42 Correct 1346 ms 49964 KB Output is correct
43 Correct 1337 ms 50092 KB Output is correct
44 Correct 1339 ms 49984 KB Output is correct
45 Correct 1336 ms 49964 KB Output is correct
46 Correct 1355 ms 49964 KB Output is correct
47 Correct 1362 ms 49964 KB Output is correct
48 Correct 1345 ms 49908 KB Output is correct
49 Correct 1356 ms 49960 KB Output is correct
50 Correct 1410 ms 50092 KB Output is correct
51 Correct 1348 ms 50092 KB Output is correct
52 Correct 1333 ms 49964 KB Output is correct
53 Correct 1339 ms 49936 KB Output is correct
54 Correct 1331 ms 49964 KB Output is correct
55 Correct 1346 ms 49932 KB Output is correct
56 Correct 1359 ms 49964 KB Output is correct
57 Correct 1412 ms 49964 KB Output is correct
58 Correct 1342 ms 49964 KB Output is correct
59 Correct 1356 ms 49964 KB Output is correct
60 Correct 1354 ms 50016 KB Output is correct
61 Correct 1354 ms 49964 KB Output is correct
62 Correct 1369 ms 49836 KB Output is correct
63 Correct 1363 ms 49960 KB Output is correct
64 Correct 1347 ms 49964 KB Output is correct
65 Incorrect 1372 ms 49836 KB Output isn't correct
66 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 632 KB Output is correct
2 Correct 4 ms 632 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 4 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 4 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 4 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 5 ms 620 KB Output is correct
18 Correct 4 ms 632 KB Output is correct
19 Correct 4 ms 632 KB Output is correct
20 Correct 4 ms 632 KB Output is correct
21 Correct 4 ms 632 KB Output is correct
22 Correct 5 ms 696 KB Output is correct
23 Correct 5 ms 636 KB Output is correct
24 Correct 5 ms 632 KB Output is correct
25 Correct 4 ms 632 KB Output is correct
26 Correct 2 ms 400 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 4 ms 632 KB Output is correct
37 Correct 4 ms 632 KB Output is correct
38 Correct 4 ms 632 KB Output is correct
39 Correct 4 ms 632 KB Output is correct
40 Correct 4 ms 632 KB Output is correct
41 Correct 4 ms 632 KB Output is correct
42 Correct 4 ms 632 KB Output is correct
43 Correct 5 ms 632 KB Output is correct
44 Correct 4 ms 632 KB Output is correct
45 Correct 4 ms 632 KB Output is correct
46 Correct 4 ms 632 KB Output is correct
47 Correct 4 ms 632 KB Output is correct
48 Correct 1364 ms 50124 KB Output is correct
49 Correct 1352 ms 49964 KB Output is correct
50 Correct 1351 ms 49968 KB Output is correct
51 Correct 1368 ms 49964 KB Output is correct
52 Correct 1351 ms 49968 KB Output is correct
53 Correct 1337 ms 49968 KB Output is correct
54 Correct 1352 ms 49964 KB Output is correct
55 Correct 1349 ms 49964 KB Output is correct
56 Correct 1353 ms 49964 KB Output is correct
57 Correct 1346 ms 49964 KB Output is correct
58 Correct 1337 ms 50092 KB Output is correct
59 Correct 1339 ms 49984 KB Output is correct
60 Correct 1336 ms 49964 KB Output is correct
61 Correct 1355 ms 49964 KB Output is correct
62 Correct 1362 ms 49964 KB Output is correct
63 Correct 1345 ms 49908 KB Output is correct
64 Correct 1356 ms 49960 KB Output is correct
65 Correct 1410 ms 50092 KB Output is correct
66 Correct 1348 ms 50092 KB Output is correct
67 Correct 1333 ms 49964 KB Output is correct
68 Correct 1339 ms 49936 KB Output is correct
69 Correct 1331 ms 49964 KB Output is correct
70 Correct 1346 ms 49932 KB Output is correct
71 Correct 1359 ms 49964 KB Output is correct
72 Correct 1412 ms 49964 KB Output is correct
73 Correct 1342 ms 49964 KB Output is correct
74 Correct 1356 ms 49964 KB Output is correct
75 Correct 1354 ms 50016 KB Output is correct
76 Correct 1354 ms 49964 KB Output is correct
77 Correct 1369 ms 49836 KB Output is correct
78 Correct 1363 ms 49960 KB Output is correct
79 Correct 1347 ms 49964 KB Output is correct
80 Incorrect 1372 ms 49836 KB Output isn't correct
81 Halted 0 ms 0 KB -