// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
const ll maxn = 100005;
set<ll> heights[maxn];
basic_string<ll> realheights[maxn];
unordered_map<ll,ll> weights[maxn];
basic_string<ll> p[maxn];
basic_string<array<ll,2>> dp[maxn];
basic_string<ll> pref[maxn][2];
basic_string<ll> pref2[maxn][2];
basic_string<ll> suff[maxn][2];
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
std::vector<int> W) {
FOR(i,0,M){
Y[i]++;
weights[X[i]][Y[i]] = W[i];
if (X[i] > 0) heights[X[i]-1].insert(Y[i]);
if (X[i] > 1) heights[X[i]-2].insert(Y[i]);
heights[X[i]].insert(Y[i]);
heights[X[i]+1].insert(Y[i]);
}
FOR(i,0,maxn) heights[i].insert(0);
FOR(i,0,maxn) heights[i].insert(maxn);
FOR(i,0,maxn){
FOR(k,0,2){
pref[i][k].resize(heights[i].size());
pref2[i][k].resize(heights[i].size());
suff[i][k].resize(heights[i].size());
}
p[i].resize(heights[i].size());
dp[i].resize(heights[i].size());
}
FOR(i,0,maxn){
for (auto k : heights[i]) realheights[i].push_back(k);
}
FOR(i,0,maxn){
p[i][0] = 0;
ll prev = 0;
FOR(j,1,heights[i].size()){
p[i][j] = p[i][j-1] + weights[i][realheights[i][j]];
}
}
FOR(i,1,N+1){
FOR(X,0,dp[i].size()){
ll j = realheights[i][X];
FOR(k,0,2){
if (i<2) continue;
ll temp = 0;
ll add = 0;
if (k==0){
if (X==dp[i].size()-1) continue;
ll down = upper_bound(realheights[i-1].begin(), realheights[i-1].end(), j) - realheights[i-1].begin() - 1;
temp = max(temp, suff[i-1][0][down] - p[i-1][down]);
temp = max(temp, suff[i-1][1][down] - p[i-1][down]);
// FOR(p,j+1,N+1){
// if (fish[i-1][p]) add += weights[i-1][p];
// temp = max(temp, dp[i-1][p][0] + add);
// temp = max(temp, dp[i-1][p][1] + add);
// }
}else{
ll down = upper_bound(realheights[i-1].begin(), realheights[i-1].end(), j) - realheights[i-1].begin() - 1;
ll down2 = upper_bound(realheights[i-2].begin(), realheights[i-2].end(), j) - realheights[i-2].begin() - 1;
temp = max(temp, pref[i-1][0][down]);
temp = max(temp, pref[i-1][1][down] + p[i-2][down2]);
// FOR(p,0,j+1) if (fish[i-2][p]) add += weights[i-2][p];
// FOR(p,0,j+1){
// if (fish[i-2][p]) add -= weights[i-2][p];
// temp = max(temp, dp[i-1][p][0]);
// temp = max(temp, dp[i-1][p][1] + add);
// }
}
dp[i][X][k] = temp;
}
}
ll sz = realheights[i].size();
FOR(k,0,2){
ll tempadd = 0;
ll tempadd2 = 0;
FOR(j,0,sz){
if (weights[i].count(realheights[i][j])) tempadd += weights[i][realheights[i][j]];
suff[i][k][j] = dp[i][j][k]+tempadd;
}
FOR(j,0,sz){
if (weights[i-1].count(realheights[i][j]))tempadd2 -= weights[i-1][realheights[i][j]];
pref[i][k][j] = dp[i][j][k] + tempadd2;
pref2[i][k][j] = dp[i][j][k];
}
ll prev = 0;
FOR(j,1,sz){
pref[i][k][j] = max(pref[i][k][j], pref[i][k][j-1]);
pref2[i][k][j] = max(pref2[i][k][j], pref2[i][k][j-1]);
}
FORNEG(j,sz-2,-1){
suff[i][k][j] = max(suff[i][k][j], suff[i][k][j+1]);
}
}
// cout << i << endl;
// cout << suff[2][2][0] << "FUCK" << endl;
}
// cout << dp[3][2][0] << endl;
ll ans = 0;
FOR(i,0,N+1){
FOR(j,0,dp[i].size()){
ans = max(dp[i][j][0], ans);
ans = max(dp[i][j][1], ans);
}
}
return ans;
}
Compilation message
fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:9:33: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::set<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
9 | #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
63 | FOR(j,1,heights[i].size()){
| ~~~~~~~~~~~~~~~~~~~~~
fish.cpp:63:9: note: in expansion of macro 'FOR'
63 | FOR(j,1,heights[i].size()){
| ^~~
fish.cpp:62:12: warning: unused variable 'prev' [-Wunused-variable]
62 | ll prev = 0;
| ^~~~
fish.cpp:9:33: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
9 | #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
72 | FOR(X,0,dp[i].size()){
| ~~~~~~~~~~~~~~~~
fish.cpp:72:9: note: in expansion of macro 'FOR'
72 | FOR(X,0,dp[i].size()){
| ^~~
fish.cpp:81:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
81 | if (X==dp[i].size()-1) continue;
| ~^~~~~~~~~~~~~~~~
fish.cpp:79:20: warning: unused variable 'add' [-Wunused-variable]
79 | ll add = 0;
| ^~~
fish.cpp:129:16: warning: unused variable 'prev' [-Wunused-variable]
129 | ll prev = 0;
| ^~~~
fish.cpp:9:33: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
9 | #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
156 | FOR(j,0,dp[i].size()){
| ~~~~~~~~~~~~~~~~
fish.cpp:156:9: note: in expansion of macro 'FOR'
156 | FOR(j,0,dp[i].size()){
| ^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
189 ms |
121876 KB |
Output is correct |
| 2 |
Correct |
221 ms |
129988 KB |
Output is correct |
| 3 |
Correct |
80 ms |
93520 KB |
Output is correct |
| 4 |
Correct |
82 ms |
93524 KB |
Output is correct |
| 5 |
Execution timed out |
1054 ms |
306100 KB |
Time limit exceeded |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
74 ms |
93776 KB |
1st lines differ - on the 1st token, expected: '2', found: '1' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
99 ms |
93352 KB |
Output is correct |
| 2 |
Correct |
112 ms |
93428 KB |
Output is correct |
| 3 |
Correct |
132 ms |
107864 KB |
Output is correct |
| 4 |
Correct |
122 ms |
104784 KB |
Output is correct |
| 5 |
Correct |
193 ms |
117736 KB |
Output is correct |
| 6 |
Correct |
193 ms |
117792 KB |
Output is correct |
| 7 |
Correct |
208 ms |
117844 KB |
Output is correct |
| 8 |
Correct |
198 ms |
117840 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
94 ms |
93520 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
94 ms |
93520 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
94 ms |
93520 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
99 ms |
93352 KB |
Output is correct |
| 2 |
Correct |
112 ms |
93428 KB |
Output is correct |
| 3 |
Correct |
132 ms |
107864 KB |
Output is correct |
| 4 |
Correct |
122 ms |
104784 KB |
Output is correct |
| 5 |
Correct |
193 ms |
117736 KB |
Output is correct |
| 6 |
Correct |
193 ms |
117792 KB |
Output is correct |
| 7 |
Correct |
208 ms |
117844 KB |
Output is correct |
| 8 |
Correct |
198 ms |
117840 KB |
Output is correct |
| 9 |
Incorrect |
353 ms |
160124 KB |
1st lines differ - on the 1st token, expected: '99999', found: '66666' |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
189 ms |
121876 KB |
Output is correct |
| 2 |
Correct |
221 ms |
129988 KB |
Output is correct |
| 3 |
Correct |
80 ms |
93520 KB |
Output is correct |
| 4 |
Correct |
82 ms |
93524 KB |
Output is correct |
| 5 |
Execution timed out |
1054 ms |
306100 KB |
Time limit exceeded |
| 6 |
Halted |
0 ms |
0 KB |
- |
