# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
778723 | YassirSalama | Catfish Farm (IOI22_fish) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "fish.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
#define all(v) v.begin(),v.end()
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
std::vector<int> W) {
long long ans=0,ans1=0;
vector<long long> v1(N+100,0);
vector<long long> v2(N+100,0);
for(int i=0;i<M;i++){
if(X[i]==1){
v2[Y[i]+1]=W[i];
}
if(X[i]==0) {
v1[Y[i]+1]=W[i];
}
}
if(n==2){
return max({accumulate(all(v1),0LL),accumulate(all(v2),0LL)});
}
for(int i=1;i<v1.size();i++){
v1[i]+=v1[i-1];
v2[i]+=v2[i-1];
}
ans=v1.back();
ans1=v2.back();
long long mx=ans1;
// for(int i=1;i<=6;i++) cout<<v2[i]<<endl;
for(int i=1;i<v1.size();i++){
mx=max(mx,v1[i]+(ans1-v2[i]));
}
return max({ans,ans1,mx});
}