Submission #652386

#TimeUsernameProblemLanguageResultExecution timeMemory
652386BlagojCatfish Farm (IOI22_fish)C++17
3 / 100
96 ms13720 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { bool even = true, Less = true; long long sum1 = 0, sum2 = 0, c = 0; for (auto x : X) { if (x % 2 != 0) { even = false; } if (x > 1) { Less = false; } if (x == 0) { sum1 += W[c]; } else { sum2 += W[c]; } c++; } if (even) { long long sum = 0; for (auto x : W) { sum += x; } return sum; } if (Less) { return max(sum1, sum2); } long long dp[N + 3], p[N + 3]; memset(dp, 0, sizeof(dp)); memset(p, 0, sizeof(p)); for (int i = 0; i < M; i++) { p[X[i]] = W[i]; } dp[0] = 0; dp[1] = max(p[0], p[1]); for (int i = 2; i < M; i++) { dp[i] = max(dp[i - 2] + p[i], dp[i - 1]); } return dp[M - 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...