oj.uz

Submission #309491

# Submission time Handle Problem Language Result Execution time Memory
309491 2020-10-03T16:59:56 Z JovanK26 The Kingdom of JOIOI (JOI17_joioi) C++14
0 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;
int mat[2001][2001];
int n,m;
int maks=0;
int mini=1000000000;
bool check(int med)
{
     int pos=0;
     for(int i=0;i<n;i++)
     {
         for(int j=0;j<m;j++)
         {
             if(mat[i][j]+med<maks)
             {
                 pos=max(pos,j+1);
             }
         }
         for(int j=0;j<m;j++)
         {
             if(mat[i][j]-med>mini)
             {
                 if(j<pos)return 0;
             }
         }
     }
     return 1;
}
void fliprow()
{
    for(int i=0;i<n/2;i++)
    {
        for(int j=0;j<m;j++)
        {
            mat[i][j]=mat[n-i-1][j];
        }
    }
}
void flipcol()
{
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m/2;j++)
        {
            mat[i][j]=mat[i][m-j-1];
        }
    }
}
int solve()
{
    int l=0;
    int r=maks-mini;
    int med;
    while(l<=r)
    {
        med=(l+r)/2;
        if(check(med))
        {
            r=med-1;
        }
        else
        {
            l=med+1;
        }
    }
    return r+1;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            cin >> mat[i][j];
            maks=max(maks,mat[i][j]);
            mini=min(mini,mat[i][j]);
        }
    }
    int rez=solve();
    fliprow();
    rez=min(rez,solve());
    flipcol();
    rez=min(rez,solve());
    fliprow();
    rez=min(rez,solve());
    cout << rez;
    return 0;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 45.0

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

Subtask #3
0 / 40.0

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