# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1079189 | vjudge1 | 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>
using namespace std;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
std::vector<int> W) {
long long ok=1,ok1=1;
fore(i,0,M) {
if(X[i] % 2)
ok=0;
if(X[i] > 1)
ok1=0;
}
long long ans=0;
if(ok)
fore(i,0,M)
ans+=W[i];
else if(ok1) {
long long sum1=0,sum2=0;
fore(i,0,M) {
if(X[i] == 0)
sum1+=W[i];
else
sum2+=W[i];
}
ans = max(sum1,sum2);
} else {
long long dp[N+5];