# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
625776 | flashmt | Catfish Farm (IOI22_fish) | C++17 | 146 ms | 15332 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>
using namespace std;
const long long oo = 1LL << 60;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w)
{
vector<vector<pair<int, int>>> fish(n);
for (int i = 0; i < m; i++)
fish[x[i]].push_back({y[i], w[i]});
vector<long long> bestPrefix(n, -oo);
// f: left, g: right
vector<long long> f, g, lastF, lastG;
for (int x = 0; x < n; x++)
{
sort(begin(fish[x]), end(fish[x]));
int sz = size(fish[x]);
swap(f, lastF);
swap(g, lastG);
f = g = vector<long long>(sz, -oo);
long long bestLastF = -oo, bestCurF = -oo;
for (int i = sz - 1, j = int(size(lastF)) - 1; i >= 0; i--)
if (x)
{
auto [y, w] = fish[x][i];
f[i] = max(bestCurF, 0LL) + w;
if (x >= 2)
f[i] = max(f[i], bestPrefix[x - 2] + w);
while (j >= 0 && fish[x - 1][j].first > y)
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... |