oj.uz

답안 #982233

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982233 2024-05-14T04:11:50 Z Faisal_Saqib 원 고르기 (APIO18_circle_selection) C++17
0 / 100
 3000 ms 984472 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=3e5+100;
const int SQ=666;//  333 444
vector<int> adj[N];
ll who[N];
void solve()
{
	ll n;
	cin>>n;
	vector<ll> x(n),y(n),r(n);
	for(int i=0;i<n;i++)
		cin>>x[i]>>y[i]>>r[i];
	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
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7524 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7516 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 4 ms 7772 KB Output is correct
7 Correct 2 ms 7772 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 3 ms 7772 KB Output is correct
10 Correct 2 ms 7768 KB Output is correct
11 Correct 2 ms 7516 KB Output is correct
12 Correct 2 ms 7516 KB Output is correct
13 Correct 2 ms 7512 KB Output is correct
14 Correct 2 ms 7512 KB Output is correct
15 Correct 2 ms 7516 KB Output is correct
16 Correct 24 ms 22908 KB Output is correct
17 Incorrect 24 ms 21904 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3078 ms 984472 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7516 KB Output is correct
2 Correct 1105 ms 20544 KB Output is correct
3 Execution timed out 3049 ms 37288 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3055 ms 28512 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7524 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7516 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 4 ms 7772 KB Output is correct
7 Correct 2 ms 7772 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 3 ms 7772 KB Output is correct
10 Correct 2 ms 7768 KB Output is correct
11 Correct 2 ms 7516 KB Output is correct
12 Correct 2 ms 7516 KB Output is correct
13 Correct 2 ms 7512 KB Output is correct
14 Correct 2 ms 7512 KB Output is correct
15 Correct 2 ms 7516 KB Output is correct
16 Correct 24 ms 22908 KB Output is correct
17 Incorrect 24 ms 21904 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7524 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7516 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 4 ms 7772 KB Output is correct
7 Correct 2 ms 7772 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 3 ms 7772 KB Output is correct
10 Correct 2 ms 7768 KB Output is correct
11 Correct 2 ms 7516 KB Output is correct
12 Correct 2 ms 7516 KB Output is correct
13 Correct 2 ms 7512 KB Output is correct
14 Correct 2 ms 7512 KB Output is correct
15 Correct 2 ms 7516 KB Output is correct
16 Correct 24 ms 22908 KB Output is correct
17 Incorrect 24 ms 21904 KB Output isn't correct
18 Halted 0 ms 0 KB -