Submission #1170024

#TimeUsernameProblemLanguageResultExecution timeMemory
1170024sunboiCatfish Farm (IOI22_fish)C++20
12 / 100
52 ms8776 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<long long> dp(n);
    vector<long long> 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...