oj.uz

Submission #76562

# Submission time Handle Problem Language Result Execution time Memory
76562 2018-09-14T18:36:18 Z Vardanyan Maxcomp (info1cup18_maxcomp) C++14
60 / 100
 500 ms 4620 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int a[N][N];
int main(){
    int ans = -1;
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
            scanf("%d",&a[i][j]);

        }
    }
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
            for(int ii = 1;ii<=n;ii++){
                for(int jj = 1;jj<=m;jj++){
                    int d = abs(ii-i)+abs(jj-j)+1;
                    int x = abs(a[i][j]-a[ii][jj]);
                    x-=d;
                    ans = max(ans,x);
                }
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

maxcomp.cpp: In function 'int main()':
maxcomp.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
maxcomp.cpp:11:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d",&a[i][j]);
             ~~~~~^~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 2 ms 616 KB Output is correct
6 Correct 2 ms 616 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 620 KB Output is correct
2 Correct 4 ms 620 KB Output is correct
3 Correct 5 ms 712 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 2 ms 616 KB Output is correct
6 Correct 2 ms 616 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 19 ms 860 KB Output is correct
10 Correct 21 ms 872 KB Output is correct
11 Correct 18 ms 872 KB Output is correct
12 Correct 17 ms 872 KB Output is correct
13 Correct 18 ms 872 KB Output is correct
14 Correct 19 ms 872 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 2 ms 616 KB Output is correct
6 Correct 2 ms 616 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 4 ms 620 KB Output is correct
10 Correct 4 ms 620 KB Output is correct
11 Correct 5 ms 712 KB Output is correct
12 Correct 19 ms 860 KB Output is correct
13 Correct 21 ms 872 KB Output is correct
14 Correct 18 ms 872 KB Output is correct
15 Correct 17 ms 872 KB Output is correct
16 Correct 18 ms 872 KB Output is correct
17 Correct 19 ms 872 KB Output is correct
18 Execution timed out 1069 ms 4620 KB Time limit exceeded
19 Halted 0 ms 0 KB -