Submission #1212762

#TimeUsernameProblemLanguageResultExecution timeMemory
1212762bangan메기 농장 (IOI22_fish)C++20
0 / 100
14 ms3136 KiB
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define all(a) a.begin(), a.end()

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
	vector<int> w(N);
	for (int i = 0; i < M; i++) w[X[i]] = W[i];
	vector<ll> dp(N);
	dp[0] = w[0];
	dp[1] = max(w[0], w[1]);
	dp[2] = max(w[0] + w[2], w[1]);
	for (int i = 3; i < N; i++) {
		dp[i] = dp[i-1];
		dp[i] = max(dp[i], dp[i - 2] + w[i - 1]);
		dp[i] = max(dp[i], dp[i - 3] + w[i - 2] + w[i]);
	}
	return dp.back();
}
#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...