제출 #1278684

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1278684		thieunguyenhuy	Bulldozer (JOI17_bulldozer)	C++20	5 / 100	1 ms	580 KiB

bulldozer

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

#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2> bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T> void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
    return uniform_int_distribution<long long>(l, r)(rng);
}
unsigned long long random(unsigned long long l, unsigned long long r) {
    return uniform_int_distribution<unsigned long long>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

int n;

struct Spot {
	int x, y, w;

	Spot(int _x = 0, int _y = 0, int _w = 0) {
		x = _x, y = _y, w = _w;
	}
};

ll solve(vector<Spot> &spots) {
	sort (spots.begin(), spots.end(), [&](Spot x, Spot y) {
		return x.x < y.x;
	});

	vector<ll> values;
	for (int i = 0, j = -1; i < n; i = j + 1) {
		ll sum = 0;
		while (j + 1 < n && spots[j + 1].x == spots[i].x) ++j, sum += spots[j].w;
		values.emplace_back(sum);
	}

	ll ans = 0;
	for (int i = 0; i < values.size(); ++i) {
		ll sum = 0;
		for (int j = i; j < values.size(); ++j) maximize(ans, sum += values[j]);
	}

	return ans;
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    cin >> n;

    vector<Spot> spots;
    for (int i = 1; i <= n; ++i) {
    	int x, y, w; cin >> x >> y >> w;
    	spots.emplace_back(x, y, w);
    }

    ll ans = solve(spots);
    for (auto &x : spots) swap(x.x, x.y);
    maximize(ans, solve(spots));

	cout << ans;
    return 0;
}

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