# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849313 | sonamoo | 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.
vector<pair<ll,ll> > fish;
long long ans;
long long a1[100005] , a2[100005] , ps1[100005] , ps2[100005];
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
for (int i = 0; i < M; i++) {
if (X[i] == 0) a1[Y[i]+1] += W[i];
else a2[Y[i]+1] += W[i];
}
for (int i = 1; i <= N; i++) {
ps1[i] = ps1[i-1]+a1[i];
ps2[i] = ps2[i-1]+a2[i];
}
for (int i = 0; i <= N; i++) {
ans = max(ans , ps2[N]-ps2[i]+ps1[i]);
ans = max(ans , ps1[N]-ps1[i]+ps2[i]);
}
return ans;
}