| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1226525 | ericl23302 | Catfish Farm (IOI22_fish) | C++20 | 49 ms | 8776 KiB |
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
if (N == 2) {
vector<ll> res(2);
for (int i = 0; i < M; ++i) res[X[i]] += W[i];
return *max_element(res.begin(), res.end());
} else {
vector<ll> left(N, 0), right(N, 0);
for (int i = 0; i < M; ++i) {
if (X[i] == 0) left[Y[i]] += W[i];
else right[Y[i]] += W[i];
}
ll res = max(0ll, left[0] - right[0]);
for (int i = 1; i < N; ++i) left[i] += left[i - 1], right[i] += right[i - 1], res = max(res, left[i] - right[i]);
return res + right[N - 1];
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
