| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1330460 | SpyrosAliv | Catfish Farm (IOI22_fish) | C++20 | 53 ms | 12380 KiB |
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, m;
vector<int> x, y, w;
ll max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
n = N;
m = M;
x = X;
y = Y;
w = W;
ll ans1 = 0, ans2 = 0;
for (int i = 0; i < m; i++) {
if (x[i] == 0) ans1 += w[i];
else ans2 += w[i];
}
if (n == 2) return max(ans1, ans2);
vector<ll> pref(n, 0), suff(n, 0);
for (int i = 0; i < m; i++) {
if (x[i] == 0) {
pref[y[i]] += w[i];
}
else {
suff[y[i]] += w[i];
}
}
for (int i = 1; i < n; i++) {
pref[i] += pref[i-1];
}
for (int i = n-2; i >= 0; i--) {
suff[i] += suff[i+1];
}
ll ans = suff[0];
for (int i = 0; i < n; i++) {
ll curr = pref[i];
if (i < n-1) curr += suff[i+1];
ans = max(ans, curr);
}
return ans;
}
| # | 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... | ||||
