oj.uz

답안 #638434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
638434 2022-09-06T00:50:51 Z zaneyu Maxcomp (info1cup18_maxcomp) C++14
0 / 100
 1 ms 340 KB 
/*input
2 3
2 4 3
5 7 5
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET(v,x) lower_bound(ALL(v),x)-v.begin()
const int maxn=1e3+5;
const int INF=0x3f3f3f3f;
const int MOD=998244353;
const ld PI=acos(-1.0l);
const ld eps=1e-6;
const ll INF64=9e18+1;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
int arr[maxn][maxn];
bool in[maxn][maxn];
int n,m;
bool isin(int x,int y){
    if(x<0 or x>=n or y<0 or y>=m) return false;
    return true;
}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
    ios::sync_with_stdio(false),cin.tie(0); 
    cin>>n>>m;
    vector<pair<int,pii>> v;
    REP(i,n) REP(j,m){
        cin>>arr[i][j];
        v.pb({arr[i][j],{i,j}});
    }
    sort(ALL(v));
    int r=0;
    int ans=0;
    for(auto z:v){
        while(r<n*m){
            auto x=v[r];
            if(x==z){
                in[x.s.f][x.s.s]=1;
                ++r;
                continue;
            }
            bool ok=0;
            REP(k,4){
                int a=x.s.f+dx[k],b=x.s.s+dy[k];
                if(isin(a,b) and in[a][b]){
                    ok=1;
                    break;
                }
            }
            if(!ok) break;
            in[x.s.f][x.s.s]=1;
            ++r;
        }
        in[z.s.f][z.s.s]=0;
        MXTO(ans,v[r-1].f-z.f);
    }
    cout<<ans;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -