제출 #50086

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
50086		zetapi	원 고르기 (APIO18_circle_selection)	C++14	0 / 100	643 ms	39448 KiB

circle_selection

#include <bits/stdc++.h>
using namespace std;
 
#define pb  push_back
#define mp  make_pair
#define int long long
#define itr ::iterator 
 
typedef pair<int,int>  pii;
 
const int MAX=4e5;
const int INF=1e12;

set<int> st;

vector< vector<pii> > vec(MAX);

int N,mnx,mny,X[MAX],Y[MAX],R[MAX],par[MAX],block[MAX][2];
 
bool ok(int F,int S)
{
	if((X[F]-X[S])*(X[F]-X[S])+(Y[F]-Y[S])*(Y[F]-Y[S])>(R[F]+R[S])*(R[F]+R[S]))
		return false;
	return true;
}
 
signed main()
{
	ios_base::sync_with_stdio(false);
	/*cin.tie(0);
	cout.tie(0);*/
 	
 	/* 	input
 		11
		9 9 2
		13 2 1
		11 8 2
		3 3 2
		3 12 1
		12 14 1
		9 8 5
		2 8 2
		5 2 1
		14 4 2
		14 14 1
	*/
 	mnx=INF;
 	mny=INF;
	cin>>N;
	for(int A=1;A<=N;A++)
	{
		cin>>X[A]>>Y[A]>>R[A];
		mnx=min(mnx,X[A]);
		mny=min(mny,Y[A]);
	}
	for(int A=1;A<=N;A++)
	{
		X[A]-=mnx;
		Y[A]-=mny;
		block[A][0]=X[A]/R[A];
		block[A][1]=Y[A]/R[A];
		//cout<<"ho ho "<<A<<" "<<X[A]<<" "<<Y[A]<<" "<<block[A][0]<<" "<<block[A][1]<<"\n";
		vec[block[A][1]].pb(mp(block[A][0],A));
		st.insert(block[A][1]);
	}
	for(auto A:st)
		sort(vec[A].begin(),vec[A].end());
	/*priority_queue<pii> qu;
	for(int A=1;A<=N;A++)
		qu.push(mp(R[A],-A));*/
	for(int A=1;A<=N;A++)
	//while(!qu.empty())
	{
		if(par[A])
			continue;
		par[A]=A;
		for(int B=block[A][1]-2;B<=block[A][1]+2;B++)
		{
			if(B<0)
				continue;
			if(vec[B].empty())
				continue;
			pii lol=mp(block[A][0]-2,0);
			for(vector<pii> itr it=lower_bound(vec[B].begin(),vec[B].end(),lol);it!=vec[B].end() and block[it->second][0]<=block[A][0]+2;it++)
			{
				if(par[it->second])
					continue;
				if(ok(A,it->second))
					par[it->second]=A;
				//cout<<"lo lo "<<A<<" "<<it->second<<"\n";
			}
		}
	}
	for(int A=1;A<=N;A++)
		cout<<par[A]<<" ";
	return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13