제출 #658831

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
658831		pere_gil	Catfish Farm (IOI22_fish)	C++17	23 / 100	1093 ms	2097152 KiB

fish

#include "fish.h"
#include "bits/stdc++.h"
using namespace std;
     
typedef long long ll;

int n,h;
vector<vector<vector<ll>>> dp;
vector<vector<ll>> fish;

ll f(int x, int j, int k){
	if(x<0) return 0;
	if(dp[x][j][k]!=-1) return dp[x][j][k];

	ll res=0;
	for(int i=0;i<h;i++){
		ll act=f(x-1,i,j);

		if(i<j) act+=fish[x][j]-fish[x][i];
		else act+=(x==n-1) ? 0 : fish[x+1][max(i,k)]-fish[x+1][max(j,k)];

		res=max(res,act);
	}
	return dp[x][j][k]=res;
}

ll max_weights(int N, int m, vector<int> x, vector<int> y, vector<int> w){
	n=N;
	h=0;
	for(int i=0;i<m;i++) h=max(h,y[i]);
	h+=2;

	fish.assign(n,vector<ll>(h,0));
	for(int i=0;i<m;i++) fish[x[i]][y[i]+1]=w[i];
	for(int i=0;i<n;i++)
		for(int j=1;j<h;j++)
			fish[i][j]+=fish[i][j-1];

	dp.assign(n,vector<vector<ll>>(h,vector<ll>(h,-1)));
	
	return f(n-1,0,0);
}

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