# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47236 | 2018-04-29T12:48:34 Z | PowerOfNinjaGo | Maxcomp (info1cup18_maxcomp) | C++17 | 5 ms | 492 KB |
//Power Of Ninja Go #include <bits/stdc++.h> //#ifdef atom #else #endif using namespace std; typedef long long ll; typedef pair<int, int> ii; typedef vector<int> vi; typedef vector< ii > vii; #define X first #define Y second #define pb push_back const int maxn = 1e3+5; int arr[maxn][maxn]; int main() { int n, m; scanf("%d %d", &n, &m); for(int i = 1; i<= n; i++) { for(int j = 1; j<= m; j++) { scanf("%d", arr[i]+j); } } ll best = -1e18; for(int i = 1; i<= n; i++) { for(int j = 1; j<= m; j++) { for(int i2 = 1; i2<= n; i2++) { for(int j2 = 1; j2<= m; j2++) { best = max(best, 1LL*abs(i-i2)+abs(j-j2)+abs(arr[i][j]-arr[i2][j2])); } } } } cout << best << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 492 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |