Submission #1232078

#TimeUsernameProblemLanguageResultExecution timeMemory
1232078RakhimovAmirCatfish Farm (IOI22_fish)C++20
0 / 100
27 ms6212 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; using ll = long long; long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { ll dp[N][2], f[N] = {}; memset(dp, 0, sizeof(dp)); for (int i = 0; i < M; i++) { f[X[i]] = W[i]; } for (int i = 1; i < N; i++) { dp[i][0] = max(dp[i][0], dp[i - 1][0]); dp[i][0] = max(dp[i][0], dp[i - 1][1] + f[i]); dp[i][1] = max(dp[i][1], dp[i - 1][0] + f[i - 1]); dp[i][1] = max(dp[i][1], dp[i - 1][1]); } return max(dp[N - 1][0], dp[N - 1][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...