Submission #1036896

#TimeUsernameProblemLanguageResultExecution timeMemory
1036896XJP12Catfish Farm (IOI22_fish)C++17
9 / 100
19 ms8268 KiB
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
ll max_weights(int n, int m, vi x, vi y, vi w){
	ll dp[n][4];
	vector<ll> v(n,0);
	for(int i=0; i<m; i++){
		v[x[i]] = w[i];
	}
	if(n==2){
		return max(w[0], w[1]);
	}
	for(int i=2; i<n; i++){
		if(i==2){
			dp[i][0]=0;
			dp[i][1]=v[i]+v[i-2];
			dp[i][2]=v[i-1];
			dp[i][3]=v[i];
			continue;
		}
			dp[i][0]=max(dp[i-1][0], dp[i-1][2]);
			dp[i][1]=max(dp[i-1][0]+v[i-2] + v[i], dp[i-1][2] + v[i]);
			dp[i][2]=max(dp[i-1][1], dp[i-1][3]);
			dp[i][3]=max(dp[i-1][1]+ v[i]-v[i-1], dp[i-1][3] + v[i]-v[i-1]);
	}
	return max({dp[n-1][0], dp[n-1][1], dp[n-1][2],dp[n-1][3]});
}
#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...