# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
724352 | raul2008487 | 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 <vector>
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
long long i,ans=0;
if(N==2){
ll ans1=0,ans2=0;
for(i=0;i<W.size();i++){
if(X[i]==1){
ans1+=W[i];
}
else{
ans2+=W[i];
}
}
if(ans1>ans2){
return ans1;
}
else{
return ans2;
}
}
else{
ll cur1=0,cur2=0,w1=0;
for(i=0;i<W.size();i++){
if(X[i]==1){
w1+=W[i];
}
}
ll cx=0;
for(i=0;i<W.size();i++){
if(X[i]==0){
cur1+=W[i];
}
else{
cur2+=W[i];
}
if((cur1-cur2)>cx){
cx=cur1-cur2;
}
}
return w1+cx;
}
}