oj.uz

Submission #706300

# Submission time Handle Problem Language Result Execution time Memory
706300 2023-03-06T09:09:12 Z bebra Bulldozer (JOI17_bulldozer) C++17
0 / 100
 37 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define dbg(x) cerr << #x << ": " << x << endl;


struct Point {
    ll x;
    ll y;
    ll cost;

    Point(ll _x = 0, ll _y = 0, ll _cost = 0) : x(_x), y(_y), cost(_cost) {}
};


struct Vec {
    ll x;
    ll y;

    Vec(ll _x = 0, ll _y = 0) : x(_x), y(_y) {}

    Vec(const Point& p1, const Point& p2) {
        x = p2.x - p1.x;
        y = p2.y - p1.y;
    }

    ll operator*(const Vec& other) const {
        return x * other.x + y * other.y;
    }

    ll operator^(const Vec& other) const {
        return x * other.y - other.x * y;
    }
};


struct Line {
    ll a;
    ll b;
    ll c;

    Line(ll _a = 0, ll _b = 0, ll _c = 0) : a(_a), b(_b), c(_c) {}

    Line(const Point& p1, const Point& p2) {
        a = p2.y - p1.y;
        b = p1.x - p2.x;
        c = p2.x * p1.y - p1.x * p2.y;
    }

    Line(const Line& line, const Point& p) {
        a = line.a;
        b = line.b;
        c = -p.x * a - p.y * b;
    }

    Line get_orthogonal() const {
        return {-b, a, c};
    }

    ll get(const Point& p) {
        return a * p.x + b * p.y + c;
    }
};


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    ll ans = 0;

    vector<Point> points(n);
    for (auto& [x, y, cost] : points) {
        cin >> x >> y >> cost;
        ans = max(ans, cost);
    }

    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            Line line(points[i], points[j]);
            ll c = points[i].cost + points[j].cost;
            // sorting by distance to the line
            vector<vector<Point>> a(2);
            ans = max(ans, points[i].cost + points[j].cost);
            for (const auto& p : points) {
                if (line.get(p) > 0) {
                    a[0].push_back(p);
                } else if (line.get(p) < 0) {
                    a[1].push_back(p);
                }
            }
            vector<ll> max_pref(2);
            for (int t = 0; t <= 1; ++t) {
                sort(a[t].begin(), a[t].end(), [&](const auto& p1, const auto& p2) {
                    return abs(line.get(p1)) < abs(line.get(p2));
                });
                ll pref = c;
                ll min_pref = min(0LL, pref);
                max_pref[t] = max(0LL, pref);
                for (const auto& p : a[t]) {
                    pref += p.cost;
                    min_pref = min(min_pref, pref);
                    max_pref[t] = max(max_pref[t], pref);
                    ans = max(ans, pref - min_pref);
                }
            }
            // ans = max(ans, max_pref[0] + max_pref[1] - c);
        }
    }
    cout << ans << '\n';

    return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 212 KB Output is correct
2 Correct 29 ms 212 KB Output is correct
3 Correct 26 ms 212 KB Output is correct
4 Correct 29 ms 212 KB Output is correct
5 Correct 37 ms 212 KB Output is correct
6 Correct 27 ms 328 KB Output is correct
7 Correct 35 ms 324 KB Output is correct
8 Correct 28 ms 212 KB Output is correct
9 Correct 28 ms 212 KB Output is correct
10 Correct 32 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 25 ms 328 KB Output is correct
22 Correct 24 ms 332 KB Output is correct
23 Correct 25 ms 332 KB Output is correct
24 Correct 26 ms 332 KB Output is correct
25 Incorrect 29 ms 212 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 212 KB Output is correct
2 Correct 29 ms 212 KB Output is correct
3 Correct 26 ms 212 KB Output is correct
4 Correct 29 ms 212 KB Output is correct
5 Correct 37 ms 212 KB Output is correct
6 Correct 27 ms 328 KB Output is correct
7 Correct 35 ms 324 KB Output is correct
8 Correct 28 ms 212 KB Output is correct
9 Correct 28 ms 212 KB Output is correct
10 Correct 32 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 25 ms 328 KB Output is correct
22 Correct 24 ms 332 KB Output is correct
23 Correct 25 ms 332 KB Output is correct
24 Correct 26 ms 332 KB Output is correct
25 Incorrect 29 ms 212 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 212 KB Output is correct
2 Correct 29 ms 212 KB Output is correct
3 Correct 26 ms 212 KB Output is correct
4 Correct 29 ms 212 KB Output is correct
5 Correct 37 ms 212 KB Output is correct
6 Correct 27 ms 328 KB Output is correct
7 Correct 35 ms 324 KB Output is correct
8 Correct 28 ms 212 KB Output is correct
9 Correct 28 ms 212 KB Output is correct
10 Correct 32 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 25 ms 328 KB Output is correct
22 Correct 24 ms 332 KB Output is correct
23 Correct 25 ms 332 KB Output is correct
24 Correct 26 ms 332 KB Output is correct
25 Incorrect 29 ms 212 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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