Submission #1077188

#	Time	Username	Problem	Language	Result	Execution time	Memory
1077188		pcc	Catfish Farm (IOI22_fish)	C++17	14 / 100	1050 ms	13364 KiB

fish

#include "fish.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fs first
#define sc second

const ll inf = 1e18;
const int mxn = 330;
ll dp[mxn][mxn][2];
vector<pii> fish[mxn];

ll f(int idx,int s,int e){
	ll re = 0;
	for(auto &[pos,w]:fish[idx]){
		if(pos>s&&pos<=e)re += w;
	}
	return re;
}

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
	for(int i = 0;i<M;i++){
		fish[X[i]].push_back(pii(Y[i],W[i]));
	}
	for(int i = 0;i<N;i++)sort(fish[i].begin(),fish[i].end());
	for(int i = 0;i<N;i++){
		dp[0][i][0] = f(1,-1,i);
	}
	ll big = 0;
	for(int i = 1;i<N;i++){
		for(int h = 0;h<N;h++){
			for(int j = 0;j<N;j++){
				if(j<h){
					dp[i][h][0] = max(dp[i][h][0],dp[i-1][j][0]-f(i,-1,j)+f(i-1,j,h)+f(i+1,-1,h));
				}
				else{
					dp[i][h][1] = max(dp[i][h][1],max(dp[i-1][j][0],dp[i-1][j][1])-f(i,-1,h)+f(i+1,-1,h));
				}
				if(i-2>=0)dp[i][h][0] = max(dp[i][h][0],max(dp[i-2][j][0],dp[i-2][j][1])+f(i-1,j,h)+f(i+1,-1,h));
			}
			dp[i][h][0] = max(dp[i][h][0],big+f(i-1,-1,h)+f(i+1,-1,h));
		}
		if(i-2>=0){
			for(int j = 0;j<N;j++)big = max({big,dp[i-2][j][0],dp[i-2][j][1]});
		}
	}
	ll ans = 0;

	/*
	for(int i = 0;i<N;i++){
		for(int j = 0;j<N;j++)cerr<<dp[i][j][0]<<','<<dp[i][j][1]<<' ';cerr<<endl;
	}cerr<<endl;
	*/

	for(int i = 0;i<N;i++){
		for(int j = 0;j<N;j++)ans = max({ans,dp[i][j][0],dp[i][j][1]});
	}
	return ans;
}

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