oj.uz

Submission #743914

# Submission time Handle Problem Language Result Execution time Memory
743914 2023-05-18T06:06:26 Z jamielim Izvanzemaljci (COI21_izvanzemaljci) C++14
5 / 100
 25 ms 3580 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,ii> i4;
typedef vector<int> vi;
const int MOD=1000000007;
const int INF=1012345678;
const ll LLINF=1012345678012345678LL;
const double PI=3.1415926536;
const double EPS=1e-14;

int n,k;
vector<ii> all;

vector<int> find_one_square(vector<ii> v){
	if(SZ(v)==0)return {0,0,1};
	int minx=LLINF,maxx=-LLINF,miny=LLINF,maxy=-LLINF;
	for(ii i:v){
		minx=min(minx,i.fi);
		maxx=max(maxx,i.fi);
		miny=min(miny,i.se);
		maxy=max(maxy,i.se);
	}
	int l=max(1LL,max(maxx-minx,maxy-miny));
	return {minx,miny,l};
}

int32_t main(){
	scanf("%lld%lld",&n,&k);
	int x,y;
	for(int i=0;i<n;i++){
		scanf("%lld%lld",&x,&y);
		all.pb(x,y);
	}
	if(k==1){
		vector<int> ans=find_one_square(all);
		printf("%lld %lld %lld\n",ans[0],ans[1],ans[2]);
	}else if(k==2){
		int minx=LLINF,maxx=-LLINF;
		for(ii i:all){
			minx=min(minx,i.fi);
			maxx=max(maxx,i.fi);
		}
		vector<int> one=find_one_square(all);
		int le=1,ri=one[2];
		while(le<ri){
			int mi=(le+ri)/2;
			int lny=LLINF,lxy=-LLINF,rny=LLINF,rxy=-LLINF;
			for(ii i:all){
				if(i.fi<=minx+mi){
					lny=min(lny,i.se);
					lxy=max(lxy,i.se);
				}
				if(i.fi>=maxx-mi){
					rny=min(rny,i.se);
					rxy=max(rxy,i.se);
				}
			}
			vector<ii> v1,v2,v3,v4;
			for(ii i:all){
				if(i.fi>minx+mi||i.se>lny+mi)v1.pb(i);
				if(i.fi>minx+mi||i.se<lxy-mi)v2.pb(i);
				if(i.fi<maxx-mi||i.se>rny+mi)v3.pb(i);
				if(i.fi<maxx-mi||i.se<rxy-mi)v4.pb(i);
			}
			vector<int> res1=find_one_square(v1);
			vector<int> res2=find_one_square(v2);
			vector<int> res3=find_one_square(v3);
			vector<int> res4=find_one_square(v4);
			if(res1[2]<=mi||res2[2]<=mi||res3[2]<=mi||res4[2]<=mi)ri=mi;
			else le=mi+1;
		}
		int lny=LLINF,lxy=-LLINF,rny=LLINF,rxy=-LLINF;
		for(ii i:all){
			if(i.fi<=minx+le){
				lny=min(lny,i.se);
				lxy=max(lxy,i.se);
			}
			if(i.fi>=maxx-le){
				rny=min(rny,i.se);
				rxy=max(rxy,i.se);
			}
		}
		vector<ii> v1,v2,v3,v4;
		for(ii i:all){
			if(i.fi>minx+le||i.se>lny+le)v1.pb(i);
			if(i.fi>minx+le||i.se<lxy-le)v2.pb(i);
			if(i.fi<maxx-le||i.se>rny+le)v3.pb(i);
			if(i.fi<maxx-le||i.se<rxy-le)v4.pb(i);
		}
		vector<int> res1=find_one_square(v1);
		vector<int> res2=find_one_square(v2);
		vector<int> res3=find_one_square(v3);
		vector<int> res4=find_one_square(v4);
		if(res1[2]<=le){
			printf("%lld %lld %lld\n",res1[0],res1[1],res1[2]);
			printf("%lld %lld %lld\n",minx,lny,le);
		}else if(res2[2]<=le){
			printf("%lld %lld %lld\n",res2[0],res2[1],res2[2]);
			printf("%lld %lld %lld\n",minx,lxy-le,le);
		}else if(res3[2]<=le){
			printf("%lld %lld %lld\n",res3[0],res3[1],res3[2]);
			printf("%lld %lld %lld\n",maxx-le,rny,le);
		}else{
			printf("%lld %lld %lld\n",res4[0],res4[1],res4[2]);
			printf("%lld %lld %lld\n",maxx-le,rxy-le,le);
		}
	}else{
		
	}
}

Compilation message

izvanzemaljci.cpp: In function 'int32_t main()':
izvanzemaljci.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |  scanf("%lld%lld",&n,&k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~
izvanzemaljci.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |   scanf("%lld%lld",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 25 ms 3432 KB Output is correct
8 Correct 23 ms 3496 KB Output is correct
9 Correct 24 ms 3580 KB Output is correct
10 Correct 23 ms 3568 KB Output is correct
11 Correct 24 ms 3516 KB Output is correct

Subtask #2
0 / 21.0

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

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 1 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 1 ms 212 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -