# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
828578 | ttamx | Catfish Farm (IOI22_fish) | C++17 | 729 ms | 154208 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3005;
const ll inf=1e18;
int n,m;
ll w[N][N];
ll dp[N][N][2];
long long max_weights(int _n,int _m,vector<int> X,vector<int> Y,vector<int> W) {
n=_n,m=_m;
for(int i=0;i<m;i++)w[X[i]+1][Y[i]+1]=W[i];
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)w[i][j]+=w[i][j-1];
for(int i=1;i<=n;i++)for(int j=0;j<=n;j++)dp[i][j][0]=dp[i][j][1]=-inf;
for(int i=1;i<=n;i++){
ll tmp=-inf,tmp2=-inf;
for(int j=0;j<=n;j++){
tmp=max(tmp,dp[i-1][j][0]-w[i][j]-w[i-1][j]);
dp[i][j][0]=w[i-1][j]+tmp+w[i+1][j];
}
tmp=-inf;
for(int j=n;j>=0;j--){
tmp=max(tmp,dp[i-1][j][1]);
dp[i][j][1]=tmp-w[i][j]+w[i+1][j];
dp[i][j][1]=max(dp[i][j][1],dp[i][j][0]);
}
}
ll ans=0;
for(int i=0;i<=n;i++)ans=max(ans,dp[n][i][1]);
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |