Submission #1187546

#TimeUsernameProblemLanguageResultExecution timeMemory
1187546Saul0906메기 농장 (IOI22_fish)C++20
3 / 100
50 ms9796 KiB
#include "fish.h"
#include <bits/stdc++.h>
#include <vector>
#define ll long long
#define pll pair<ll,ll>
#define fi first
#define se second
#define rep(a,b,c) for(int a=b; a<c; a++)

using namespace std;

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	ll sum[N+1]{}, dp[N+1]{}, mx[N], ans=0;
	rep(i,0,M) sum[X[i]]+=W[i];
	rep(i,0,N){
		if(!i) dp[i]=sum[i+1];
		else if(i==1) dp[i]=sum[i-1]+sum[i+1];
		else dp[i]=max(dp[i-1]-sum[i]+sum[i+1],mx[i-2]+sum[i+1]);
		mx[i]=dp[i];
		if(i) mx[i]=max(mx[i],mx[i-1]);
	}
	return dp[N-1];
}
#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...