제출 #1286560

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1286560		trinm01	The Kingdom of JOIOI (JOI17_joioi)	C++20	0 / 100	0 ms	332 KiB

joioi

// #pragma GCC optimize("O3")
// #pragma GCC optimization("Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;

#define int long long 
#define ll long long
#define FOR(i, l, r) for (int i = (l); i <= (r); i++)
#define FOD(i, r, l) for (int i = (r); i >= (l); i--)
#define fi first
#define se second
#define pii pair<int, int>

const ll mod = 1e9 + 7;
const int MAXN = 2e3 + 5;
const ll oo = 1e18 + 7;  
const int base = 10;

int m, n, a[MAXN][MAXN];

struct node{
	int vl, x, y;
};
bool cmp(node a, node b){
	return a.vl<b.vl;
}
vector<node> vec; 

int hx[]={-1, 1, 0, 0}, hy[]={0, 0, -1, 1};
int f[MAXN][MAXN];
int ps[MAXN][MAXN];

bool chk(int p, int q){
	FOR(i, 1, m){
		int l=oo, r=-oo;
		FOR(j, 1, n){
			if(f[i][j]==p){
				l=min(l, j);
				r=max(r, j);
			}
		}
		FOR(j, l, r){
			if(f[i][j]==q) return 0;
			f[i][j]=p;
		}
	}
	FOR(j, 1, n){
		int l=oo, r=-oo;
		FOR(i, 1, m){
			if(f[i][j]==p){
				l=min(l, i);
				r=max(r, i);
			}
		}
		FOR(i, l, r){
			if(f[i][j]==q) return 0;
			f[i][j]=p;
		}
	}
	FOR(i, 1, m){
		int l=oo, r=-oo;
		FOR(j, 1, n){
			if(f[i][j]==p){
				l=min(l, j);
				r=max(r, j);
			}
		}
		FOR(j, l, r){
			if(f[i][j]==q) return 0;
			f[i][j]=p;
		}
	}
	FOR(j, 1, n){
		int l=oo, r=-oo;
		FOR(i, 1, m){
			if(f[i][j]==p){
				l=min(l, i);
				r=max(r, i);
			}
		}
		FOR(i, l, r){
			if(f[i][j]==q) return 0;
			f[i][j]=p;
		}
	}
	return 1;
}

bool check(int k){
	FOR(i, 1, m){
		FOR(j, 1, n){
			f[i][j]=2;
		}
	}
	f[vec[0].x][vec[0].y]=0;
	f[vec.back().x][vec.back().y]=1;
	for(auto [vl, x, y]:vec){
		if(vec.back().vl-vl>k){
			if(f[x][y]==1) return 0;
			f[x][y]=0;
		}
		if(vl-vec[0].vl>k){
			if(f[x][y]==0) return 0;
			f[x][y]=1;
		}
	}
	
	// FOR(i, 1, m){
		// FOR(j, 1, n){
			// cout << f[i][j] << ' ';
		// }
		// cout << '\n';
	// }
	if(chk(0, 1) && chk(1, 0)) return 1;
	// if() return 1;
	return 0;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    
    // freopen("test.txt", "r", stdin);
    // freopen("o2.out", "w", stdout);

    if(fopen(".inp", "r")){
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }

    cin >> m >> n;
    FOR(i, 1, m){
    	FOR(j, 1, n){
    		cin >> a[i][j];
    		vec.push_back({a[i][j], i, j});
    	}
    }
    sort(vec.begin(), vec.end(), cmp);
    
    // cout << check(18) << '\n';
    // cout << check(17);
    
    int l=0, r=1e9, ans=0;
    while(l<=r){
    	int mid=(l+r)/2;
    	if(check(mid)){
    		ans=mid;
    		r=mid-1;
    	}
    	else{
    		l=mid+1;
    	}
    }
    cout << ans;
    
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

joioi.cpp: In function 'int main()':
joioi.cpp:130:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  130 |         freopen(".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
joioi.cpp:131:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  131 |         freopen(".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 15
• Subtask 2: 0 / 45
• Subtask 3: 0 / 40