# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96459 | 2019-02-09T14:23:31 Z | dnass | Maxcomp (info1cup18_maxcomp) | C++14 | 4 ms | 376 KB |
#include <cstdio> #include <algorithm> using namespace std; int n, m; int a[1005][1005]; int myabs(int x){ if(x<0) return (-1)*x; return x; } int main(){ scanf("%d %d", &n, &m); for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ scanf("%d", &a[i][j]); } } int mx = 0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ for(int k=0;k<n;k++){ for(int l=0;l<m;l++){ mx = max(mx, myabs(a[i][j]-a[k][l])-myabs(k-i)-myabs(l-j)-1); } } } } printf("%d\n", mx); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Incorrect | 2 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 376 KB | Output is correct |
2 | Correct | 4 ms | 376 KB | Output is correct |
3 | Correct | 4 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Incorrect | 2 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Incorrect | 2 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |