Submission #1056637

#TimeUsernameProblemLanguageResultExecution timeMemory
1056637MercubytheFirstCatfish Farm (IOI22_fish)C++17
0 / 100
12 ms2848 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; using ll = long long; const ll inf = 1e9 + 37; long long max_weights(signed N, signed M, vector<signed> X, vector<signed> Y, vector<signed> W) { W.push_back(0); vector<ll> dp(M); for(ll i = 0; i < M; ++i) { dp[i] = W[i + 1] + (i > 0 ? W[i - 1] : 0); if(i > 0) { dp[i] = max(dp[i], dp[i - 1] + W[i + 1]); } if(i > 1) { dp[i] = max(dp[i], dp[i - 2] + W[i + 1]); } } return *max_element(dp.begin(), dp.end()); }
#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...