제출 #866448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
866448		vjudge1	메기 농장 (IOI22_fish)	C++17	0 / 100	76 ms	14676 KiB

fish

#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long// !
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define F first
#define S second


ll max_weights(int n, int m, vector<int> X, std::vector<int> Y, vector<int> W) {
	vector<pair<int, int>> pos[2];
	for (int i = 0; i < m; i++){
		pos[X[i]].push_back({Y[i], W[i]});
	}
	sort(all(pos[0]));
	sort(all(pos[1]));
	ll cnt0 = 0;
	for (auto [y, w] : pos[0]) cnt0 += w;
	ll cnt1 = 0;
	for (auto [y, w] : pos[1]) cnt1 += w;
	ll ans = max(cnt0, cnt1);
	int p = 0;
	ll cnt = 0;
	for (auto [y, w] : pos[0]){
		while (p < sz(pos[1]) && pos[1][p].F < y){
			cnt += pos[1][p].S;
			p++;
		}
		if (y) cnt += w;
		ans = max(ans, cnt);
		if (!y) cnt += w;
	}
	for (auto [y, w] : pos[1]){
		while (p < sz(pos[0]) && pos[0][p].F < y){
			cnt += pos[0][p].S;
			p++;
		}
		if (y) cnt += w;
		ans = max(ans, cnt);
		if (!y) cnt += w;
	}
	return ans;
}

• 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