제출 #743850

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
743850		zaneyu	Izvanzemaljci (COI21_izvanzemaljci)	C++17	5 / 100	94 ms	4136 KiB

izvanzemaljci

#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 main(){
	int n,k;
	cin>>n>>k;
	REP(i,n){
		cin>>arr[i].f>>arr[i].s;
	}
	if(k==1){
		vector<int> vx,vy;
		REP(i,n) vx.pb(arr[i].f),vy.pb(arr[i].s);
		sort(ALL(vx)),sort(ALL(vy));
		cout<<vx[0]<<' '<<vy[0]<<' '<<max({1,vx.back()-vx[0],vy.back()-vy[0]});
	}
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 21
• Subtask 3: 0 / 12
• Subtask 4: 0 / 30
• Subtask 5: 0 / 32