oj.uz

Submission #419806

# Submission time Handle Problem Language Result Execution time Memory
419806 2021-06-07T13:16:33 Z Runtime_error_ The Kingdom of JOIOI (JOI17_joioi) C++14
100 / 100
 1574 ms 102064 KB 
#include <bits/stdc++.h>
#define ll long long
#define pi pair<ll,ll>
#define mid (l+r)/2
#define pb push
using namespace std;
const ll inf = 2e3+9,MX = 1e9+9;
ll n,m,ts,OriginalArr[inf][inf],a[inf][inf],mn = MX,mx,vis[inf][inf];
pi MaxVals;
queue<ll> q;

bool check(ll k,bool ReverseRow,bool ReverseCol){

    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            a[i][j] = OriginalArr[ (ReverseCol?n-i+1:i) ][ (ReverseRow?m-j+1:j) ];
    int Col = 1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++)
            if(a[i][j] > mn+k)
                Col = max(Col,j+1);
        for(int j=1;j<Col;j++)
            if(a[i][j] < mx-k)
                return 0;
    }
    return 1;
}

signed main(){
    scanf("%lld%lld",&n,&m);
    for(ll i=1;i<=n;i++){
        for(ll j=1;j<=m;j++){
                scanf("%lld",&OriginalArr[i][j]);
            mx = max(mx,OriginalArr[i][j]);
            mn = min(mn,OriginalArr[i][j]);
        }
    }

    ll l = -1, r = mx-mn;
    while(r-l>1){
        if(check(mid,0,0) || check(mid,1,0) || check(mid,0,1) || check(mid,1,1))
            r = mid;
        else
            l = mid;
    }
    printf("%lld\n",r);
}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     scanf("%lld%lld",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
joioi.cpp:33:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |                 scanf("%lld",&OriginalArr[i][j]);
      |                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 6 ms 2508 KB Output is correct
17 Correct 11 ms 2764 KB Output is correct
18 Correct 11 ms 2744 KB Output is correct
19 Correct 12 ms 2696 KB Output is correct
20 Correct 10 ms 2488 KB Output is correct
21 Correct 16 ms 3036 KB Output is correct
22 Correct 14 ms 2984 KB Output is correct
23 Correct 12 ms 2852 KB Output is correct
24 Correct 11 ms 2608 KB Output is correct
25 Correct 13 ms 2892 KB Output is correct
26 Correct 16 ms 2812 KB Output is correct
27 Correct 15 ms 2920 KB Output is correct
28 Correct 17 ms 2912 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 6 ms 2508 KB Output is correct
17 Correct 11 ms 2764 KB Output is correct
18 Correct 11 ms 2744 KB Output is correct
19 Correct 12 ms 2696 KB Output is correct
20 Correct 10 ms 2488 KB Output is correct
21 Correct 16 ms 3036 KB Output is correct
22 Correct 14 ms 2984 KB Output is correct
23 Correct 12 ms 2852 KB Output is correct
24 Correct 11 ms 2608 KB Output is correct
25 Correct 13 ms 2892 KB Output is correct
26 Correct 16 ms 2812 KB Output is correct
27 Correct 15 ms 2920 KB Output is correct
28 Correct 17 ms 2912 KB Output is correct
29 Correct 861 ms 82144 KB Output is correct
30 Correct 958 ms 84716 KB Output is correct
31 Correct 1018 ms 86316 KB Output is correct
32 Correct 841 ms 86340 KB Output is correct
33 Correct 746 ms 75552 KB Output is correct
34 Correct 977 ms 86408 KB Output is correct
35 Correct 1376 ms 101960 KB Output is correct
36 Correct 1033 ms 96628 KB Output is correct
37 Correct 1574 ms 102064 KB Output is correct