#include "fish.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
using ll = long long;
ll max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W) {
vector<array<ll, 2>> a[n+1];
vector<ll> S[n+1];
for (int i = 0; i < m; ++i) a[X[i]+1].pb({Y[i]+1, W[i]});
for (int i = 1; i <= n; ++i) {
a[i].pb({0, 0});
sort(a[i].begin(), a[i].end());
S[i] = {0};
for (auto &[y, w] : a[i]) {
if (y >= 0) {
S[i].pb(S[i].back() + w);
}
}
}
ll dp[n+1][n+1][2];
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= n; ++j) dp[i][j][0] = dp[i][j][1] = 0;
}
auto sum = [&](int i, int h) {
array<ll, 2> cr = {h, (int)1e9};
return S[i][upper_bound(a[i].begin(), a[i].end(), cr) - a[i].begin() - 1];
};
ll mx = 0;
for (int i = 2; i <= n; ++i) {
for (int h = 0; h <= 1; ++h) {
for (int h2 = 1; h2 <= 1; ++h2) {
if (h2 <= h) {
dp[i][h][0] = max(sum(i-1, h) - sum(i-1, h2) + dp[i-1][h2][0], dp[i][h][0]);
}
if (h2 >= h) dp[i][h][1] = max(sum(i, h2) - sum(i, h) + dp[i-1][h2][1], dp[i][h][1]);
if (i >= 3) dp[i][h][0] = max(sum(i-1, max(h, h2)) + dp[i-2][h2][1] , dp[i][h][0]);
else {
dp[i][h][0] = max(dp[i][h][0], sum(i-1, h));
}
}
mx = max({mx, dp[i][h][0], dp[i][h][1]});
}
dp[i][n-1][0] = dp[i][n-1][1] = max({dp[i][n-1][0], dp[i][n-1][1]});
}
return mx;
}
