oj.uz

Submission #743863

# Submission time Handle Problem Language Result Execution time Memory
743863 2023-05-18T05:33:32 Z zaneyu Izvanzemaljci (COI21_izvanzemaljci) C++17
5 / 100
 110 ms 2044 KB 
#include<bits/stdc++.h>
using namespace std;
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()))))
const ll maxn=2e5-5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-4;
#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)
pii arr[maxn];
int n,k;
bool splx;
pii pmn,pmx;
bool wk(int mid){
	vector<int> va,vb,bth;
	REP(i,n){
		if(arr[i].f-arr[0].f>mid and arr[n-1].f-arr[i].f>mid){
			return false;
		}
		if(arr[i].f-arr[0].f<=mid and arr[n-1].f-arr[i].f<=mid){
			bth.pb(arr[i].s);
		}
		else if(arr[i].f-arr[0].f<=mid){
			va.pb(arr[i].s);
		}
		else{
			vb.pb(arr[i].s);
		}
	}
	sort(ALL(va)),sort(ALL(vb)),sort(ALL(bth));
	REP(a,2){
		int mn=INF,mx=-INF;
		if(sz(va)) mn=va[0],mx=va.back();
		int p=-1;
		REP(i,sz(bth)){
			MNTO(mn,bth[i]),MXTO(mx,bth[i]);
			if(mx-mn>mid) break;
			p=i;
		}
		int asd=mn;
		mn=INF,mx=-INF;
		if(sz(vb)) mn=vb[0],mx=vb.back();
		for(int i=p+1;i<sz(bth);i++){
			MNTO(mn,bth[i]),MXTO(mx,bth[i]);
		}
		if(mx-mn<=mid){
			pmn={arr[0].f,asd},pmx={arr[n-1].f-mid,mn};
			if(a==1){
				swap(pmn.f,pmx.f);
			}
			return true;
		}
		swap(va,vb);
	}
	return false;
}	
int main(){
	
	cin>>n>>k;
	REP(i,n){
		cin>>arr[i].f>>arr[i].s;
	}
	vector<int> vx,vy;
	REP(i,n) vx.pb(arr[i].f),vy.pb(arr[i].s);
	sort(ALL(vx)),sort(ALL(vy));
	if(vx.back()-vx[0]>vy.back()-vy[0]) splx=1;
	else{
		splx=0;
		REP(i,n) swap(arr[i].f,arr[i].s);
	}
	sort(arr,arr+n);
	if(k==1){
		cout<<vx[0]<<' '<<vy[0]<<' '<<max({1,vx.back()-vx[0],vy.back()-vy[0]});
		return 0;
	}
	ll l=1,r=INT_MAX;
	while(l<r){
		int mid=(l+r)/2;
		if(wk(mid)) r=mid;
		else l=mid+1;
	}
	wk(l);
	cout<<pmn.f<<' '<<pmn.s<<' '<<l<<'\n';
	cout<<pmx.f<<' '<<pmx.s<<' '<<l<<'\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 99 ms 1984 KB Output is correct
8 Correct 110 ms 2004 KB Output is correct
9 Correct 102 ms 1992 KB Output is correct
10 Correct 105 ms 1996 KB Output is correct
11 Correct 104 ms 2044 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 212 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 212 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -