Submission #836114

#TimeUsernameProblemLanguageResultExecution timeMemory
836114ma_moutahidCatfish Farm (IOI22_fish)C++17
0 / 100
22 ms7764 KiB
#include "fish.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;

#define vi vector<int>
#define vii vector<vi>
#define vl vector<long long>
#define vll vector<vl>
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
  vl v(N);
  for(int i=0;i<M;i++){
    v[X[i]]=W[i];
  }
  int n=N;
  vll dp(n,vl(2));
  dp[n-2][0]=v[n-1];
  for(int i=n-3;i>=0;i--){
    dp[i][0]=max(dp[i+1][0],dp[i+1][1]+v[i+1]);
    dp[i][1]=max(dp[i+1][0],dp[i+1][1]);
  }
        
  return max(dp[0][0],dp[0][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...