Submission #1232073

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232073		RakhimovAmir	Catfish Farm (IOI22_fish)	C++20	0 / 100	84 ms	13748 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	if (N == 2) {
		ll res[2] = {};
		for (int i = 0; i < M; i++) {
			res[X[i]] += W[i];
		}
		return max(res[0], res[1]);
	} else {
		ll res = 0;
		vector<pair<int, pair<int, int>>> v;
		ll sum1 = 0, sum0 = 0;
		for (int i = 0; i < M; i++) {
			v.push_back({Y[i], {W[i], X[i]}});
			if (X[i])
				sum1 += W[i];
		}
		sort(v.begin(), v.end());
		res = sum1;
		for (int i = 0; i < v.size(); i++) {
			if (v[i].second.second == 1)
				sum1 -= v[i].second.first;
			else
				sum0 += v[i].second.first;
			while (i < v.size() - 1 && v[i].first == v[i + 1].first) {
				i++;
			}
			res = max(res, sum0 + sum1);
		}
		return res;
	}
}

• Subtask 1: 0 / 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