Submission #1037505

#TimeUsernameProblemLanguageResultExecution timeMemory
1037505HappyCapybaraCatfish Farm (IOI22_fish)C++17
0 / 100
72 ms8876 KiB
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
 
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
  vector<ll> pa(N, 0ll), pb(N, 0ll);
  for (int i=0; i<M; i++){
    if (X[i] == 1) pb[Y[i]] = (ll) W[i];
    else pa[Y[i]] = (ll) W[i];
  }
  ll bsf = 0;
  for (int i=0; i<N; i++){
    if (i != 0){
        pa[i] += pa[i-1];
        pb[i] += pb[i-1];
    }
    bsf = max(bsf, pa[i]-pb[i]);
  }
  return pb[N-1] + bsf;
}
#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...