oj.uz

답안 #467022

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
467022 2021-08-21T11:00:19 Z NhatMinh0208 The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 582 ms 54840 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b,l,r,mid,low,high;
int h[2001][2001];
int rl[2001],rr[2001];
int check(int x){


    for (i=0;i<n;i++)
    {
        for (j=0;j<m;j++)
        if (h[i][j]>low+x) break;
        rr[i]=j;
        for (j=m-1;j>=0;j--)
        if (h[i][j]<high-x) break;
        rl[i]=j+1;
    }
    u=0; a=1;
    for (i=0;i<n;i++)
    {
        u=max(u,rl[i]);
        if (u>rr[i]) a=0;
    }
    if (a) return 1;
    u=1e9; a=1;
    for (i=0;i<n;i++)
    {
        u=min(u,rr[i]);
        if (u<rl[i]) a=0;
    }
    if (a) return 1;


    for (i=0;i<n;i++)
    {
        for (j=0;j<m;j++)
        if (h[i][j]<high-x) break;
        rr[i]=j;
        for (j=m-1;j>=0;j--)
        if (h[i][j]>low+x) break;
        rl[i]=j+1;
    }
    u=0; a=1;
    for (i=0;i<n;i++)
    {
        u=max(u,rl[i]);
        if (u>rr[i]) a=0;
    }
    if (a) return 1;
    u=1e9; a=1;
    for (i=0;i<n;i++)
    {
        u=min(u,rr[i]);
        if (u<rl[i]) a=0;
    }
    if (a) return 1;

    return 0;
}
int main()
{
	fio;
    cin>>n>>m;
    low=1e9;
    high=0;
    for (i=0;i<n;i++) for (j=0;j<m;j++) {
        cin>>h[i][j];
        low=min(low,h[i][j]);
        high=max(high,h[i][j]);
    }
    l=0;
    r=high-low;
    while(l<r)
    {
        mid=(l+r)/2;
        if (check(mid)) r=mid; else l=mid+1;
    }
    cout<<l<<endl;
}
// Normie28;

Compilation message

joioi.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 316 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 316 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 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 4 ms 1228 KB Output is correct
17 Correct 6 ms 1484 KB Output is correct
18 Correct 6 ms 1484 KB Output is correct
19 Correct 7 ms 1484 KB Output is correct
20 Correct 6 ms 1356 KB Output is correct
21 Correct 8 ms 1668 KB Output is correct
22 Correct 7 ms 1612 KB Output is correct
23 Correct 7 ms 1644 KB Output is correct
24 Correct 6 ms 1484 KB Output is correct
25 Correct 7 ms 1608 KB Output is correct
26 Correct 7 ms 1612 KB Output is correct
27 Correct 7 ms 1612 KB Output is correct
28 Correct 7 ms 1612 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 316 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 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 4 ms 1228 KB Output is correct
17 Correct 6 ms 1484 KB Output is correct
18 Correct 6 ms 1484 KB Output is correct
19 Correct 7 ms 1484 KB Output is correct
20 Correct 6 ms 1356 KB Output is correct
21 Correct 8 ms 1668 KB Output is correct
22 Correct 7 ms 1612 KB Output is correct
23 Correct 7 ms 1644 KB Output is correct
24 Correct 6 ms 1484 KB Output is correct
25 Correct 7 ms 1608 KB Output is correct
26 Correct 7 ms 1612 KB Output is correct
27 Correct 7 ms 1612 KB Output is correct
28 Correct 7 ms 1612 KB Output is correct
29 Correct 425 ms 37140 KB Output is correct
30 Correct 398 ms 37388 KB Output is correct
31 Correct 426 ms 39028 KB Output is correct
32 Correct 428 ms 39208 KB Output is correct
33 Correct 382 ms 33984 KB Output is correct
34 Correct 432 ms 39268 KB Output is correct
35 Correct 563 ms 54724 KB Output is correct
36 Correct 497 ms 49568 KB Output is correct
37 Correct 582 ms 54840 KB Output is correct