#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
ll max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W){
vector<vector<pair<int, ll>>> v(n);
for(int i = 0; i < n; i++) v[i].pb({0, 0});
for(int i = 0; i < n; i++) v[i].pb({n+1, 0});
for(int i = 0; i < m; i++) v[X[i]].pb({Y[i]+1, W[i]});
for(auto &s: v) sort(s.begin(), s.end());
vector<vector<ll>> dp_up(n), dp_down, dtu2, pref;
vector<ll> dtu(n, 0);
for(int i = 0; i < n; i++) dp_up[i].resize(v[i].size(), 0);
dp_down = dp_up;
dtu2 = dp_up;
pref = dp_up;
for(int i = 0; i < n; i++) for(int j = 0; j < pref[i].size(); j++){
if(j) pref[i][j] = pref[i][j-1];
pref[i][j]+=v[i][j].sc;
}
for(int i = n-1; i >= 0; i--){
for(int j = 0; j < v[i].size(); j++){
if(i == n-1){
dp_down[i][j] = 0;
dp_up[i][j] = 0;
continue;
}
int in1 = lower_bound(v[i+1].begin(), v[i+1].end(), make_pair(v[i][j].f, -1LL))-v[i+1].begin();
if(in1 == v[i+1].size()) in1--;
dp_up[i][j]-=pref[i][j];
dp_down[i][j]-=pref[i+1].back()-pref[i+1][in1];
dp_up[i][j] = max(dp_up[i][j], pref[i].back()-pref[i][j]+dp_down[i+1].back());
if(i+2 < n){
int in2 = lower_bound(v[i+2].begin(), v[i+2].end(), make_pair(v[i][j].f, -1LL))-v[i+2].begin();
if(in2 == v[i+2].size()) in2--;
dp_down[i][j] = max(dp_down[i][j], dtu2[i+2][in2]+pref[i+1][in1]);
dp_down[i][j] = max(dp_down[i][j], dtu[i+2]-pref[i+1][in1]);
dp_down[i][j] = max(dp_down[i][j], pref[i+1].back()+dp_down[i+2].back());
}
}
if(i){
ll mx = 0, s = 0;
auto it = v[i-1].begin();
for(int j = 0; j < v[i].size(); j++){
while(it != v[i-1].end() && it->f <= v[i][j].f) s+=it->sc, it++;
mx = max(mx, s+dp_up[i][j]);
}
fill(dp_up[i-1].begin(), dp_up[i-1].end(), mx);
dtu[i] = mx;
mx = 0;
for(int j = 0; j < v[i].size(); j++) mx = max(mx, pref[i].back()-pref[i][j]+dp_down[i][j]);
fill(dp_down[i-1].begin(), dp_down[i-1].end(), mx);
for(int j = 0; j < v[i].size(); j++){
if(j) dtu2[i][j] = dtu2[i][j-1];
dtu2[i][j] = max(dtu2[i][j], dp_up[i][j]);
}
}
}
return max(*max_element(dp_up[0].begin(), dp_up[0].end()), *max_element(dp_down[0].begin(), dp_down[0].end()));
}
Compilation message
fish.cpp: In function 'll max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:25:49: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
25 | for(int i = 0; i < n; i++) for(int j = 0; j < pref[i].size(); j++){
| ~~^~~~~~~~~~~~~~~~
fish.cpp:31:26: 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]
31 | for(int j = 0; j < v[i].size(); j++){
| ~~^~~~~~~~~~~~~
fish.cpp:39:20: 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 | if(in1 == v[i+1].size()) in1--;
| ~~~~^~~~~~~~~~~~~~~~
fish.cpp:47:24: 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 | if(in2 == v[i+2].size()) in2--;
| ~~~~^~~~~~~~~~~~~~~~
fish.cpp:57:30: 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]
57 | for(int j = 0; j < v[i].size(); j++){
| ~~^~~~~~~~~~~~~
fish.cpp:65:30: 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]
65 | for(int j = 0; j < v[i].size(); j++) mx = max(mx, pref[i].back()-pref[i][j]+dp_down[i][j]);
| ~~^~~~~~~~~~~~~
fish.cpp:68:30: 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]
68 | for(int j = 0; j < v[i].size(); j++){
| ~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
72 ms |
32672 KB |
Output is correct |
| 2 |
Correct |
92 ms |
37068 KB |
Output is correct |
| 3 |
Correct |
49 ms |
29912 KB |
Output is correct |
| 4 |
Correct |
46 ms |
30036 KB |
Output is correct |
| 5 |
Correct |
171 ms |
51200 KB |
Output is correct |
| 6 |
Correct |
238 ms |
53452 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 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 |
54 ms |
29964 KB |
Output is correct |
| 2 |
Correct |
48 ms |
29976 KB |
Output is correct |
| 3 |
Correct |
88 ms |
31264 KB |
Output is correct |
| 4 |
Correct |
72 ms |
32848 KB |
Output is correct |
| 5 |
Correct |
129 ms |
37804 KB |
Output is correct |
| 6 |
Correct |
117 ms |
37068 KB |
Output is correct |
| 7 |
Correct |
127 ms |
37672 KB |
Output is correct |
| 8 |
Correct |
133 ms |
37680 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 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 |
0 ms |
212 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 |
0 ms |
212 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 |
54 ms |
29964 KB |
Output is correct |
| 2 |
Correct |
48 ms |
29976 KB |
Output is correct |
| 3 |
Correct |
88 ms |
31264 KB |
Output is correct |
| 4 |
Correct |
72 ms |
32848 KB |
Output is correct |
| 5 |
Correct |
129 ms |
37804 KB |
Output is correct |
| 6 |
Correct |
117 ms |
37068 KB |
Output is correct |
| 7 |
Correct |
127 ms |
37672 KB |
Output is correct |
| 8 |
Correct |
133 ms |
37680 KB |
Output is correct |
| 9 |
Incorrect |
134 ms |
37528 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 |
72 ms |
32672 KB |
Output is correct |
| 2 |
Correct |
92 ms |
37068 KB |
Output is correct |
| 3 |
Correct |
49 ms |
29912 KB |
Output is correct |
| 4 |
Correct |
46 ms |
30036 KB |
Output is correct |
| 5 |
Correct |
171 ms |
51200 KB |
Output is correct |
| 6 |
Correct |
238 ms |
53452 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
212 KB |
1st lines differ - on the 1st token, expected: '2', found: '1' |
| 8 |
Halted |
0 ms |
0 KB |
- |
