Submission #721383

#TimeUsernameProblemLanguageResultExecution timeMemory
721383bLICCatfish Farm (IOI22_fish)C++17
3 / 100
100 ms9716 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { ll sum[N]{}; for (int i = 0;i<M;i++){ sum[X[i]]+=W[i]*1ll; } ll dp[N][2]; // memset(dp, 0, sizeof(dp)); dp[0][0] = 0; dp[0][1] = sum[0]; for (int i = 1;i<N;i++){ dp[i][0] = max(dp[i-1][1], dp[i-1][0]); dp[i][1] = dp[i-1][0]+sum[i]; } 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...