| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 626228 |
2022-08-11T10:10:07 Z |
Eae02 |
Catfish Farm (IOI22_fish) |
C++17 |
|
792 ms |
94324 KB |
#include "fish.h"
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define all(x) begin(x),end(x)
struct SegTree {
using T = ll; // use pair of value and index to get index from queries
T f(T a, T b) { return max(a, b); }
static constexpr T UNIT = LLONG_MIN; // neutral value for f
vector<T> s; ll n;
SegTree(ll len) : s(2 * len, UNIT), n(len) {}
void set(ll pos, T val) {
for (s[pos += n] = val; pos /= 2;)
s[pos] = f(s[pos * 2], s[pos * 2 + 1]);
}
T query(ll lo, ll hi) { // query lo to hi (hi not included)
T ra = UNIT, rb = UNIT;
for (lo += n, hi += n; lo < hi; lo /= 2, hi /= 2) {
if (lo % 2) ra = f(ra, s[lo++]);
if (hi % 2) rb = f(s[--hi], rb);
}
return f(ra, rb);
}
};
vector<vector<pair<ll, ll>>> fishWeightSum;
ll weightSum(ll x, ll y) {
if (x < 0 || x >= (ll)fishWeightSum.size())
return 0;
ll idx = lower_bound(all(fishWeightSum[x]), make_pair(y, LLONG_MIN)) - fishWeightSum[x].begin();
if (fishWeightSum[x][idx].first > y)
idx--;
return fishWeightSum[x][idx].second;
}
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
if (M == 0) return 0;
vector<pair<ll, ll>> piers;
vector<tuple<ll, ll, ll>> fish;
for (ll i = 0; i < M; i++) {
fish.emplace_back(X[i], Y[i], W[i]);
if (X[i] != 0)
piers.emplace_back(X[i] - 1, Y[i]);
if (X[i] != N - 1)
piers.emplace_back(X[i] + 1, Y[i]);
}
sort(all(piers));
piers.erase(unique(all(piers)), piers.end());
sort(all(fish));
fishWeightSum.resize(N);
for (ll i = 0; i < N; i++) {
fishWeightSum[i].emplace_back(LLONG_MIN, 0);
}
for (auto [x, y, w] : fish) {
fishWeightSum[x].emplace_back(y, fishWeightSum[x].back().second + w);
}
for (ll i = 0; i < N; i++) {
fishWeightSum[i].emplace_back(LLONG_MAX, fishWeightSum[i].back().second);
}
SegTree st1(piers.size());
SegTree st2(piers.size());
SegTree st3(piers.size());
SegTree st4(piers.size());
SegTree st5(piers.size());
vector<array<ll, 2>> dpv(piers.size() + 1);
array<ll, 2>* dp = &dpv[1];
for (ll lp = (ll)piers.size() - 1; lp >= -1; lp--) {
ll cx = lp == -1 ? -5 : piers[lp].first;
ll cy = lp == -1 ? -5 : piers[lp].second;
ll x1ShorterFirstIdx = lower_bound(all(piers), make_pair(cx + 1, LLONG_MIN)) - piers.begin();
ll x1LongerFirstIdx = lower_bound(all(piers), make_pair(cx + 1, cy)) - piers.begin();
ll x2ShorterFirstIdx = lower_bound(all(piers), make_pair(cx + 2, LLONG_MIN)) - piers.begin();
ll x2LongerFirstIdx = lower_bound(all(piers), make_pair(cx + 2, cy)) - piers.begin();
ll c3FirstIdx = lower_bound(all(piers), make_pair(cx + 3, LLONG_MIN)) - piers.begin();
for (ll allowNext = 0; allowNext < 2; allowNext++) {
ll ans = 0;
if (allowNext) {
ans = max(ans, st1.query(x1ShorterFirstIdx, x1LongerFirstIdx));
//for (ll np = x1ShorterFirstIdx; np < x1LongerFirstIdx; np++) {
// auto [nx, ny] = piers[np];
// ans = max(ans, dp[np][0] + weightSum(nx + 1, ny) - weightSum(nx, ny));
//}
ans = max<ll>(ans, (__int128_t)st2.query(x1LongerFirstIdx, x2ShorterFirstIdx) - (__int128_t)weightSum(cx, cy) - (__int128_t)weightSum(cx + 1, cy));
//for (ll np = x1LongerFirstIdx; np < x2ShorterFirstIdx; np++) {
// auto [nx, ny] = piers[np];
// ans = max(ans, dp[np][1] + weightSum(nx + 1, ny) + weightSum(nx - 1, ny) - weightSum(cx, cy) - weightSum(cx + 1, cy));
//}
}
ans = max(ans, st3.query(x2ShorterFirstIdx, x2LongerFirstIdx));
//for (ll np = x2ShorterFirstIdx; np < x2LongerFirstIdx; np++) {
// auto [nx, ny] = piers[np];
// ans = max(ans, dp[np][1] + weightSum(nx + 1, ny));
//}
ans = max<ll>(ans, (__int128_t)st4.query(x2LongerFirstIdx, c3FirstIdx) - (__int128_t)weightSum(cx + 1, cy));
//for (ll np = x2LongerFirstIdx; np < c3FirstIdx; np++) {
// auto [nx, ny] = piers[np];
// ans = max(ans, dp[np][1] + weightSum(nx + 1, ny) + weightSum(nx - 1, ny) - weightSum(cx + 1, cy));
//}
ans = max(ans, st5.query(c3FirstIdx, (ll)piers.size()));
//for (ll np = c3FirstIdx; np < (ll)piers.size(); np++) {
// auto [nx, ny] = piers[np];
// ans = max(ans, dp[np][1] + weightSum(nx + 1, ny) + weightSum(nx - 1, ny));
//}
dp[lp][allowNext] = ans;
}
if (lp != -1) {
st1.set(lp, dp[lp][0] + weightSum(cx + 1, cy) - weightSum(cx, cy));
st2.set(lp, dp[lp][1] + weightSum(cx + 1, cy) + weightSum(cx - 1, cy));
st3.set(lp, dp[lp][1] + weightSum(cx + 1, cy));
st4.set(lp, dp[lp][1] + weightSum(cx + 1, cy) + weightSum(cx - 1, cy));
st5.set(lp, dp[lp][1] + weightSum(cx + 1, cy) + weightSum(cx - 1, cy));
}
}
return dp[-1][1];
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
96 ms |
21424 KB |
Output is correct |
| 2 |
Correct |
120 ms |
25152 KB |
Output is correct |
| 3 |
Correct |
11 ms |
7312 KB |
Output is correct |
| 4 |
Correct |
12 ms |
7252 KB |
Output is correct |
| 5 |
Correct |
784 ms |
93080 KB |
Output is correct |
| 6 |
Incorrect |
792 ms |
94324 KB |
1st lines differ - on the 1st token, expected: '300000000000000', found: '49640000000000' |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
1st lines differ - on the 1st token, expected: '2', found: '9223372036854775807' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
7252 KB |
Output is correct |
| 2 |
Incorrect |
11 ms |
7252 KB |
1st lines differ - on the 1st token, expected: '882019', found: '0' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
1st lines differ - on the 1st token, expected: '3', found: '9223372036854775807' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
1st lines differ - on the 1st token, expected: '3', found: '9223372036854775807' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
1st lines differ - on the 1st token, expected: '3', found: '9223372036854775807' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
7252 KB |
Output is correct |
| 2 |
Incorrect |
11 ms |
7252 KB |
1st lines differ - on the 1st token, expected: '882019', found: '0' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
96 ms |
21424 KB |
Output is correct |
| 2 |
Correct |
120 ms |
25152 KB |
Output is correct |
| 3 |
Correct |
11 ms |
7312 KB |
Output is correct |
| 4 |
Correct |
12 ms |
7252 KB |
Output is correct |
| 5 |
Correct |
784 ms |
93080 KB |
Output is correct |
| 6 |
Incorrect |
792 ms |
94324 KB |
1st lines differ - on the 1st token, expected: '300000000000000', found: '49640000000000' |
| 7 |
Halted |
0 ms |
0 KB |
- |
