oj.uz

Submission #780730

# Submission time Handle Problem Language Result Execution time Memory
780730 2023-07-12T12:15:49 Z Andrey Maxcomp (info1cup18_maxcomp) C++14
0 / 100
 3 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m,a,b,ans = 0;
    cin >> n >> m;
    int haha[n][m];
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> haha[i][j];
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            for(int k = 0; k < n; k++) {
                for(int y = 0; y < m; y++) {
                    a = haha[i][j];
                    b = haha[k][y];
                    if(a < b) {
                        swap(a,b);
                    }
                    ans = max(ans,b-a+abs(i-k)+abs(j-y));
                }
            }
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -