oj.uz

Submission #900273

# Submission time Handle Problem Language Result Execution time Memory
900273 2024-01-08T03:34:42 Z Maite_Morale The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 2804 ms 262144 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define MAX 2015
#define oo 1e18
#define mod 1000000007
#define fast_in ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(0);
using namespace std;
typedef long long ll;
#define pll pair<ll , ll>
#define vll vector<ll>
#define vvll vector<vll>
#define vpll vector<pll>
 
ll tmn[3][MAX][MAX],tmx[3][MAX][MAX],a[MAX][MAX],m,n;
vll v;map<ll,ll> mp;
ll OK(ll y,ll z){
    ll x=v[y],cl=-1,mx=0,mn=oo;
    for(int i=0;i<n;i++){
        while(cl+1<m && tmn[0][i][cl+1]<x)cl++;
        if(cl!=-1)mx=max(mx,tmx[1][i][cl]);
    }
    mn=min(mn,mx);cl=m;mx=0;
    for(int i=0;i<n;i++){
        while(cl-1>=0 && tmn[1][i][cl-1]<x)cl--;
        mx=max(mx,tmx[0][i][cl]);
    }
    mn=min(mn,mx);cl=-1;mx=0;
    for(int i=n-1;i>=0;i--){
        while(cl+1<m && tmn[0][i][cl+1]<x)cl++;
        if(cl!=-1)mx=max(mx,tmx[1][i][cl]);
    }
    mn=min(mn,mx);cl=m;mx=0;
    for(int i=n-1;i>=0;i--){
        while(cl-1>=0 && tmn[1][i][cl-1]<x)cl--;
        mx=max(mx,tmx[0][i][cl]);
    }
    mn=min(mn,mx);
    if(z==1)return max(abs(v[0]-mn),abs(v.back()-v[y]));
    if(abs(v[0]-mn)<=abs(v.back()-v[y]))return 1;
return 0; 
}
int main(){
    fast_in
    cin>>n>>m;
    for(int i=0;i<n;i++){
        tmn[0][i][m]=tmn[1][i][0]=oo;
        tmn[0][i][m]=tmn[1][i][0]=oo;
        for(int j=0;j<m;j++){
            cin>>a[i][j];
            if(mp[a[i][j]]==0){
                mp[a[i][j]]=1;
                v.push_back(a[i][j]);
            }
            tmx[1][i][j]=max(tmx[1][i][j],a[i][j]);
            tmx[1][i][j+1]=tmx[1][i][j];
            tmn[1][i][j]=min(tmn[1][i][j],a[i][j]);
            tmn[1][i][j+1]=tmn[1][i][j];
        }
        for(int j=m-1;j>=0;j--){
            tmx[0][i][j]=max(tmx[0][i][j+1],a[i][j]);
            tmn[0][i][j]=min(tmn[0][i][j+1],a[i][j]);
        }
    }
    sort(v.begin(),v.end());
    ll p=0,f=v.size();
    while(abs(f-p)!=1){
        ll md=(p+f)/2;                     
        if(OK(md,0)==1)p=md;
        else             f=md;           
    }                                          
    if(f==v.size()){cout<<OK(p,1);return 0;}
    cout<<min(OK(p,1),OK(f,1));
return 0;
}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:72:9: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |     if(f==v.size()){cout<<OK(p,1);return 0;}
      |        ~^~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4704 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4696 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4564 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 5 ms 18268 KB Output is correct
17 Correct 20 ms 21460 KB Output is correct
18 Correct 20 ms 21204 KB Output is correct
19 Correct 19 ms 21460 KB Output is correct
20 Correct 18 ms 20696 KB Output is correct
21 Correct 21 ms 21492 KB Output is correct
22 Correct 20 ms 21460 KB Output is correct
23 Correct 21 ms 21460 KB Output is correct
24 Correct 18 ms 20952 KB Output is correct
25 Correct 23 ms 21460 KB Output is correct
26 Correct 21 ms 21460 KB Output is correct
27 Correct 22 ms 21428 KB Output is correct
28 Correct 21 ms 21460 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4704 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4696 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4564 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 5 ms 18268 KB Output is correct
17 Correct 20 ms 21460 KB Output is correct
18 Correct 20 ms 21204 KB Output is correct
19 Correct 19 ms 21460 KB Output is correct
20 Correct 18 ms 20696 KB Output is correct
21 Correct 21 ms 21492 KB Output is correct
22 Correct 20 ms 21460 KB Output is correct
23 Correct 21 ms 21460 KB Output is correct
24 Correct 18 ms 20952 KB Output is correct
25 Correct 23 ms 21460 KB Output is correct
26 Correct 21 ms 21460 KB Output is correct
27 Correct 22 ms 21428 KB Output is correct
28 Correct 21 ms 21460 KB Output is correct
29 Correct 1039 ms 174420 KB Output is correct
30 Correct 976 ms 180252 KB Output is correct
31 Correct 1125 ms 181212 KB Output is correct
32 Correct 1095 ms 181440 KB Output is correct
33 Correct 836 ms 162028 KB Output is correct
34 Correct 1044 ms 181624 KB Output is correct
35 Runtime error 2804 ms 262144 KB Execution killed with signal 9
36 Halted 0 ms 0 KB -