#include <iostream>
#include <complex>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <functional>
#include <bitset>
#include <queue>
#include <map>
#include <stack>
#include <cmath>
#include <cstdint>
//#include "fish.h"
using namespace std;
#pragma GCC optimize("O3")
#define endl '\n'
#define db double
#define ll long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;
const int Max = 1e6 + 7, Inf = 1e9 + 7;
void print(bool x) { cout << (x ? "YES" : "NO") << endl; }
string tostring (__int128 x)
{
string ans = "";
while(x > 0)
{
ans += (x % 10 + '0');
x /= 10;
}
reverse(all(ans));
return ans;
}
long long max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W)
{
vector <vector<pair<ll, ll>>> v(n + 7, vector <pair<ll, ll>> ());
//vector <vector<ll>> v(n, vector <ll> (n+1, 0));
unordered_map <int, unordered_map <int, int>> mp;
for(int i = 0; i < m; i++){
//v[X[i]][Y[i]+1] = W[i];
v[X[i]].push_back({ Y[i] + 1, W[i] });
if(X[i] > 0) v[X[i]-1].push_back({ Y[i] + 1, 0 });
if(X[i] > 1) v[X[i]-2].push_back({ Y[i] + 1, 0 });
if(X[i] < n) v[X[i]+1].push_back({ Y[i] + 1, 0 });
if(X[i] < n) v[X[i]+2].push_back({ Y[i] + 1, 0 });
}
for(int i = 0; i < n; i++)
{
v[i].push_back({ 0, 0 }); sort(all(v[i]));
for(int j = 0; j < (int) v[i].size(); j++){
if (j != 0) v[i][j].sd += v[i][j-1].sd;
mp[i][v[i][j].fs] = j;
}
}
auto C = [&] (int i, int j, int k) -> ll
{
ll ans = 0;
if(i >= 0 && i < n) {
ans = ans + max(0LL, v[i][mp[i][j]].sd - v[i][mp[i][k]].sd);
}
return ans;
};
vector <vector<ll>> dp1, dp2; ll ans = 0;
for(int i = 0; i < n; i++)
{
dp1.push_back(vector <ll> (v[i].size(), 0));
dp2.push_back(vector <ll> (v[i].size(), 0));
for(int j = 0; j < (int) v[i].size(); j++)
{
int hj = v[i][j].fs;
dp1[i][j] = C(i-1, hj, 0) + C(i+1, hj, 0);
dp2[i][j] = C(i-1, hj, 0) + C(i+1, hj, 0);
if(i > 1){
/*for(int k = 0; k < (int) v[i-2].size(); k++){
int hk = v[i-2][k].fs;
dp1[i][j] = max(dp1[i][j], (i > 1 ? dp2[i-2][k] : 0LL) + C(i-1, hj, hk) + C(i+1, hj, 0));
}*/
}
if(i > 0){
/*for(int k = 0; k < (int) v[i-1].size(); k++){
int hk = v[i-1][k].fs;
dp1[i][j] = max(dp1[i][j], (i != 0 ? dp1[i-1][k] : 0) + C(i-1, hj, hk) + C(i+1, hj, 0) - C(i, hk, 0));
}*/
/*for(int k = 0; k < (int) v[i-1].size(); k++){
int hk = v[i-1][k].fs;
dp2[i][j] = max(dp2[i][j], (i != 0 ? dp1[i-1][k] : 0) - C(i, hj, 0) + C(i+1, hj, 0));
dp2[i][j] = max(dp2[i][j], (i != 0 ? dp2[i-1][k] : 0) - C(i, hj, 0) + C(i+1, hj, 0));
}*/
}
ans = max(ans, max(dp1[i][j], dp2[i][j]));
}
if(i > 1)
{
ll k = 0, mx = 0, tmp = 0;
for(k = 0; k < (int) v[i-2].size(); k++){
tmp = max(tmp, dp2[i-2][k]);
}
for(int j = 0; j < (int) v[i].size(); j++)
{
int hj = v[i][j].fs;
for(k; k < (ll) v[i-1].size(); k++)
{
if(v[i-2][k].fs <= v[i][j].fs)
{
int hk = v[i-2][k].fs, hx = v[i-2][mx].fs;
ll val1 = dp2[i-2][mx] + C(i-1, hj, hx) + C(i+1, hj, 0);
ll val2 = dp2[i-2][k] + C(i-1, hj, hk) + C(i+1, hj, 0);
if(val1 < val2){
mx = k;
}
} else break;
}
int hx = v[i-1][mx].fs;
dp1[i][j] = max(dp1[i][j], dp2[i-2][mx] + C(i-1, hj, hx) + C(i+1, hj, 0));
dp1[i][j] = max(dp1[i][j], tmp + C(i+1, hj, 0));
ans = max(ans, dp1[i][j]);
}
}
if(i > 0)
{
ll k = v[i-1].size() - 1, mx = 0;
for(int j = (int) v[i].size() - 1; j >= 0; j--)
{
int hj = v[i][j].fs;
for(k; k >= 0; k--){
if(v[i-1][k].fs >= v[i][j].fs){
mx = max(mx, dp1[i-1][k]);
mx = max(mx, dp2[i-1][k]);
} else break;
}
dp2[i][j] = max(dp2[i][j], mx - C(i, hj, 0) + C(i+1, hj, 0));
ans = max(ans, max(dp1[i][j], dp2[i][j]));
}
ll tmp = 0;
for(k = 0; k < (int) v[i-1].size(); k++){
int hk = v[i-1][k].fs;
tmp = max(tmp, dp1[i-1][k] - C(i, hk, 0));
}
k = 0; mx = 0;
for(int j = 0; j < (int) v[i].size(); j++)
{
int hj = v[i][j].fs;
for(k; k < (ll) v[i-1].size(); k++)
{
if(v[i-1][k].fs <= v[i][j].fs)
{
int hk = v[i-1][k].fs, hx = v[i-1][mx].fs;
ll val1 = dp1[i-1][mx] + C(i-1, hj, hx) + C(i+1, hj, 0) - C(i, hx, 0);
ll val2 = dp1[i-1][k] + C(i-1, hj, hk) + C(i+1, hj, 0) - C(i, hk, 0);
if(val1 < val2){
mx = k;
}
} else break;
}
int hx = v[i-1][mx].fs;
dp1[i][j] = max(dp1[i][j], dp1[i-1][mx] + C(i-1, hj, hx) + C(i+1, hj, 0) - C(i, hx, 0));
dp1[i][j] = max(dp1[i][j], tmp + C(i+1, hj, 0));
ans = max(ans, max(dp1[i][j], dp2[i][j]));
}
}
}
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:130:21: warning: statement has no effect [-Wunused-value]
130 | for(k; k < (ll) v[i-1].size(); k++)
| ^
fish.cpp:159:21: warning: statement has no effect [-Wunused-value]
159 | for(k; k >= 0; k--){
| ^
fish.cpp:183:21: warning: statement has no effect [-Wunused-value]
183 | for(k; k < (ll) v[i-1].size(); k++)
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
200 ms |
60580 KB |
Output is correct |
| 2 |
Correct |
231 ms |
72104 KB |
Output is correct |
| 3 |
Correct |
80 ms |
40376 KB |
Output is correct |
| 4 |
Correct |
87 ms |
40116 KB |
Output is correct |
| 5 |
Correct |
953 ms |
197468 KB |
Output is correct |
| 6 |
Execution timed out |
1066 ms |
182964 KB |
Time limit exceeded |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
370 ms |
82152 KB |
Output is correct |
| 3 |
Correct |
455 ms |
94224 KB |
Output is correct |
| 4 |
Correct |
210 ms |
60836 KB |
Output is correct |
| 5 |
Correct |
240 ms |
71828 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
102 ms |
39976 KB |
Output is correct |
| 11 |
Correct |
98 ms |
40884 KB |
Output is correct |
| 12 |
Correct |
252 ms |
65820 KB |
Output is correct |
| 13 |
Correct |
324 ms |
79668 KB |
Output is correct |
| 14 |
Correct |
245 ms |
63516 KB |
Output is correct |
| 15 |
Correct |
250 ms |
65136 KB |
Output is correct |
| 16 |
Correct |
257 ms |
63616 KB |
Output is correct |
| 17 |
Correct |
282 ms |
72692 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
91 ms |
40116 KB |
Output is correct |
| 2 |
Correct |
91 ms |
40404 KB |
Output is correct |
| 3 |
Correct |
244 ms |
49640 KB |
Output is correct |
| 4 |
Correct |
195 ms |
49848 KB |
Output is correct |
| 5 |
Correct |
380 ms |
64688 KB |
Output is correct |
| 6 |
Correct |
381 ms |
64096 KB |
Output is correct |
| 7 |
Correct |
404 ms |
65508 KB |
Output is correct |
| 8 |
Correct |
380 ms |
64788 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
344 KB |
1st lines differ - on the 1st token, expected: '7', found: '85' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
344 KB |
1st lines differ - on the 1st token, expected: '7', found: '85' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
344 KB |
1st lines differ - on the 1st token, expected: '7', found: '85' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
91 ms |
40116 KB |
Output is correct |
| 2 |
Correct |
91 ms |
40404 KB |
Output is correct |
| 3 |
Correct |
244 ms |
49640 KB |
Output is correct |
| 4 |
Correct |
195 ms |
49848 KB |
Output is correct |
| 5 |
Correct |
380 ms |
64688 KB |
Output is correct |
| 6 |
Correct |
381 ms |
64096 KB |
Output is correct |
| 7 |
Correct |
404 ms |
65508 KB |
Output is correct |
| 8 |
Correct |
380 ms |
64788 KB |
Output is correct |
| 9 |
Correct |
435 ms |
83172 KB |
Output is correct |
| 10 |
Correct |
318 ms |
45648 KB |
Output is correct |
| 11 |
Correct |
690 ms |
90736 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
1 ms |
856 KB |
Output is correct |
| 18 |
Correct |
85 ms |
40120 KB |
Output is correct |
| 19 |
Correct |
100 ms |
40624 KB |
Output is correct |
| 20 |
Correct |
98 ms |
40480 KB |
Output is correct |
| 21 |
Correct |
82 ms |
40364 KB |
Output is correct |
| 22 |
Incorrect |
493 ms |
83676 KB |
1st lines differ - on the 1st token, expected: '45561826463480', found: '45561005144564' |
| 23 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
200 ms |
60580 KB |
Output is correct |
| 2 |
Correct |
231 ms |
72104 KB |
Output is correct |
| 3 |
Correct |
80 ms |
40376 KB |
Output is correct |
| 4 |
Correct |
87 ms |
40116 KB |
Output is correct |
| 5 |
Correct |
953 ms |
197468 KB |
Output is correct |
| 6 |
Execution timed out |
1066 ms |
182964 KB |
Time limit exceeded |
| 7 |
Halted |
0 ms |
0 KB |
- |
