Submission #1212770

#TimeUsernameProblemLanguageResultExecution timeMemory
1212770bangan메기 농장 (IOI22_fish)C++20
3 / 100
52 ms9800 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<ll> w(N,0);
	for (int i = 0; i < M; i++) w[X[i]] += W[i];
	vector<array<ll,2>> dp(N);
	dp[0] = {0, 0};
	if (1<N) dp[1] = {w[1], w[0]};
	for (int i = 2; i < N; i++) {
		dp[i][0] = max(dp[i - 1][1] + w[i], dp[i - 1][0]);
		dp[i][1] = w[i - 1] + max(dp[i - 2][0], dp[i - 2][1]);
	}
	auto [x, y] = dp.back();
	return max(x,y);
}
#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...