Submission #41733

#	Time	Username	Problem	Language	Result	Execution time	Memory
41733		RockyB	Bulldozer (JOI17_bulldozer)	C++14	5 / 100	3 ms	384 KiB

bulldozer

/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;


int n;
int a[N];
int x[N], y[N];

namespace Y0 {
	void solve() {
		for (int i = 1; i <= n; i++) {
			if (y[i] != 0) return;
		}
		map <int, int> cnt;
		for (int i = 1; i <= n; i++) {
			cnt[x[i]] += a[i];
		}
		ll ans = 0;
		for (auto it : cnt) {
			ll cur = 0;
			for (auto jt : cnt) {
				if (jt.f < it.f) continue;
				cur += jt.s;
				ans = max(ans, cur);
			}
		}
		cout << ans;
		ioi
	}
}

int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> x[i] >> y[i] >> a[i];
	}
	Y0 :: solve();
	ioi
}

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