oj.uz

Submission #125660

# Submission time Handle Problem Language Result Execution time Memory
125660 2019-07-06T07:38:52 Z arnold518 Bulldozer (JOI17_bulldozer) C++14
55 / 100
 1164 ms 50244 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;

struct SEG
{
    ll ans[4*MAXN+10], lsum[4*MAXN+10], rsum[4*MAXN+10], sum[4*MAXN+10];

    SEG()
    {
        memset(ans, 0, sizeof(ans));
        memset(lsum, 0, sizeof(lsum));
        memset(rsum, 0, sizeof(rsum));
        memset(sum, 0, sizeof(sum));
    }

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

        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];
        ans[node]=max(max(0ll, rsum[node*2]+lsum[node*2+1]), max(ans[node*2], ans[node*2+1]));
    }

    ll query()
    {
        return ans[1];
    }
};
SEG seg;

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;
        arr[i]=mine[i].w;
        seg.update(1, 1, n, i, mine[i].w);
    }
    ans=seg.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;
        L.push_back(now);
    }
    sort(L.begin(), L.end(), [&](const Line p, const Line q)
        {
            return q.x*p.y<p.x*q.y;
        });

    for(i=0; i<L.size(); i++)
    {
        ll m1=L[i].m1, m2=L[i].m2;
        seg.update(1, 1, n, pos[m1], arr[pos[m2]]);
        seg.update(1, 1, n, pos[m2], arr[pos[m1]]);
        swap(arr[pos[m1]], arr[pos[m2]]);
        swap(pos[m1], pos[m2]);
        if(i+1==L.size() || L[i].x*L[i+1].y!=L[i].y*L[i+1].x) ans=max(ans, seg.query());
    }
    printf("%lld", ans);
}

Compilation message

bulldozer.cpp: In member function 'void SEG::update(int, int, int, int, ll)':
bulldozer.cpp:47:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int mid=tl+tr>>1;
                 ~~^~~
bulldozer.cpp: In function 'int main()':
bulldozer.cpp:96:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0; i<L.size(); i++)
              ~^~~~~~~~~
bulldozer.cpp:103:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(i+1==L.size() || L[i].x*L[i+1].y!=L[i].y*L[i+1].x) ans=max(ans, seg.query());
            ~~~^~~~~~~~~~
bulldozer.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
bulldozer.cpp:69: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
0 / 5.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 888 KB Output is correct
2 Correct 4 ms 888 KB Output is correct
3 Correct 4 ms 892 KB Output is correct
4 Correct 4 ms 888 KB Output is correct
5 Correct 4 ms 888 KB Output is correct
6 Correct 4 ms 888 KB Output is correct
7 Correct 4 ms 888 KB Output is correct
8 Correct 4 ms 952 KB Output is correct
9 Correct 4 ms 888 KB Output is correct
10 Correct 4 ms 888 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 508 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 2 ms 632 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 632 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 4 ms 888 KB Output is correct
22 Correct 4 ms 888 KB Output is correct
23 Correct 4 ms 892 KB Output is correct
24 Correct 4 ms 892 KB Output is correct
25 Correct 4 ms 888 KB Output is correct
26 Correct 4 ms 888 KB Output is correct
27 Correct 4 ms 888 KB Output is correct
28 Correct 4 ms 888 KB Output is correct
29 Correct 4 ms 888 KB Output is correct
30 Correct 4 ms 892 KB Output is correct
31 Correct 4 ms 888 KB Output is correct
32 Correct 4 ms 888 KB Output is correct
33 Correct 1140 ms 50092 KB Output is correct
34 Correct 1121 ms 50092 KB Output is correct
35 Correct 1139 ms 50096 KB Output is correct
36 Correct 1136 ms 50224 KB Output is correct
37 Correct 1133 ms 50024 KB Output is correct
38 Correct 1130 ms 50096 KB Output is correct
39 Correct 1142 ms 50092 KB Output is correct
40 Correct 1148 ms 50092 KB Output is correct
41 Correct 1125 ms 50092 KB Output is correct
42 Correct 1134 ms 50244 KB Output is correct
43 Correct 1126 ms 50092 KB Output is correct
44 Correct 1156 ms 50096 KB Output is correct
45 Correct 1129 ms 50088 KB Output is correct
46 Correct 1122 ms 50092 KB Output is correct
47 Correct 1130 ms 50096 KB Output is correct
48 Correct 1137 ms 50092 KB Output is correct
49 Correct 1164 ms 50092 KB Output is correct
50 Correct 1119 ms 50092 KB Output is correct
51 Correct 1120 ms 50092 KB Output is correct
52 Correct 1120 ms 50092 KB Output is correct
53 Correct 1126 ms 50092 KB Output is correct
54 Correct 1127 ms 50088 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 888 KB Output is correct
2 Correct 4 ms 888 KB Output is correct
3 Correct 4 ms 892 KB Output is correct
4 Correct 4 ms 888 KB Output is correct
5 Correct 4 ms 888 KB Output is correct
6 Correct 4 ms 888 KB Output is correct
7 Correct 4 ms 888 KB Output is correct
8 Correct 4 ms 952 KB Output is correct
9 Correct 4 ms 888 KB Output is correct
10 Correct 4 ms 888 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 508 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 2 ms 632 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 632 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 4 ms 888 KB Output is correct
22 Correct 4 ms 888 KB Output is correct
23 Correct 4 ms 892 KB Output is correct
24 Correct 4 ms 892 KB Output is correct
25 Correct 4 ms 888 KB Output is correct
26 Correct 4 ms 888 KB Output is correct
27 Correct 4 ms 888 KB Output is correct
28 Correct 4 ms 888 KB Output is correct
29 Correct 4 ms 888 KB Output is correct
30 Correct 4 ms 892 KB Output is correct
31 Correct 4 ms 888 KB Output is correct
32 Correct 4 ms 888 KB Output is correct
33 Correct 1140 ms 50092 KB Output is correct
34 Correct 1121 ms 50092 KB Output is correct
35 Correct 1139 ms 50096 KB Output is correct
36 Correct 1136 ms 50224 KB Output is correct
37 Correct 1133 ms 50024 KB Output is correct
38 Correct 1130 ms 50096 KB Output is correct
39 Correct 1142 ms 50092 KB Output is correct
40 Correct 1148 ms 50092 KB Output is correct
41 Correct 1125 ms 50092 KB Output is correct
42 Correct 1134 ms 50244 KB Output is correct
43 Correct 1126 ms 50092 KB Output is correct
44 Correct 1156 ms 50096 KB Output is correct
45 Correct 1129 ms 50088 KB Output is correct
46 Correct 1122 ms 50092 KB Output is correct
47 Correct 1130 ms 50096 KB Output is correct
48 Correct 1137 ms 50092 KB Output is correct
49 Correct 1164 ms 50092 KB Output is correct
50 Correct 1119 ms 50092 KB Output is correct
51 Correct 1120 ms 50092 KB Output is correct
52 Correct 1120 ms 50092 KB Output is correct
53 Correct 1126 ms 50092 KB Output is correct
54 Correct 1127 ms 50088 KB Output is correct
55 Correct 1132 ms 50096 KB Output is correct
56 Correct 1134 ms 50224 KB Output is correct
57 Correct 1141 ms 50092 KB Output is correct
58 Correct 1142 ms 50088 KB Output is correct
59 Correct 1128 ms 50092 KB Output is correct
60 Correct 1131 ms 50188 KB Output is correct
61 Correct 1145 ms 50136 KB Output is correct
62 Correct 1135 ms 50056 KB Output is correct
63 Correct 1140 ms 50136 KB Output is correct
64 Correct 1135 ms 50092 KB Output is correct
65 Incorrect 1144 ms 50096 KB Output isn't correct
66 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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