# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
525053 | 2022-02-10T15:12:09 Z | Farhan_HY | Maxcomp (info1cup18_maxcomp) | C++14 | 500 ms | 8140 KB |
#include <bits/stdc++.h> #define int long long #define float double #define pb push_back #define F first #define S second #define T int t; cin >> t; while(t--) #define IOS ios::sync_with_stdio(); cin.tie(0); cout.tie(0); using namespace std; const int inf = 8e18; const int N = 1e6 + 6; const int M = 1e3 + 3; const int LOG = 31; const int mod = 1e9 + 7; const float pi = atan(1) * 4; int a[M][M]; int n, m; main() { IOS cin >> n >> m; for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) cin >> a[i][j]; int Ans = -inf; for(int i = 0; i < n; i++) { for(int j = 0; j < m; j++) { for(int ii = i; ii < n; ii++) { for(int jj = 0; jj < m; jj++) { Ans = max(Ans, abs(a[i][j] - a[ii][jj]) - (abs(jj - j) + abs(ii - i) + 1)); } } } } cout << Ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 204 KB | Output is correct |
2 | Correct | 3 ms | 204 KB | Output is correct |
3 | Correct | 2 ms | 204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Correct | 6 ms | 460 KB | Output is correct |
10 | Correct | 8 ms | 412 KB | Output is correct |
11 | Correct | 7 ms | 460 KB | Output is correct |
12 | Correct | 9 ms | 460 KB | Output is correct |
13 | Correct | 6 ms | 460 KB | Output is correct |
14 | Correct | 6 ms | 460 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Correct | 2 ms | 204 KB | Output is correct |
10 | Correct | 3 ms | 204 KB | Output is correct |
11 | Correct | 2 ms | 204 KB | Output is correct |
12 | Correct | 6 ms | 460 KB | Output is correct |
13 | Correct | 8 ms | 412 KB | Output is correct |
14 | Correct | 7 ms | 460 KB | Output is correct |
15 | Correct | 9 ms | 460 KB | Output is correct |
16 | Correct | 6 ms | 460 KB | Output is correct |
17 | Correct | 6 ms | 460 KB | Output is correct |
18 | Execution timed out | 1091 ms | 8140 KB | Time limit exceeded |
19 | Halted | 0 ms | 0 KB | - |