oj.uz

Submission #197327

# Submission time Handle Problem Language Result Execution time Memory
197327 2020-01-20T11:09:39 Z combi1k1 The Kingdom of JOIOI (JOI17_joioi) C++14
100 / 100
 1573 ms 47608 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll  long long
#define ld  double

#define sz(x)   (int)x.size()
#define all(x)  x.begin(),x.end()

#define pb  emplace_back
#define X   first
#define Y   second

const int   N   = 2005;

typedef pair<int,int>   ii;

int a[N][N];
int f[N][N];
int s[N][N];

int main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int n;  cin >> n;
    int m;  cin >> m;

    int mx = 1, my = 1;
    int Mx = 1, My = 1;

    for(int i = 1 ; i <= n ; ++i)
    for(int j = 1 ; j <= m ; ++j)   {
        cin >> a[i][j];

        if (a[mx][my] > a[i][j])    mx = i, my = j;
        if (a[Mx][My] < a[i][j])    Mx = i, My = j;
    }

    auto check = [&](int lx,int rx,int ly,int ry,int dx,int dy) {
        for(int i = lx ; i != rx ; i += dx)
        for(int j = ly ; j != ry ; j += dy) {
            int area = f[i][j] % 2;

            area += s[i][j - dy];
            area += s[i - dx][j];
            area -= s[i - dx][j - dy];

            if (area == (abs(i - lx) + 1) * (abs(j - ly) + 1))
                s[i][j] = area;
            else    {
                s[i][j] = area - 1;
                if (f[i][j] & 2)    continue;
                else                return  0;
            }
        }
        return  1;
    };

    int L = 0;
    int R = a[Mx][My] - a[mx][my];

    while(L < R)   {
        int M = (L + R) / 2;

        for(int i = 1 ; i <= n ; ++i)
        for(int j = 1 ; j <= m ; ++j)   {
            f[i][j] = 0;

            if (a[i][j] - a[mx][my] <= M)   f[i][j] ^= 1;
            if (a[Mx][My] - a[i][j] <= M)   f[i][j] ^= 2;

            if (f[i][j] == 0)
                goto out;
        }

        if (check(1,n + 1,1,m + 1,1,1)) {
            R = M;
            continue;
        }
        if (check(n,0,1,m + 1,-1,1))    {
            R = M;
            continue;
        }
        if (check(1,n + 1,m,0,1,-1))    {
            R = M;
            continue;
        }
        if (check(n,0,m,0,-1,-1))   {
            R = M;
            continue;
        }
        out:;

        L = M + 1;
    }

    cout << L << endl;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 6 ms 2168 KB Output is correct
17 Correct 14 ms 3192 KB Output is correct
18 Correct 11 ms 3196 KB Output is correct
19 Correct 15 ms 3192 KB Output is correct
20 Correct 14 ms 2812 KB Output is correct
21 Correct 20 ms 3192 KB Output is correct
22 Correct 13 ms 3192 KB Output is correct
23 Correct 19 ms 3192 KB Output is correct
24 Correct 12 ms 2808 KB Output is correct
25 Correct 22 ms 3192 KB Output is correct
26 Correct 17 ms 3192 KB Output is correct
27 Correct 22 ms 3192 KB Output is correct
28 Correct 22 ms 3192 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 6 ms 2168 KB Output is correct
17 Correct 14 ms 3192 KB Output is correct
18 Correct 11 ms 3196 KB Output is correct
19 Correct 15 ms 3192 KB Output is correct
20 Correct 14 ms 2812 KB Output is correct
21 Correct 20 ms 3192 KB Output is correct
22 Correct 13 ms 3192 KB Output is correct
23 Correct 19 ms 3192 KB Output is correct
24 Correct 12 ms 2808 KB Output is correct
25 Correct 22 ms 3192 KB Output is correct
26 Correct 17 ms 3192 KB Output is correct
27 Correct 22 ms 3192 KB Output is correct
28 Correct 22 ms 3192 KB Output is correct
29 Correct 795 ms 45152 KB Output is correct
30 Correct 828 ms 47532 KB Output is correct
31 Correct 1071 ms 47608 KB Output is correct
32 Correct 731 ms 47544 KB Output is correct
33 Correct 518 ms 41784 KB Output is correct
34 Correct 938 ms 47544 KB Output is correct
35 Correct 1182 ms 47480 KB Output is correct
36 Correct 916 ms 47292 KB Output is correct
37 Correct 1573 ms 47552 KB Output is correct