| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 871714 | Nonoze | 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 "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
#define int long long
bool tacha=true, tachb=true, tachc=true;
for (int i = 0; i < m; ++i)
{
if (x[i]%2) tacha=false;
if (x[i]>1) tachb=false;
if (y[i]) tachc=false;
}
if (tacha)
{
int ans=0;
for (int i = 0; i < m; ++i) ans+=w[i];
return ans;
}
if (tachb)
{
vector<vector<int>> farm(2, vector<int> (n, 0));
for (int i=0; i<m; i++) {
farm[x[i]][y[i]]=w[i];
}
vector<int> suml, sumr;
suml.push_back(farm[0][0]);
sumr.push_back(farm[1][0]);
for (int i=1; i<n; i++) {
suml.push_back(suml.back()+farm[0][i]);
sumr.push_back(sumr.back()+farm[1][i]);
}
if (n==2) return max(suml.back(), sumr.back());
int ans=sumr.back();
for (int i=0; i<n; i++) {
ans=max(ans, suml[i]+sumr.back()-sumr[i]);
}
return ans;
}
#undef int
return 0;
}