Submission #1231558

#TimeUsernameProblemLanguageResultExecution timeMemory
1231558nicolo_010Catfish Farm (IOI22_fish)C++20
0 / 100
13 ms3648 KiB
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename T>
using v = vector<T>;
#define rep(i, k, n) for (int i = k; i < n; i++)

ll max_weights(int N, int M, v<int> X, v<int> Y, v<int> W) {
	v<ll> a(N, 0);
	rep(i, 0, M) {
		a[X[i]] = W[i];
	}
	v<ll> dp(N, 0);
	dp[0] = a[0];
	dp[1] = max(a[0], a[1]);
	rep(i, 2, N) {
		dp[i] = max(dp[i-1], dp[i-2]+a[i]);
	}
	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...