oj.uz

답안 #902625

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
902625 2024-01-10T21:13:16 Z Maite_Morale The Kingdom of JOIOI (JOI17_joioi) C++14
60 / 100
 2506 ms 262144 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define MAX 3000
#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[5][MAX][MAX]={},tmx[5][MAX][MAX]={},a[MAX][MAX]={},m,n;
vll v;map<ll,ll> mp;
ll OK(ll x,ll z){
    ll 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()-x));
    if(abs(v[0]-mn)<=abs(v.back()-x))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;
        tmx[0][i][m]=tmx[1][i][0]=0;
        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());
    if(v.size()==1){cout<<0;return 0;}
    ll p=1,f=v.size();

    while(abs(f-p)!=1){
        ll md=(p+f)/2;     
        if(md<0 || md>=v.size())while(true){md=md;}                
        if(OK(v[md],0)==1)p=md;
        else             f=md;           
    }                                          
    if(f==v.size()){cout<<OK(v[p],1);return 0;}
    cout<<min(OK(v[p],1),OK(v[f],1));
return 0;
}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:71:22: 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]
   71 |         if(md<0 || md>=v.size())while(true){md=md;}
      |                    ~~^~~~~~~~~~
joioi.cpp:75: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]
   75 |     if(f==v.size()){cout<<OK(v[p],1);return 0;}
      |        ~^~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 12752 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12888 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 12752 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12888 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 6 ms 33116 KB Output is correct
17 Correct 23 ms 35952 KB Output is correct
18 Correct 22 ms 36052 KB Output is correct
19 Correct 24 ms 35944 KB Output is correct
20 Correct 19 ms 31704 KB Output is correct
21 Correct 25 ms 36068 KB Output is correct
22 Correct 24 ms 36072 KB Output is correct
23 Correct 22 ms 36052 KB Output is correct
24 Correct 19 ms 31704 KB Output is correct
25 Correct 22 ms 36052 KB Output is correct
26 Correct 22 ms 36048 KB Output is correct
27 Correct 22 ms 36052 KB Output is correct
28 Correct 22 ms 36052 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 12752 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12888 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 6 ms 33116 KB Output is correct
17 Correct 23 ms 35952 KB Output is correct
18 Correct 22 ms 36052 KB Output is correct
19 Correct 24 ms 35944 KB Output is correct
20 Correct 19 ms 31704 KB Output is correct
21 Correct 25 ms 36068 KB Output is correct
22 Correct 24 ms 36072 KB Output is correct
23 Correct 22 ms 36052 KB Output is correct
24 Correct 19 ms 31704 KB Output is correct
25 Correct 22 ms 36052 KB Output is correct
26 Correct 22 ms 36048 KB Output is correct
27 Correct 22 ms 36052 KB Output is correct
28 Correct 22 ms 36052 KB Output is correct
29 Correct 1412 ms 227080 KB Output is correct
30 Correct 1249 ms 230052 KB Output is correct
31 Correct 1311 ms 232836 KB Output is correct
32 Correct 1354 ms 236784 KB Output is correct
33 Correct 903 ms 208208 KB Output is correct
34 Correct 1313 ms 236488 KB Output is correct
35 Runtime error 2506 ms 262144 KB Execution killed with signal 9
36 Halted 0 ms 0 KB -