# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
828578 | 2023-08-17T11:41:26 Z | ttamx | Catfish Farm (IOI22_fish) | C++17 | 729 ms | 154208 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 688 ms | 148864 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 312 KB | Output is correct |
2 | Runtime error | 711 ms | 154208 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 729 ms | 143648 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 316 KB | Output is correct |
7 | Correct | 1 ms | 340 KB | Output is correct |
8 | Correct | 1 ms | 340 KB | Output is correct |
9 | Incorrect | 1 ms | 2004 KB | 1st lines differ - on the 1st token, expected: '216624184325', found: '7818664569' |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 316 KB | Output is correct |
7 | Correct | 1 ms | 340 KB | Output is correct |
8 | Correct | 1 ms | 340 KB | Output is correct |
9 | Incorrect | 1 ms | 2004 KB | 1st lines differ - on the 1st token, expected: '216624184325', found: '7818664569' |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 316 KB | Output is correct |
7 | Correct | 1 ms | 340 KB | Output is correct |
8 | Correct | 1 ms | 340 KB | Output is correct |
9 | Incorrect | 1 ms | 2004 KB | 1st lines differ - on the 1st token, expected: '216624184325', found: '7818664569' |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 729 ms | 143648 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 688 ms | 148864 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |