Submission #1170019

#TimeUsernameProblemLanguageResultExecution timeMemory
1170019sunboiCatfish Farm (IOI22_fish)C++20
0 / 100
26 ms2880 KiB
#include <bits/stdc++.h> using namespace std; long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) { vector<int> dp(n); vector<int> real_weight(n); for (int i = 0; i < m; i++){ real_weight[x[i]] = w[i]; } for (int i = 1; i < n; i++){ dp[i - 1] += real_weight[i]; if (i >= 3){ dp[i] = max(dp[i - 1] - real_weight[i], max(dp[i - 2], dp[i - 3] + real_weight[i - 1])); }else if (i == 2){ dp[i] = max(dp[i - 1] - real_weight[i], dp[i - 2]); }else{ dp[i] = real_weight[0]; } } return max(dp[n - 2], 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...