Submission #1117598

#	Time	Username	Problem	Language	Result	Execution time	Memory
1117598		Pannda	Bulldozer (JOI17_bulldozer)	C++17	5 / 100	37 ms	516 KiB

bulldozer

#include <bits/stdc++.h>
using namespace std;

typedef complex<long long> point;

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

    int n;
    cin >> n;
    vector<pair<point, int>> a;
    for (int i = 0; i < n; i++) {
        int x, y, w;
        cin >> x >> y >> w;
        a.emplace_back(point(x, y), w);
    }

    if (n == 1) {
        cout << max(0, a[0].second) << '\n';
        return 0;
    }

//    sort(a.begin(), a.end(), [&](auto x, auto y) {
//        if (x.first.real() != y.first.real()) return x.first.real() < y.first.real();
//        return x.first.imag() < y.first.imag();
//    });

    long long ans = 0;
    for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (i != j) {
        point line = a[i].first - a[j].first;
        vector<pair<point, int>> b = a;
        sort(b.begin(), b.end(), [&](auto xw, auto yw) {
            point x = xw. first, y = yw.first;
            point X(line.real() * x.real() + line.imag() * x.imag(), -line.imag() * x.real() + line.real() * x.imag());
            point Y(line.real() * y.real() + line.imag() * y.imag(), -line.imag() * y.real() + line.real() * y.imag());
            if (X.real() != Y.real()) return X.real() < Y.real();
            return X.imag() < Y.imag();
        });
        long long sum = 0;
        long long mnsum = 0;
        for (auto [p, w] : b) {
            sum += w;
            ans = max(ans, sum - mnsum);
            mnsum = min(mnsum, sum);
        }
    }

    cout << ans << '\n';
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 20
• Subtask 3: 0 / 35
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20