제출 #658796

#제출 시각아이디문제언어결과실행 시간메모리
658796pere_gil메기 농장 (IOI22_fish)C++17
9 / 100
32 ms11308 KiB
#include "fish.h"
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){
	vector<ll> fish(n+1,0);
	for(int i=0;i<m;i++) fish[x[i]]=w[i];
	
	ll dp[n][2][2][2]; // 0: not pound | 1: pound
	memset(dp,0,sizeof dp);
	
	for(int i=0;i<2;i++)
		for(int j=0;j<2;j++)
			dp[0][i][j][0]=dp[0][i][j][1]=0;

	for(int i=0;i<2;i++){
		dp[1][i][0][0]=0;
		dp[1][i][0][1]=fish[0];

		dp[1][i][1][0]=fish[1];
		dp[1][i][1][1]=0;
	}

	for(int i=2;i<n;i++){

		for(int j=0;j<2;j++){
			for(int k=0;k<2;k++){

				dp[i][0][0][0]=max(dp[i][0][0][0],dp[i-2][j][k][0]);

				dp[i][0][0][1]=max(dp[i][0][0][1],dp[i-2][j][k][0]+fish[i-1]);

				dp[i][0][1][0]=max(dp[i][0][1][0],dp[i-2][j][k][0]+fish[i-2]+fish[i]-k*fish[i-2]);

				dp[i][0][1][1]=max(dp[i][0][1][1],dp[i-2][j][k][0]+fish[i-2]-k*fish[i-2]);

				dp[i][1][0][0]=max(dp[i][1][0][0],dp[i-2][j][k][1]+fish[i-1]);
				
				dp[i][1][0][1]=max(dp[i][1][0][1],dp[i-2][j][k][1]+fish[i-1]);

				dp[i][1][1][0]=max(dp[i][1][1][0],dp[i-2][j][k][1]+fish[i]);

				dp[i][1][1][1]=max(dp[i][1][1][1],dp[i-2][j][k][1]);
			}
		}
	}

	ll res=0;
	for(int i=0;i<2;i++)
		for(int j=0;j<2;j++)
			for(int k=0;k<2;k++)
				res=max(res,dp[n-1][i][j][k]);
	
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...