oj.uz

Submission #927387

# Submission time Handle Problem Language Result Execution time Memory
927387 2024-02-14T19:31:14 Z DAleksa Bulldozer (JOI17_bulldozer) C++17
80 / 100
 893 ms 68264 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

struct point {
    int x;
    int y;
    int w;
    bool operator < (point p) {
        if(x == p.x) return y > p.y;
        return x < p.x;
    }
};

struct frac {
    int p;
    int q;
    frac() { }
    frac(int _p, int _q) { p = _p; q = _q; }
};

struct node {
    long long mx;
    long long pref;
    long long suff;
    long long sum;
};

bool operator < (frac a, frac b) { return a.p * 1LL * b.q < b.p * 1LL * a.q; }
bool operator == (frac a, frac b) { return a.p * 1LL * b.q == a.q * 1LL * b.p; }
bool operator != (frac a, frac b) { return !(a == b); }

const int N = 2010;
int n;
point a[N];
vector<pair<frac, pair<int, int>>> slopes;
int order[N], pos[N];
node st[4 * N];

void update(int index, int l, int r, int x, int val) {
    if(l > r || r < x || x < l) return;
    if(l == r) {
        st[index].mx = st[index].pref = st[index].suff = max(val, 0LL);
        st[index].sum = val;
        return;
    }
    int mid = (l + r) / 2;
    if(x <= mid) update(2 * index, l, mid, x, val);
    else update(2 * index + 1, mid + 1, r, x, val);
    st[index].mx = max({st[2 * index].mx, st[2 * index + 1].mx, st[2 * index].suff + st[2 * index + 1].pref});
    st[index].pref = max(st[2 * index].pref, st[2 * index].sum + st[2 * index + 1].pref);
    st[index].suff = max(st[2 * index + 1].suff, st[2 * index + 1].sum + st[2 * index].suff);
    st[index].sum = st[2 * index].sum + st[2 * index + 1].sum;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i].x >> a[i].y >> a[i].w;
    for(int i = 1; i <= n; i++) {
        for(int j = i + 1; j <= n; j++) {
            int sign = 1;
            int dx = a[i].x - a[j].x, dy = a[i].y - a[j].y;
            if(dx < 0) sign *= -1;
            if(dy < 0) sign *= -1;
            dx = abs(dx);
            dy = abs(dy);
            int g = __gcd(dx, dy);
            dx /= g;
            dy /= g;
            if(dx != 0) dy *= sign;
            if(a[i] < a[j]) slopes.push_back({frac(dy, dx), {i, j}});
            else slopes.push_back({frac(dy, dx), {j, i}});
        }
    }
    sort(slopes.begin(), slopes.end(), [&](pair<frac, pair<int, int>> x, pair<frac, pair<int, int>> y) {
        if(x.first == y.first) {
            pair<int, int> i = x.second, j = y.second;
            if(i.first == j.first) return a[i.second] < a[j.second];
            return a[i.first] < a[j.first];
        }
        return x.first < y.first;
    });
    for(int i = 1; i <= n; i++) order[i] = i;
    sort(order + 1, order + n + 1, [&](int i, int j) {
        return a[i] < a[j];
    });
    for(int i = 1; i <= n; i++) pos[order[i]] = i;
    for(int i = 1; i <= n; i++) update(1, 1, n, i, a[order[i]].w);
    long long ans = 0;
    pair<frac, pair<int, int>> lst;
    lst.first = frac(-1, -1);
    for(pair<frac, pair<int, int>> slope : slopes) {
        if(slope.first != lst.first) ans = max(ans, st[1].mx);
        {
            int i = slope.second.first, j = slope.second.second;
            if(pos[i] < pos[j]) {
                update(1, 1, n, pos[i], a[order[pos[j]]].w);
                update(1, 1, n, pos[j], a[order[pos[i]]].w);
                swap(order[pos[i]], order[pos[j]]);
                swap(pos[i], pos[j]);
            }
        }
        lst = slope;
    }
    ans = max(ans, st[1].mx);
    cout << ans;
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 856 KB Output is correct
9 Correct 2 ms 856 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 856 KB Output is correct
32 Correct 2 ms 856 KB Output is correct
33 Correct 860 ms 67476 KB Output is correct
34 Correct 851 ms 66212 KB Output is correct
35 Correct 863 ms 67500 KB Output is correct
36 Correct 860 ms 67264 KB Output is correct
37 Correct 854 ms 66980 KB Output is correct
38 Correct 855 ms 66724 KB Output is correct
39 Correct 860 ms 66724 KB Output is correct
40 Correct 859 ms 67172 KB Output is correct
41 Correct 858 ms 67708 KB Output is correct
42 Correct 870 ms 68012 KB Output is correct
43 Correct 831 ms 67492 KB Output is correct
44 Correct 814 ms 66652 KB Output is correct
45 Correct 830 ms 67108 KB Output is correct
46 Correct 828 ms 66992 KB Output is correct
47 Correct 831 ms 66216 KB Output is correct
48 Correct 836 ms 68012 KB Output is correct
49 Correct 838 ms 66728 KB Output is correct
50 Correct 834 ms 68264 KB Output is correct
51 Correct 838 ms 66892 KB Output is correct
52 Correct 825 ms 67884 KB Output is correct
53 Correct 818 ms 66728 KB Output is correct
54 Correct 817 ms 66728 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 856 KB Output is correct
9 Correct 2 ms 856 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 856 KB Output is correct
32 Correct 2 ms 856 KB Output is correct
33 Correct 860 ms 67476 KB Output is correct
34 Correct 851 ms 66212 KB Output is correct
35 Correct 863 ms 67500 KB Output is correct
36 Correct 860 ms 67264 KB Output is correct
37 Correct 854 ms 66980 KB Output is correct
38 Correct 855 ms 66724 KB Output is correct
39 Correct 860 ms 66724 KB Output is correct
40 Correct 859 ms 67172 KB Output is correct
41 Correct 858 ms 67708 KB Output is correct
42 Correct 870 ms 68012 KB Output is correct
43 Correct 831 ms 67492 KB Output is correct
44 Correct 814 ms 66652 KB Output is correct
45 Correct 830 ms 67108 KB Output is correct
46 Correct 828 ms 66992 KB Output is correct
47 Correct 831 ms 66216 KB Output is correct
48 Correct 836 ms 68012 KB Output is correct
49 Correct 838 ms 66728 KB Output is correct
50 Correct 834 ms 68264 KB Output is correct
51 Correct 838 ms 66892 KB Output is correct
52 Correct 825 ms 67884 KB Output is correct
53 Correct 818 ms 66728 KB Output is correct
54 Correct 817 ms 66728 KB Output is correct
55 Correct 875 ms 66776 KB Output is correct
56 Correct 863 ms 66160 KB Output is correct
57 Correct 866 ms 66948 KB Output is correct
58 Correct 868 ms 68008 KB Output is correct
59 Correct 881 ms 66720 KB Output is correct
60 Correct 893 ms 66980 KB Output is correct
61 Correct 878 ms 67900 KB Output is correct
62 Correct 888 ms 68200 KB Output is correct
63 Correct 860 ms 67748 KB Output is correct
64 Correct 871 ms 67200 KB Output is correct
65 Correct 853 ms 67204 KB Output is correct
66 Correct 855 ms 67244 KB Output is correct
67 Correct 872 ms 66280 KB Output is correct
68 Correct 875 ms 66728 KB Output is correct
69 Correct 879 ms 67444 KB Output is correct
70 Correct 880 ms 66972 KB Output is correct
71 Correct 887 ms 67104 KB Output is correct
72 Correct 863 ms 67972 KB Output is correct
73 Correct 859 ms 67652 KB Output is correct
74 Correct 866 ms 67212 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 2 ms 860 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 2 ms 856 KB Output is correct
24 Correct 2 ms 856 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 2 ms 860 KB Output is correct
39 Correct 2 ms 860 KB Output is correct
40 Correct 2 ms 860 KB Output is correct
41 Correct 2 ms 860 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 2 ms 860 KB Output is correct
44 Correct 2 ms 860 KB Output is correct
45 Correct 2 ms 860 KB Output is correct
46 Correct 2 ms 856 KB Output is correct
47 Correct 2 ms 856 KB Output is correct
48 Correct 860 ms 67476 KB Output is correct
49 Correct 851 ms 66212 KB Output is correct
50 Correct 863 ms 67500 KB Output is correct
51 Correct 860 ms 67264 KB Output is correct
52 Correct 854 ms 66980 KB Output is correct
53 Correct 855 ms 66724 KB Output is correct
54 Correct 860 ms 66724 KB Output is correct
55 Correct 859 ms 67172 KB Output is correct
56 Correct 858 ms 67708 KB Output is correct
57 Correct 870 ms 68012 KB Output is correct
58 Correct 831 ms 67492 KB Output is correct
59 Correct 814 ms 66652 KB Output is correct
60 Correct 830 ms 67108 KB Output is correct
61 Correct 828 ms 66992 KB Output is correct
62 Correct 831 ms 66216 KB Output is correct
63 Correct 836 ms 68012 KB Output is correct
64 Correct 838 ms 66728 KB Output is correct
65 Correct 834 ms 68264 KB Output is correct
66 Correct 838 ms 66892 KB Output is correct
67 Correct 825 ms 67884 KB Output is correct
68 Correct 818 ms 66728 KB Output is correct
69 Correct 817 ms 66728 KB Output is correct
70 Correct 875 ms 66776 KB Output is correct
71 Correct 863 ms 66160 KB Output is correct
72 Correct 866 ms 66948 KB Output is correct
73 Correct 868 ms 68008 KB Output is correct
74 Correct 881 ms 66720 KB Output is correct
75 Correct 893 ms 66980 KB Output is correct
76 Correct 878 ms 67900 KB Output is correct
77 Correct 888 ms 68200 KB Output is correct
78 Correct 860 ms 67748 KB Output is correct
79 Correct 871 ms 67200 KB Output is correct
80 Correct 853 ms 67204 KB Output is correct
81 Correct 855 ms 67244 KB Output is correct
82 Correct 872 ms 66280 KB Output is correct
83 Correct 875 ms 66728 KB Output is correct
84 Correct 879 ms 67444 KB Output is correct
85 Correct 880 ms 66972 KB Output is correct
86 Correct 887 ms 67104 KB Output is correct
87 Correct 863 ms 67972 KB Output is correct
88 Correct 859 ms 67652 KB Output is correct
89 Correct 866 ms 67212 KB Output is correct
90 Correct 863 ms 66464 KB Output is correct
91 Correct 866 ms 67132 KB Output is correct
92 Correct 871 ms 67620 KB Output is correct
93 Correct 866 ms 67496 KB Output is correct
94 Correct 858 ms 68116 KB Output is correct
95 Correct 853 ms 67492 KB Output is correct
96 Correct 878 ms 66216 KB Output is correct
97 Correct 860 ms 68008 KB Output is correct
98 Correct 856 ms 66408 KB Output is correct
99 Correct 865 ms 67776 KB Output is correct
100 Incorrect 340 ms 66980 KB Output isn't correct
101 Halted 0 ms 0 KB -