# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1189863 | Amr | Catfish Farm (IOI22_fish) | C++20 | 12 ms | 2368 KiB |
#include "fish.h"
#include <vector>
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define sz size()
const int N2 = 1e5+2;
ll a[N2]={0}, b[N2], prea[N2], preb[N2];
ll dp[N2][2];
ll inf = 1e18;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
for(int i = 0; i < N; i++)
{
a[X[i]+1] = W[i];
}
dp[0][1] = -inf;
dp[1][0] = 0;
dp[1][1] = 0;
for(int i = 2; i <= N2; i++)
{
dp[i][1] = max( max(dp[i-2][0],dp[i-2][1])+a[i-1],dp[i-1][1]);
dp[i][0] = max(dp[i-1][1]+a[i],dp[i-1][0]);
}
cout << max(dp[N2][0], dp[N2][1]) << endl;
return 0;
}
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... |