oj.uz

Submission #639312

# Submission time Handle Problem Language Result Execution time Memory
639312 2022-09-09T11:57:56 Z LucaLucaM Maxcomp (info1cup18_maxcomp) C++17
60 / 100
 500 ms 11964 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
struct cell
{
    int x, i, j;
};
 
bool operator < (const cell a, const cell b)
{
    return a.x < b.x;
}
 
cell a[1000001];
 
int main()
{
    int n, m;
    cin >> n >> m;
 
    int N = 0;
 
    for (int i=0; i<n; i++)
    {
        for (int j=0; j<m; j++)
        {
            int x;
            cin >> x;
 
            a[++N].x = x;
            a[N].i = i, a[N].j = j;
        }
    }
 
    sort (a+1, a+N+1);
 
    int M = N/2 + 1;
    int ans = -1;
 
    for (int i=1; i<M; i++)
    {
        for (int j=N; j>=M; j--)
        {
            int d = abs(a[i].i - a[j].i) + abs(a[i].j - a[j].j) + 1;
            int s = a[j].x - a[i].x - d;
 
            ans = max(ans, s);
        }
    }
 
    cout << ans;
 
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 4 ms 212 KB Output is correct
10 Correct 4 ms 332 KB Output is correct
11 Correct 4 ms 212 KB Output is correct
12 Correct 4 ms 212 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 4 ms 304 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 4 ms 212 KB Output is correct
13 Correct 4 ms 332 KB Output is correct
14 Correct 4 ms 212 KB Output is correct
15 Correct 4 ms 212 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 4 ms 304 KB Output is correct
18 Execution timed out 1094 ms 11964 KB Time limit exceeded
19 Halted 0 ms 0 KB -