Submission #990008

#TimeUsernameProblemLanguageResultExecution timeMemory
990008cpdreamerCatfish Farm (IOI22_fish)C++17
6 / 100
67 ms12388 KiB
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    vector<long long>v_0,v_1;
    v_0.assign(N,0);
    v_1.assign(N,0);
    for(int i=0;i<M;i++){
        if(X[i]==0)
            v_0[Y[i]]+=W[i];
        else
            v_1[Y[i]]+=W[i];
    }
    for(int i=1;i<N;i++){
        v_0[i]+=v_0[i-1];
        v_1[i]+=v_1[i-1];
    }
    if(N<=2)
        return max(v_0[N-1],v_1[N-1]);
    long long  c=v_1[N-1];
    for(int i=0;i<N;i++){
        c=max(c,v_1[N-1]-v_1[i]+v_0[i]);
    }
    return c;
}
#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...