#include "fish.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
long long zero[101010], full[101010];
vector< pair<int, long long> > ylist[101010];
vector< long long > sum[101010], dp[2][101010];
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
for (int i = 0; i < M; i++) {
X[i] += 1;
Y[i] += 1;
ylist[X[i]].push_back({Y[i], 0});
ylist[X[i] - 1].push_back({Y[i], 0});
ylist[X[i] + 1].push_back({Y[i], 0});
}
for (int i = 0; i <= N + 1; i++) {
ylist[i].push_back({0, 0});
ylist[i].push_back({N, 0});
sort(ylist[i].begin(), ylist[i].end());
ylist[i].erase(unique(ylist[i].begin(), ylist[i].end()), ylist[i].end());
}
for (int i = 0; i < M; i++) {
int idx = lower_bound(ylist[X[i]].begin(), ylist[X[i]].end(), make_pair(Y[i], 0LL)) - ylist[X[i]].begin();
ylist[X[i]][idx].second = W[i];
}
for (int i = 0; i <= N + 1; i++) {
sum[i].push_back(0);
for (int j = 1; j < ylist[i].size(); j++) {
sum[i].push_back(sum[i].back() + ylist[i][j].second);
}
}
for (int i = 0; i <= N + 1; i++) {
for (int j = 0; j < ylist[i].size(); j++) dp[0][i].push_back(0);
for (int j = 0; j < ylist[i].size(); j++) dp[1][i].push_back(0);
}
for (int j = 1; j < ylist[0].size() - 1; j++) dp[0][0][j] = -1e18;
for (int j = 1; j < ylist[0].size() - 1; j++) dp[1][0][j] = -1e18;
full[0] = -1e18;
for (int i = 2; i <= N + 1; i++) {
vector<int> all;
for (int t = 0; t < ylist[i - 2].size(); t++) all.push_back(ylist[i - 2][t].first);
for (int t = 0; t < ylist[i - 1].size(); t++) all.push_back(ylist[i - 1][t].first);
for (int t = 0; t < ylist[i].size(); t++) all.push_back(ylist[i][t].first);
sort(all.begin(), all.end());
all.erase(unique(all.begin(), all.end()), all.end());
int j = 0, k = 0, l = 0;
for (int t = 1; t < all.size() - 1; t++) {
while (ylist[i][j] < make_pair(all[t], 0LL)) j++;
while (ylist[i - 1][k] < make_pair(all[t], 0LL)) k++;
while (ylist[i - 2][l] < make_pair(all[t], 0LL)) l++;
zero[i] = max(zero[i], dp[1][i - 1][k] + sum[i][j]);
}
zero[i] = max(zero[i], zero[i - 1]);
zero[i] = max(zero[i], full[i - 1] + sum[i][ylist[i].size() - 1]);
for (int t = 1; t < all.size() - 1; t++) {
while (ylist[i][j] < make_pair(all[t], 0LL)) j++;
while (ylist[i - 1][k] < make_pair(all[t], 0LL)) k++;
while (ylist[i - 2][l] < make_pair(all[t], 0LL)) l++;
full[i] = max(full[i], dp[0][i - 1][k] + sum[i - 1][ylist[i - 1].size() - 1] - sum[i - 1][k]);
}
full[i] = max(full[i], full[i - 1]);
full[i] = max(full[i], zero[i - 2] + sum[i - 1][ylist[i - 1].size() - 1]);
full[i] = max(full[i], full[i - 2] + sum[i - 1][ylist[i - 1].size() - 1]);
for (int t = 1; t < all.size() - 1; t++) {
while (ylist[i][j] < make_pair(all[t], 0LL)) j++;
while (ylist[i - 1][k] < make_pair(all[t], 0LL)) k++;
while (ylist[i - 2][l] < make_pair(all[t], 0LL)) l++;
full[i] = max(full[i], dp[1][i - 2][l] + sum[i - 1][ylist[i - 1].size() - 1]);
}
long long val0 = 0, val1 = 0;
for (int t = 1; t < all.size() - 1; t++) {
while (ylist[i][j] < make_pair(all[t], 0LL)) j++;
while (ylist[i - 1][k] < make_pair(all[t], 0LL)) k++;
while (ylist[i - 2][l] < make_pair(all[t], 0LL)) l++;
val0 = max(val0, dp[0][i - 1][k] - sum[i - 1][k]);
val1 = max(val1, dp[1][i - 1][k] + sum[i][j]);
}
for (int t = 1; t < all.size() - 1; t++) {
while (ylist[i][j] < make_pair(all[t], 0LL)) j++;
while (ylist[i - 1][k] < make_pair(all[t], 0LL)) k++;
while (ylist[i - 2][l] < make_pair(all[t], 0LL)) l++;
dp[0][i][j] = max(dp[0][i][j], val0 + sum[i - 1][k]);
dp[1][i][j] = max(dp[1][i][j], val1 - sum[i][j]);
dp[1][i][j] = max(dp[1][i][j], full[i - 1] + sum[i][ylist[i].size() - 1] - sum[i][j]);
dp[0][i][j] = max(dp[0][i][j], zero[i - 2] + sum[i - 1][k]);
dp[0][i][j] = max(dp[0][i][j], full[i - 2] + sum[i - 1][ylist[i - 1].size() - 1]);
}
long long val2 = 0;
for (int t = 1; t < all.size() - 1; t++) {
while (ylist[i][j] < make_pair(all[t], 0LL)) j++;
while (ylist[i - 1][k] < make_pair(all[t], 0LL)) k++;
while (ylist[i - 2][l] < make_pair(all[t], 0LL)) l++;
val2 = max(val2, dp[1][i - 2][l]);
dp[0][i][j] = max(dp[0][i][j], val2 + sum[i - 1][k]);
}
long long val3 = 0;
for (int t = 1; t < all.size() - 1; t++) {
while (ylist[i][j] < make_pair(all[t], 0LL)) j++;
while (ylist[i - 1][k] < make_pair(all[t], 0LL)) k++;
while (ylist[i - 2][l] < make_pair(all[t], 0LL)) l++;
val3 = max(val3, dp[1][i - 2][l] + sum[i - 1][k]);
dp[0][i][j] = max(dp[0][i][j], val3);
}
}
long long res = 0;
res = zero[N + 1];
return res;
}
Compilation message
fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:33:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
33 | for (int j = 1; j < ylist[i].size(); j++) {
| ~~^~~~~~~~~~~~~~~~~
fish.cpp:39:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
39 | for (int j = 0; j < ylist[i].size(); j++) dp[0][i].push_back(0);
| ~~^~~~~~~~~~~~~~~~~
fish.cpp:40:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
40 | for (int j = 0; j < ylist[i].size(); j++) dp[1][i].push_back(0);
| ~~^~~~~~~~~~~~~~~~~
fish.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
42 | for (int j = 1; j < ylist[0].size() - 1; j++) dp[0][0][j] = -1e18;
| ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
43 | for (int j = 1; j < ylist[0].size() - 1; j++) dp[1][0][j] = -1e18;
| ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:47:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
47 | for (int t = 0; t < ylist[i - 2].size(); t++) all.push_back(ylist[i - 2][t].first);
| ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:48:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
48 | for (int t = 0; t < ylist[i - 1].size(); t++) all.push_back(ylist[i - 1][t].first);
| ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:49:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
49 | for (int t = 0; t < ylist[i].size(); t++) all.push_back(ylist[i][t].first);
| ~~^~~~~~~~~~~~~~~~~
fish.cpp:54:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
54 | for (int t = 1; t < all.size() - 1; t++) {
| ~~^~~~~~~~~~~~~~~~
fish.cpp:63:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
63 | for (int t = 1; t < all.size() - 1; t++) {
| ~~^~~~~~~~~~~~~~~~
fish.cpp:72:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
72 | for (int t = 1; t < all.size() - 1; t++) {
| ~~^~~~~~~~~~~~~~~~
fish.cpp:80:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
80 | for (int t = 1; t < all.size() - 1; t++) {
| ~~^~~~~~~~~~~~~~~~
fish.cpp:87:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
87 | for (int t = 1; t < all.size() - 1; t++) {
| ~~^~~~~~~~~~~~~~~~
fish.cpp:98:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
98 | for (int t = 1; t < all.size() - 1; t++) {
| ~~^~~~~~~~~~~~~~~~
fish.cpp:106:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
106 | for (int t = 1; t < all.size() - 1; t++) {
| ~~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
137 ms |
36120 KB |
Output is correct |
| 2 |
Correct |
171 ms |
41332 KB |
Output is correct |
| 3 |
Correct |
52 ms |
25416 KB |
Output is correct |
| 4 |
Correct |
53 ms |
25420 KB |
Output is correct |
| 5 |
Correct |
486 ms |
71512 KB |
Output is correct |
| 6 |
Correct |
512 ms |
84040 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
9684 KB |
1st lines differ - on the 1st token, expected: '2', found: '1' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
56 ms |
25392 KB |
Output is correct |
| 2 |
Correct |
57 ms |
25408 KB |
Output is correct |
| 3 |
Correct |
109 ms |
32740 KB |
Output is correct |
| 4 |
Correct |
96 ms |
31752 KB |
Output is correct |
| 5 |
Correct |
177 ms |
42272 KB |
Output is correct |
| 6 |
Correct |
156 ms |
42312 KB |
Output is correct |
| 7 |
Correct |
163 ms |
42328 KB |
Output is correct |
| 8 |
Correct |
166 ms |
42336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
9684 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
9684 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
9684 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
56 ms |
25392 KB |
Output is correct |
| 2 |
Correct |
57 ms |
25408 KB |
Output is correct |
| 3 |
Correct |
109 ms |
32740 KB |
Output is correct |
| 4 |
Correct |
96 ms |
31752 KB |
Output is correct |
| 5 |
Correct |
177 ms |
42272 KB |
Output is correct |
| 6 |
Correct |
156 ms |
42312 KB |
Output is correct |
| 7 |
Correct |
163 ms |
42328 KB |
Output is correct |
| 8 |
Correct |
166 ms |
42336 KB |
Output is correct |
| 9 |
Incorrect |
198 ms |
51936 KB |
1st lines differ - on the 1st token, expected: '99999', found: '66666' |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
137 ms |
36120 KB |
Output is correct |
| 2 |
Correct |
171 ms |
41332 KB |
Output is correct |
| 3 |
Correct |
52 ms |
25416 KB |
Output is correct |
| 4 |
Correct |
53 ms |
25420 KB |
Output is correct |
| 5 |
Correct |
486 ms |
71512 KB |
Output is correct |
| 6 |
Correct |
512 ms |
84040 KB |
Output is correct |
| 7 |
Incorrect |
5 ms |
9684 KB |
1st lines differ - on the 1st token, expected: '2', found: '1' |
| 8 |
Halted |
0 ms |
0 KB |
- |
