제출 #1234689

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1234689		MuhammadSaram	메기 농장 (IOI22_fish)	C++20	9 / 100	225 ms	18416 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

long long max_weights(int n, int m, vector<int> x, vector<int> y,vector<int> w)
{
	ll a[n][10]={};
	for (int i=0;i<m;i++)
		a[x[i]][y[i]+1]=w[i];
	for (int i=0;i<n;i++)
		for (int j=1;j<=9;j++)
			a[i][j]+=a[i][j-1];
	ll dp[n][10]={};
	for (int i=0;i<=9;i++)
		dp[1][i]=a[1][9]-a[1][i]+a[0][i];
	for (int i=2;i<n;i++)
	{
		for (int h=0;h<=9;h++)
			for (int h1=0;h1<=9;h1++)
				for (int h2=0;h2<=9;h2++)
				{
					if (max(h1,h2)<h)
						dp[i][h]=max(dp[i][h],dp[i-2][h2]+a[i-1][h]-a[i-1][max(h1,h2)]);
					else
						dp[i][h]=max(dp[i][h],dp[i-1][h1]+max(0ll,a[i][h1]-a[i][h]));
				}
	}
	ll ans=0;
	for (int i=0;i<=9;i++) ans=max(ans,dp[n-1][i]);
	return ans;
}

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