Submission #1212749

#	Time	Username	Problem	Language	Result	Execution time	Memory
1212749		bangan	Catfish Farm (IOI22_fish)	C++20	3 / 100	88 ms	9404 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define all(a) a.begin(), a.end()

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
	ll ans=0, cur=0;
	vector<int> ALL;
	for (int i = 0; i < M; i++) {
		ALL.pb(i);
		if (X[i] == 1) cur += W[i];
	}
	sort(all(ALL), [&](int i, int j) {
		if (Y[i]==Y[j]) return X[i]>X[j];
		else return Y[i]<Y[j];
	});
	if (N==2) return max(accumulate(all(W), 0LL), cur);
	ans=cur;
	for (int i:ALL) {
		if (X[i]==1) cur-=W[i];
		else ans = max(ans, cur += W[i]);
	}
	return ans;
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16