oj.uz

답안 #49978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
49978 2018-06-05T18:12:08 Z zetapi 원 고르기 (APIO18_circle_selection) C++14
0 / 100
 953 ms 44808 KB 
#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;

vector< pair<int,pii> > vec;

set<pii> st;
set<pii> itr it,it2;

int N,ind,X[MAX],Y[MAX],R[MAX],par[MAX];

void 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 ;
	if(R[F]==R[S] and F>S)
		swap(F,S);
	if(R[F]>R[S])
		swap(F,S);
	par[F]=S;
	return ;
}

signed main()
{
	ios_base::sync_with_stdio(false);
	/*cin.tie(0);
	cout.tie(0);*/

	cin>>N;
	for(int A=1;A<=N;A++)
	{
		par[A]=A;
		cin>>X[A]>>Y[A]>>R[A];
		vec.pb(mp(Y[A]-R[A],mp(0,A)));
		vec.pb(mp(Y[A]+R[A],mp(1,A)));
	}
	sort(vec.begin(),vec.end());
	for(int A=0;A<vec.size();A++)
	{
		ind=vec[A].second.second;
		if(vec[A].second.first==0)
		{
			st.insert(mp(X[ind],ind));
			it=st.find(mp(X[ind],0));
          	it++;
			if(it!=st.end())
				ok(ind,it->second);
			it--;
			if(it!=st.begin())
			{
				it--;
				ok(ind,it->second);
			}	
		}
		else
 		{
 			it=st.find(mp(X[ind],ind));
 			it2=it;
 			it2++;
 			if(it2!=st.end() and it!=st.begin())
 			{
 				it--;
 				ok(it->second,it2->second);
 			}
 			st.erase(mp(X[ind],ind));	
 		}
	}
	for(int A=1;A<=N;A++)
		cout<<par[A]<<" ";
	return 0;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:48:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int A=0;A<vec.size();A++)
              ~^~~~~~~~~~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Incorrect 2 ms 392 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 953 ms 44808 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 44808 KB Output is correct
2 Incorrect 126 ms 44808 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 368 ms 44808 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Incorrect 2 ms 392 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Incorrect 2 ms 392 KB Output isn't correct
4 Halted 0 ms 0 KB -