Submission #1181420

#TimeUsernameProblemLanguageResultExecution timeMemory
1181420KavelmydexCatfish Farm (IOI22_fish)C++20
0 / 100
13 ms3648 KiB
/*
5 4
0 0 4
1 0 2
2 0 3
4 0 5
*/
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long 
#define vi vector<int>
#define sp ' '

const int N=3e5+10;

void cmx(ll &a,ll b){a=max(a,b);}

ll ans[N][2],wei[N];
ll max_weights(int N, int M, vi X, vi Y,vi W) {
  for(int i=0;i<M;++i){
    wei[X[i]]=W[i];
  }
  ans[0][0]=ans[0][1]=0;
  for(int i=1;i<N;++i){
    if(i==1){
      ans[i][1]=W[0];
      ans[i][0]=W[1];
    }else{
      ans[i][1]=max(W[i-1]+ans[i-2][0],ans[i-1][0]);
      cmx(ans[i][1],ans[i-1][1]);
      ans[i][0]=max(W[i]+ans[i-1][1],ans[i-1][0]);
    }
  }
  // for(int i=1;i<N;++i)cout<<ans[i][0]<<sp<<ans[i][1]<<endl;
  return max(ans[N-1][0],ans[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...