第一个点和样例的数据本地都能过，但放到洛谷上0pts，求大佬看看代码qwq

#include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
const int MAXN = 10;
int n, f[MAXN<<1][MAXN][MAXN], w[MAXN][MAXN];
signed main() {
	cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
	cin >> n;
	for(int i, j = 1; i != 0 || j != 0; cin >> i >> j >> w[i][j]);
	// k = x + y i = y1 j = y2
	for(int k = 1; k <= n<<1; k++) for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++)
		f[k][i][j] = (i == j ? 0 : w[k-j][j]) + w[k-i][i] + max(max(f[k-1][i][j], f[k-1][i][j-1]), max(f[k-1][i-1][j], f[k-1][i-1][j-1]));
	cout << f[n<<1][n][n];
}