| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 678782 |
2023-01-06T14:54:31 Z |
pls33 |
Catfish Farm (IOI22_fish) |
C++17 |
|
744 ms |
2097152 KB |
#include <bits/stdc++.h>
#ifndef _AAAAAAAAA
#include "fish.h"
#endif
using namespace std;
#pragma region dalykai
using p32 = pair<int, int>;
using p32u = pair<uint32_t, uint32_t>;
using p64 = pair<int64_t, int64_t>;
using p64u = pair<uint64_t, uint64_t>;
using vi16 = vector<int16_t>;
using vi16u = vector<uint16_t>;
using vi32 = vector<int>;
using vi32u = vector<uint32_t>;
using vi64 = vector<int64_t>;
using vi64u = vector<uint64_t>;
using vp32 = vector<p32>;
using vp32u = vector<p32u>;
using vp64 = vector<p64>;
using vp64u = vector<p64u>;
using vvi32 = vector<vi32>;
using vvi32u = vector<vi32u>;
using vvi64 = vector<vi64>;
using vvi64u = vector<vi64u>;
using vvp32 = vector<vp32>;
using vvp32u = vector<vp32u>;
using vvp64 = vector<vp64>;
using vvp64u = vector<vp64u>;
#pragma endregion
struct state_t
{
int first;
int second;
int64_t increase;
int64_t decrease;
state_t(int f = 0, int s = 0)
{
first = f;
second = s;
increase = 0;
decrease = 0;
}
};
struct node_t
{
int64_t val;
p32 range;
node_t *left, *right;
node_t(p32 r)
{
val = 0;
range = r;
left = nullptr;
right = nullptr;
}
void update()
{
if (!right || range.second - range.first == 1)
{
return;
}
val = max(left->val, right->val);
}
void expand()
{
if (range.second - range.first == 1 || right)
{
return;
}
int mid = (range.first + range.second) / 2;
left = new node_t({range.first, mid});
right = new node_t({mid, range.second});
}
int contains(p32 query)
{
if (query.first >= range.second || query.second <= range.first)
{
return 0;
}
if (range.first >= query.first && range.second <= query.second)
{
return 1;
}
return 2;
}
};
void update(node_t *node, int64_t val, p32 dest)
{
if (!node || !node->contains(dest))
{
return;
}
if (node->contains(dest) == 1)
{
node->val = max(node->val, val);
return;
}
node->expand();
update(node->left, val, dest);
update(node->right, val, dest);
node->update();
}
int64_t query(node_t *node, p32 dest)
{
if (!node || !node->contains(dest))
{
return 0;
}
if (node->contains(dest) == 1)
{
return node->val;
}
return max(query(node->left, dest),
query(node->right, dest));
}
void assign_max(int64_t val, p32 fish, vvi64 &vect)
{
vect[fish.first][fish.second] = max(vect[fish.first][fish.second], val);
}
int64_t weight_sum(int i, int j, vvp64 &prefix, int row)
{
if (i == -1 || !prefix[row].size())
{
return 0;
}
auto hi = upper_bound(prefix[row].begin(), prefix[row].end(), p64{j, INT64_MAX});
if (hi == prefix[row].end())
{
hi--;
}
int64_t sum = hi->second;
if (i)
{
sum -= lower_bound(prefix[row].begin(), prefix[row].end(), p64{i, 0})->second;
}
return sum;
}
int64_t new_weight(p32 lhs, p32 rhs, vvp64 &prefix)
{
int64_t left = rhs.first > 0
? weight_sum(0, rhs.second, prefix, rhs.first - 1)
: 0;
int64_t right = (rhs.first + 1 < (int)prefix.size())
? weight_sum(0, rhs.second, prefix, rhs.first + 1)
: 0;
if (lhs.first == -1)
{
return left + right;
}
if (rhs.first - lhs.first > 2)
{
return left + right;
}
if (rhs.first - lhs.first == 2)
{
if (lhs.second >= rhs.second)
{
return right;
}
left -= weight_sum(0, lhs.second, prefix, rhs.first - 1);
return left + right;
}
if (lhs.second > rhs.second)
{
left = -weight_sum(0, rhs.second, prefix, rhs.first);
return left + right;
}
left -= weight_sum(0, lhs.second, prefix, rhs.first) +
weight_sum(0, lhs.second, prefix, rhs.first - 1);
return left + right;
}
long long max_weights(int N, int M,
std::vector<int> X,
std::vector<int> Y,
std::vector<int> W)
{
vp32 fish;
int max_y = 0;
vvp64 prefix(N);
for (int i = 0; i < M; i++)
{
max_y = max(max_y, Y[i]);
prefix[X[i]].emplace_back(Y[i], W[i]);
if (X[i])
{
fish.push_back({X[i] - 1, Y[i]});
}
if (X[i] < N - 1)
{
fish.push_back({X[i] + 1, Y[i]});
}
}
for (auto &row : prefix)
{
sort(row.begin(), row.end());
for (int i = 1; i < (int)row.size(); i++)
{
row[i].second += row[i - 1].second;
}
}
sort(fish.begin(), fish.end());
auto it = unique(fish.begin(), fish.end());
fish.erase(it, fish.end());
vvi64 decrease(N, vi64(max_y + 1));
vvi64 increase(N, vi64(max_y + 1));
vp32 check;
node_t *fish_count = new node_t({0, N});
for (auto &f : fish)
{
int64_t initial = new_weight(p32(-1, -1), f, prefix);
if (f.first > 2)
{
initial += query(fish_count, {0, f.first - 2});
}
check.emplace_back(f);
for (int cur = (int)check.size() - 2; cur >= 0; cur--)
{
auto &[i, j] = check[cur];
if (f.first - i > 3)
{
break;
}
if (i == f.first)
{
continue;
}
int64_t prev = new_weight(p32(i, j), f, prefix);
if (i == f.first - 1)
{
if (j < f.second)
{
assign_max(prev + increase[i][j], f, increase);
}
else
{
assign_max(prev + decrease[i][j], f, decrease);
}
}
else
{
prev += max(increase[i][j], decrease[i][j]);
assign_max(prev, f, increase);
assign_max(prev, f, decrease);
}
}
update(fish_count,
max(increase[f.first][f.second], decrease[f.first][f.second]),
{f.first, f.first + 1});
}
return fish_count->val;
}
#ifdef _AAAAAAAAA
int main()
{
freopen("fish.in", "r", stdin);
#ifndef __linux__
atexit([]()
{
freopen("con", "r", stdin);
system("pause"); });
#endif
int N, M;
assert(2 == scanf("%d %d", &N, &M));
std::vector<int> X(M), Y(M), W(M);
for (int i = 0; i < M; ++i)
{
assert(3 == scanf("%d %d %d", &X[i], &Y[i], &W[i]));
}
long long result = max_weights(N, M, X, Y, W);
printf("%lld\n", result);
return 0;
}
#endif
Compilation message
fish.cpp:8: warning: ignoring '#pragma region dalykai' [-Wunknown-pragmas]
8 | #pragma region dalykai
|
fish.cpp:31: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
31 | #pragma endregion
|
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
744 ms |
2097152 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
248 KB |
1st lines differ - on the 1st token, expected: '2', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
14 ms |
13496 KB |
1st lines differ - on the 1st token, expected: '10082010', found: '0' |
| 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: '1' |
| 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: '1' |
| 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: '1' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
14 ms |
13496 KB |
1st lines differ - on the 1st token, expected: '10082010', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
744 ms |
2097152 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
