| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 654808 | t6twotwo | 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.
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
const long long inf = -(1LL << 50);
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
vector p(n, vector<int>(n + 1));
for (int i = 0; i < m; i++) {
p[x[i]][y[i] + 1] = w[i];
}
vector s(n, vector<long long>(n + 2));
for (int i = 0; i < n; i++) {
for (int j = 0; j <= n; j++) {
s[i][j + 1] = s[i][j] + p[i][j];
}
}
auto range_sum = [&](int i, int l, int r) -> long long {
if (i == -1) {
return 0;
}
return s[i][r + 1] - s[i][l + 1];
};
vector<vector<int>> b(n);
for (int i = 0; i < m; i++) {
b[x[i]].push_back(i);
}
vector d(n, vector<int>{-1});
vector<vector<int>> r(n), p(n);
for (int i = 0; i < n; i++) {
sort(b[i].begin(), b[i].end(), [&](int j, int k) {
return y[j] < y[k];
});
for (int j : b[i]) {
r[i].push_back(y[j]);
p[i].push_back(w[j]);
if (i > 0) {
d[i - 1].push_back(y[j]);
}
if (i < n - 1) {
d[i + 1].push_back(y[j]);
}
}
}
vector<vector<long long>> ssum(n), psum(n);
for (int i = 0; i < n; i++) {
int k = p[i].size();
psum[i] = vector<long long>(k + 1);
ssum[i] = vector<long long>(k + 1);
for (int j = 0; j < k; j++) {
psum[i][j + 1] = psum[i][j] + p[i][j];
}
for (int j = k - 1; j >= 0; j--) {
ssum[i][j] = ssum[i][j + 1] + p[i][j];
}
}
auto suf_sum = [&](int i, int x) -> long long {
if (i == -1) {
return 0;
}
long long ans = 0;
for (int j = 0; j < p[i].size(); j++) {
if (r[i][j] > x) {
ans += p[i][j];
}
}
return ans;
return ssum[i][upper_bound(r[i].begin(), r[i].end(), x) - r[i].begin()];
};
auto pre_sum = [&](int i, int x) -> long long {
if (i == -1) {
return 0;
}
long long ans = 0;
for (int j = 0; j < p[i].size(); j++) {
if (r[i][j] <= x) {
ans += p[i][j];
}
}
return ans;
return psum[i][upper_bound(r[i].begin(), r[i].end(), x) - r[i].begin()];
};
vector<int> e{-1};
vector<array<long long, 2>> dp{{0, 0}};
for (int i = 0; i < n; i++) {
auto pd = dp;
int l = d[i].size();
dp = vector(l, array<long long, 2>{inf, inf});
int k = pd.size();
vector<long long> pmax(k + 1, inf);
for (int j = 0; j < k; j++) {
pmax[j + 1] = max(pmax[j], pd[j][0] + range_sum(i - 1, e[j], n)); //suf_sum(i - 1, e[j]));
}
vector<long long> smax(k + 1, inf);
for (int j = k - 1; j >= 0; j--) {
smax[j] = max(smax[j + 1], max(pd[j][0], pd[j][1]) - range_sum(i, e[j], n)); //suf_sum(i, e[j]));
}
for (int j = 0; j < k; j++) {
dp[0][0] = max(dp[0][0], max(pd[j][0], pd[j][1]));
dp[0][1] = max(dp[0][1], max(pd[j][0], pd[j][1]) + range_sum(i, 0, e[j])); //pre_sum(i, e[j]));
}
for (int j = 1; j < l; j++) {
dp[j][0] = max({dp[j][0], max(pd[0][1], pd[0][0] + range_sum(i - 1, 0, d[i][j]) /*pre_sum(i - 1, d[i][j])*/), pmax[upper_bound(e.begin(), e.end(), d[i][j]) - e.begin()] - range_sum(i - 1, d[i][j], n)}); //suf_sum(i - 1, d[i][j])});
dp[j][1] = max({dp[j][1], max(pd[0][1], pd[0][0] + range_sum(i - 1, 0, d[i][j]) /*pre_sum(i - 1, d[i][j])*/), smax[lower_bound(e.begin(), e.end(), d[i][j]) - e.begin()] + range_sum(i, d[i][j], n)}); //suf_sum(i, d[i][j])});
}
swap(e, d[i]);
}
long long ans = inf;
for (auto v : dp) {
ans = max(ans, max(v[0], v[1]));
}
return ans;
}