Submission #234127

#	Time	Username	Problem	Language	Result	Execution time	Memory
234127		RiscadoA	Bulldozer (JOI17_bulldozer)	C++14	0 / 100	5 ms	384 KiB

bulldozer

#include <bits/stdc++.h>

using namespace std;

struct Point {
    int64_t x, y, w;
};

int main() {
    //freopen("in.txt", "r", stdin);

    ios::sync_with_stdio(false);
    cin.tie(0);

    int N;
    vector<Point> P;

    cin >> N;
    P.resize(N);
    for (int i = 0; i < N; ++i) {
        cin >> P[i].x >> P[i].y >> P[i].w;
    }

    int64_t max_sum = 0;
    
    sort(P.begin(), P.end(), [](const Point& lhs, const Point& rhs) -> bool {
        return lhs.x < rhs.x;
    });

    for (int64_t i = 0, sum = 0; i < N; ++i) {
        if (P[i].w > P[i].w + sum) {
            sum = P[i].w;
        } else {
            sum += P[i].w;
        }

        max_sum = max(max_sum, sum);
    }

    sort(P.begin(), P.end(), [](const Point& lhs, const Point& rhs) -> bool {
        return lhs.y < rhs.y;
    });

    for (int64_t i = 0, sum = 0; i < N; ++i) {
        if (P[i].w > P[i].w + sum) {
            sum = P[i].w;
        } else {
            sum += P[i].w;
        }

        max_sum = max(max_sum, sum);
    }

    cout << max_sum << endl;
}

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