# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
628276 | abeker | Catfish Farm (IOI22_fish) | C++17 | 1098 ms | 2097152 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 <bits/stdc++.h>
#include "fish.h"
using namespace std;
typedef long long ll;
ll max_weights(int N, int M, vector <int> x, vector <int> y, vector <int> w) {
vector <vector <ll>> mat(N + 2, vector <ll> (N));
for (int i = 0; i < M; i++)
mat[x[i] + 1][y[i]] = w[i];
vector <ll> sum(N + 2);
vector <ll> maks(N + 2), mini(N + 2);
for (int i = 1; i < N + 2; i++) {
ll curr = 0;
for (int j = 0; j < N; j++) {
sum[i] += mat[i][j];
curr += mat[i - 1][j] - mat[i][j];
maks[i] = max(maks[i], curr);
mini[i] = max(mini[i], -curr);
}
}
auto make_sum = [&](vector <ll> &v) {
for (int i = 1; i < v.size(); i++)
v[i] += v[i - 1];
};
make_sum(maks);
make_sum(mini);
auto get_sum = [&](const vector <ll> &pref, int lo, int hi) {
return pref[hi] - (lo ? pref[lo - 1] : 0);
};
Compilation message (stderr)
# | 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... |