# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
757528 | ChickTheNugget | Catfish Farm (IOI22_fish) | C++17 | 36 ms | 5700 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define INF 1e9
#define MOD 1e9 + 7
#define MAXN 100005
int mod = 1e9 + 7;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
int n = N;
int m = M;
vector<vector<ll>> dp(2, vector<ll>(n, 0));
dp[1][0] = W[1];
dp[0][1] = W[1];
if (n >= 2){
dp[1][1] = W[0] + W[2];
}
for (int i = 2; i < n; i++){
dp[1][i] = max(dp[1][i - 2] + W[i + 1], dp[0][i - 2] + W[i - 1] + W[i + 1]);
dp[0][i] = max(dp[1][i - 1], dp[0][i - 1]);
}
dp[1][n - 1] = max(dp[1][n - 3], dp[0][n - 3] + W[n - 2]);
return max(dp[1][n - 1], dp[0][n - 1]);
}
// void solve()
// {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |