Submission #1187542

#TimeUsernameProblemLanguageResultExecution timeMemory
1187542Saul0906메기 농장 (IOI22_fish)C++20
3 / 100
49 ms8776 KiB
#include "fish.h"
#include <bits/stdc++.h>
#include <vector>
#define ll long long
#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]{}, dp[N+1]{};
	rep(i,0,M) sum[X[i]]+=W[i];
	rep(i,0,N+1){
		if(!i) dp[i]=0;
		else if(i==1) dp[i]=sum[i-1];
		else dp[i]=max(dp[i-1],dp[i-2]+sum[i-1]);
	}
	return dp[N];
}
#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...