# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70486 | 2018-08-23T04:34:46 Z | leehosu01 | On grid (kriii2_O) | C++17 | 30 ms | 2756 KB |
#pragma GCC optimize("-O3") #include<bits/stdc++.h> using namespace std; long long MP[301][301],CR[301][301],BF[301][301],CG[302],BG[302],to; int N,M; int main() { scanf("%d%d",&N,&M); int i,j,k; for(i=1;i<=N;i++) for(j=1;j<=M;j++) BF[i][j]=-(1ll<<40),scanf("%lld",MP[i]+j); CG[M+1]=BG[M+1]=-(1ll<<40); for(to=0,j=M;j;j--)BG[j]=BF[j][M]=to+=MP[N][j]; for(i=N-1;i;i--,swap(CG,BG),swap(CR,BF)) for(j=1;to=0,j<=M;j++) for(k=j;k<=M;k++) CG[j]=max(CG[j],CR[j][k]=max(BF[j][k],BG[k+1])+(to+=MP[i][k])); printf("%lld",BG[1]); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 504 KB | Output is correct |
2 | Correct | 5 ms | 2024 KB | Output is correct |
3 | Correct | 5 ms | 2136 KB | Output is correct |
4 | Incorrect | 7 ms | 2136 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 30 ms | 2756 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |