제출 #982265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
982265		Faisal_Saqib	원 고르기 (APIO18_circle_selection)	C++17	34 / 100	1795 ms	145380 KiB

circle_selection

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=3e5+100;
const int SQ=222;//  333 444
vector<int> adj[N];
ll who[N];
void solve()
{
	ll n;
	cin>>n;
	vector<ll> x(n),y(n),r(n);
	set<ll> tpy;
	for(int i=0;i<n;i++)
	{
		cin>>x[i]>>y[i]>>r[i];
		tpy.insert(y[i]);
	}
	if(tpy.size()==1)
	{
		set<pair<int,int>> only_l,only_r;
		set<pair<int,int>> rem;
		for(int i=0;i<n;i++)
		{
			only_l.insert({x[i]-r[i],i});
			only_r.insert({x[i]+r[i],i});
			rem.insert({-r[i],i});
		}
		while(rem.size())
		{
			auto p=*begin(rem);
			rem.erase(begin(rem));
			if(who[p.second]!=0)
				continue;
			int mi=x[p.second]-r[p.second];
			int mx=x[p.second]+r[p.second];
			// cout<<"Hello "<<p.second<<' '<<p.first<<endl;
			// We find all element which have there l between mi and mx inclusive
			while(only_l.size())
			{
				auto it=only_l.lower_bound({mi,-1});
				if(end(only_l)!=it)
				{
					auto tpl=*it;
					if(tpl.first<=mx)
					{
						if(who[tpl.second]==0)
						{
							// cout<<"Removed_L "<<tpl.first<<' '<<tpl.second<<endl;
							who[tpl.second]=p.second+1;
						}
						only_l.erase(it);
					}
					else
					{
						break;
					}
				}
				else
				{
					break;
				}
			}
			while(only_r.size())
			{
				auto it=only_r.lower_bound({mx+1,-1});
				if(begin(only_r)!=it)
				{
					it--;
					auto tpl=*it;
					if(mi<=tpl.first)
					{
						if(who[tpl.second]==0)
						{
							// cout<<"Removed_R "<<tpl.first<<' '<<tpl.second<<endl;
							who[tpl.second]=p.second+1;
						}
						only_r.erase(it);
					}
					else
					{
						break;
					}
				}
				else
				{
					break;
				}
			}
			// cout<<"Khatam\n";
		}
		for(int i=0;i<n;i++)
		{
			cout<<who[i]<<' ';
		}
		cout<<'\n';
	}
	else if((n<=5000))
	{
		for(int i=0;i<n;i++)
			{
				for(int j=0;j<=i;j++)
				{
					// ( (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) ) <= (r1+r2)²
					ll dist=(r[i]+r[j])*(r[i]+r[j]);
					ll dp=( (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]) );
					if(dp<=dist)
					{
						adj[i].push_back(j);
						adj[j].push_back(i);
					}
				}
			}
			set<pair<int,int>> rem;
			for(int i=0;i<n;i++)
				rem.insert({-r[i],i});
			while(rem.size())
			{
				auto p=*begin(rem);
				rem.erase(begin(rem));
				if(who[p.second]!=0)
					continue;
				for(auto op:adj[p.second])
					if(who[op]==0)
						who[op]=p.second+1;
			}
			for(int i=0;i<n;i++)
			{
				cout<<who[i]<<' ';
			}
			cout<<'\n';
	}
	else
	{

		vector<pair<ll,ll>> tp(n);
		for(int i=0;i<n;i++)
		{
			tp[i].first=x[i];
			tp[i].second=i;
		}
		sort(begin(tp),end(tp));
		for(int jp=0;jp<n;jp++)
		{
			for(int l=-SQ;l<=SQ;l++)
			{
				if((jp+l)>=0 and (jp+l)<n)
				{
					int i=tp[jp].second;
					int j=tp[jp+l].second;
					ll dist=(r[i]+r[j])*(r[i]+r[j]);
					ll dp=( (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]) );
					if(dp<=dist)
					{
						adj[i].push_back(j);
						adj[j].push_back(i);
					}
				}
			}
		}
		for(int i=0;i<n;i++)
		{
			tp[i].first=y[i];
			tp[i].second=i;
		}
		sort(begin(tp),end(tp));
		for(int jp=0;jp<n;jp++)
		{
			for(int l=-SQ;l<=SQ;l++)
			{
				if((jp+l)>=0 and (jp+l)<n)
				{
					int i=tp[jp].second;
					int j=tp[jp+l].second;
					ll dist=(r[i]+r[j])*(r[i]+r[j]);
					ll dp=( (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]) );
					if(dp<=dist)
					{
						adj[i].push_back(j);
						adj[j].push_back(i);
					}
				}
			}
		}
		set<pair<int,int>> rem;
		for(int i=0;i<n;i++)
			rem.insert({-r[i],i});
		while(rem.size())
		{
			auto p=*begin(rem);
			rem.erase(begin(rem));
			if(who[p.second]!=0)
				continue;
			for(auto op:adj[p.second])
				if(who[op]==0)
					who[op]=p.second+1;
		}
		for(int i=0;i<n;i++)
		{
			cout<<who[i]<<' ';
		}
		cout<<'\n';
	}
}
int main()
{
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(0);
	solve();
}

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