// #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 = 305;
bool fish[maxn][maxn];
ll weights[maxn][maxn];
ll p[maxn][maxn];
ll dp[maxn][maxn][2];
ll pref[maxn][maxn][2];
ll pref2[maxn][maxn][2];
ll suff[maxn][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,maxn){
FOR(j,0,maxn){
weights[i][j] = 0;
fish[i][j] = false;
dp[i][j][0] = 0;
dp[i][j][1] = 0;
pref[i][j][0] = 0;
pref[i][j][1] = 0;
pref2[i][j][0] = 0;
pref2[i][j][1] = 0;
suff[i][j][0] = 0;
suff[i][j][1] = 0;
}
}
FOR(i,0,M){
Y[i]++;
fish[X[i]][Y[i]] = true;
weights[X[i]][Y[i]] = W[i];
}
FOR(i,0,maxn){
p[i][0] = 0;
FOR(j,1,maxn){
p[i][j] = p[i][j-1] + weights[i][j];
}
}
FOR(i,0,N+1){
FOR(j,0,N+1){
FOR(k,0,2){
if (i<2) continue;
ll temp = 0;
ll add = 0;
if (k==0){
temp = max(temp, suff[i-1][j+1][0] - p[i-1][j]);
temp = max(temp, suff[i-1][j+1][1] - p[i-1][j]);
// 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{
temp = max(temp, pref[i-1][j][0]);
temp = max(temp, pref[i-1][j][1] + p[i-2][j]);
// 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][j][k] = temp;
}
}
FOR(k,0,2){
ll tempadd = 0;
ll tempadd2 = 0;
FOR(j,0,N+1){
tempadd += weights[i][j];
suff[i][j][k] = dp[i][j][k]+tempadd;
}
FOR(j,0,N+1){
if (i>1) tempadd2 -= weights[i-1][j];
pref[i][j][k] = dp[i][j][k] + tempadd2;
pref2[i][j][k] = dp[i][j][k];
}
FOR(j,1,N+1){
pref[i][j][k] = max(pref[i][j][k], pref[i][j-1][k]);
pref2[i][j][k] = max(pref2[i][j][k], pref2[i][j-1][k]);
}
FOR(j,N,-1){
suff[i][j][k] = max(suff[i][j][k], suff[i][j+1][k]);
}
}
}
ll ans = 0;
FOR(i,0,N+1) FOR(j,0,N+1)FOR(k,0,2){
//if (dp[i][j][k]==305) cout << i << " " << j << " " << k << endl;
ans = max(ans, dp[i][j][k]);
}
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:69:20: warning: unused variable 'add' [-Wunused-variable]
69 | ll add = 0;
| ^~~
fish.cpp:114:66: warning: array subscript -1 is below array bounds of 'll [305][2]' {aka 'long long int [305][2]'} [-Warray-bounds]
114 | suff[i][j][k] = max(suff[i][j][k], suff[i][j+1][k]);
| ~~~~~~~~~~~~~~^
fish.cpp:114:49: warning: array subscript -2 is below array bounds of 'll [305][2]' {aka 'long long int [305][2]'} [-Warray-bounds]
114 | suff[i][j][k] = max(suff[i][j][k], suff[i][j+1][k]);
| ~~~~~~~~~~~~^
fish.cpp:114:46: warning: array subscript -2 is below array bounds of 'll [305][2]' {aka 'long long int [305][2]'} [-Warray-bounds]
114 | suff[i][j][k] = max(suff[i][j][k], suff[i][j+1][k]);
| ~~~~~~~~~^
fish.cpp:114:63: warning: array subscript -1 is below array bounds of 'll [305][2]' {aka 'long long int [305][2]'} [-Warray-bounds]
114 | suff[i][j][k] = max(suff[i][j][k], suff[i][j+1][k]);
| ~~~~~~~~~~~^
fish.cpp:114:26: warning: array subscript -2 is below array bounds of 'll [305][2]' {aka 'long long int [305][2]'} [-Warray-bounds]
114 | suff[i][j][k] = max(suff[i][j][k], suff[i][j+1][k]);
| ~~~~~~~~~^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
71 ms |
19936 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
7648 KB |
Output is correct |
| 2 |
Runtime error |
86 ms |
24164 KB |
Execution killed with signal 11 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
31 ms |
15452 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 2 |
Correct |
4 ms |
7768 KB |
Output is correct |
| 3 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 4 |
Correct |
3 ms |
7600 KB |
Output is correct |
| 5 |
Correct |
5 ms |
7772 KB |
Output is correct |
| 6 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 7 |
Correct |
4 ms |
7772 KB |
Output is correct |
| 8 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 9 |
Incorrect |
5 ms |
7772 KB |
1st lines differ - on the 1st token, expected: '216624184325', found: '118319958954' |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 2 |
Correct |
4 ms |
7768 KB |
Output is correct |
| 3 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 4 |
Correct |
3 ms |
7600 KB |
Output is correct |
| 5 |
Correct |
5 ms |
7772 KB |
Output is correct |
| 6 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 7 |
Correct |
4 ms |
7772 KB |
Output is correct |
| 8 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 9 |
Incorrect |
5 ms |
7772 KB |
1st lines differ - on the 1st token, expected: '216624184325', found: '118319958954' |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 2 |
Correct |
4 ms |
7768 KB |
Output is correct |
| 3 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 4 |
Correct |
3 ms |
7600 KB |
Output is correct |
| 5 |
Correct |
5 ms |
7772 KB |
Output is correct |
| 6 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 7 |
Correct |
4 ms |
7772 KB |
Output is correct |
| 8 |
Correct |
3 ms |
7772 KB |
Output is correct |
| 9 |
Incorrect |
5 ms |
7772 KB |
1st lines differ - on the 1st token, expected: '216624184325', found: '118319958954' |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
31 ms |
15452 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
71 ms |
19936 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
