Submission #866556

#	Time	Username	Problem	Language	Result	Execution time	Memory
866556		vjudge1	Catfish Farm (IOI22_fish)	C++17	3 / 100	1073 ms	28180 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
const int MAXN = 1e5 + 3;

ll max_weights(int n, int m, vector<int> X, std::vector<int> Y, vector<int> W) {
	// dp[i][j], for i'th column just before the j'th element
	vector<pair<int, int>> pos[MAXN];
	for (int i = 0; i < m; i++){
		pos[X[i]+1].push_back({Y[i], W[i]});
	}
	vector<ll> dp[MAXN];
	for (int i = 0; i <= n; i++){
		pos[i].push_back({MAXN, 0});
		sort(all(pos[i]));
		dp[i].resize(sz(pos[i]), 0ll);
	}
	for (int i = 1; i <= n; i++){
		for (int j = 0; j < sz(dp[i]); j++){
			ll& me = dp[i][j];
			ll cnt = 0;
			for (int k = sz(dp[i - 1]) - 1; k >= 0; k--){
				if (pos[i - 1][k].F <= pos[i][j].F - 1) cnt += pos[i - 1][k].S;
				me = max(me, cnt + dp[i-1][k]);
			}
			if (i == n){
				int p = sz(pos[i]) - 1;
				ll cnt2 = 0;
				cnt = 0;
				for (auto it : pos[i]) cnt2 += it.S;

				for (int k = sz(dp[i - 1]) - 1; k >= 0; k--){

					if (pos[i - 1][k].F <= pos[i][j].F - 1) cnt += pos[i - 1][k].S;
					while (p >= 0 && pos[i - 1][k].F - 1 < pos[i][p].F){
						cnt2 -= pos[i][p].S;
						p--;
					}

					me = max(me, cnt2 + cnt + dp[i-1][k]);
				}
			}
		}
	}
	ll ans = 0;
	for (auto it : dp[n]){
		ans = max(ans, it);
	}
	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