# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
626564 | Kaitokid | Catfish Farm (IOI22_fish) | C++17 | 1098 ms | 213072 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<bits/stdc++.h>
using namespace std;
typedef long long ll;
int mx;
ll dp[3009][3009][2];
ll sum[3009][3009];
ll go(int x,int lst,int u)
{
if(x==mx)return 0;
if(dp[x][lst][u]!=-1)return dp[x][lst][u];
for(int i=0;i<=mx;i++)
{
ll d=0;
if(u==0 && i>lst) d=sum[x-1][i]-sum[x-1][lst];
dp[x][lst][u]=max(dp[x][lst][u],d+go(x+1,i,0));
if(i<lst)d+=sum[x][lst]-sum[x][i];
dp[x][lst][u]=max(dp[x][lst][u],d+go(x+1,i,1));
}
return dp[x][lst][u];
}
ll max_weights(int N,int M,vector<int>X,vector<int>Y,vector<int>W)
{
mx=N;
for(int i=0;i<M;i++)sum[X[i]][Y[i]+1]+=W[i];
for(int i=0;i<N;i++)
for(int j=1;j<=N;j++)sum[i][j]+=sum[i][j-1];
memset(dp,-1,sizeof dp);
ll ans=0;
for(int i=0;i<=N;i++)
ans=max(ans,go(1,i,0));
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... |