oj.uz

Submission #138648

# Submission time Handle Problem Language Result Execution time Memory
138648 2019-07-30T08:02:50 Z FedericoS Circle selection (APIO18_circle_selection) C++14
19 / 100
 1685 ms 56604 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pll;

int N;
ll X[300005],Y[300005],R[300005];
ll A[300005],P[300005];
vector<pll> V;

ll a;
set<pll> S;
map<ll, set<pll> > M;
ll r;

int main(){
	cin>>N;
	for(int i=0;i<N;i++){
		cin>>X[i]>>Y[i]>>R[i];
		a=max(a,Y[i]);
	}

	if(N<5001){
		for(int i=0;i<N;i++)
			V.push_back({-R[i],i});
		sort(V.begin(),V.end());
		for(int i=0;i<N;i++)
			P[i]=V[i].second;

		//for(int i=0;i<N;i++)cout<<P[i]+1<<" ";cout<<endl;

		for(int i=0;i<N;i++)
			for(int j=i+1;j<N;j++)
				if(
					(X[P[i]]-X[P[j]])*(X[P[i]]-X[P[j]])+
					(Y[P[i]]-Y[P[j]])*(Y[P[i]]-Y[P[j]])<=
					(R[P[i]]+R[P[j]])*(R[P[i]]+R[P[j]])
					and !A[P[j]] and !A[P[i]]
				)
					A[P[j]]=P[i]+1;

		for(int i=0;i<N;i++)
			cout<<(A[i]?A[i]:(i+1))<<" ";	}

	else if(!a){

		for(int i=0;i<N;i++)
			V.push_back({-R[i],i});
		sort(V.begin(),V.end());

		for(int i=0;i<N;i++){
			S.insert({X[i]+R[i],i});
			S.insert({X[i]-R[i],i});
			P[i]=V[i].second;
		}

		for(int j=0;j<N;j++){
			int i=P[j];
			if(S.count({X[i]-R[i],i}))
				for(auto p=S.lower_bound({X[i]-R[i],-1});p!=S.lower_bound({X[i]+R[i]+1,-1});){
					int q=p->second;
					A[q]=i+1;
					if(p==S.find({X[q]-R[q],q}))
						p++;
					S.erase(S.find({X[q]-R[q],q}));
					if(p==S.find({X[q]+R[q],q}))
						p++;
					S.erase(S.find({X[q]+R[q],q}));
				}
		}

		for(int i=0;i<N;i++)
			cout<<A[i]<<" ";}

	else{
		r=2*R[0];
		for(int i=0;i<N;i++)
			M[X[i]].insert({Y[i],i});

		for(int i=0;i<N;i++)
			if(!A[i]){
				for(auto s=M.lower_bound(X[i]-r);s!=M.lower_bound(X[i]+r+1);){

					for(auto p=(s->second).lower_bound({Y[i]-r,-1});p!=(s->second).lower_bound({Y[i]+r+1,-1});){

						int j=p->second;
						A[j]=i+1;

						auto q=p;
						p++;
						if((X[i]-X[j])*(X[i]-X[j])+(Y[i]-Y[j])*(Y[i]-Y[j])<=r*r)
							(s->second).erase(q);
					}

					auto g=s;
					s++;
					if((g->second).empty())
						M.erase(g);
				}
			}

		for(int i=0;i<N;i++)
			cout<<A[i]<<" ";

	}

}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 8 ms 380 KB Output is correct
17 Correct 8 ms 380 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 72 ms 760 KB Output is correct
20 Correct 65 ms 760 KB Output is correct
21 Correct 127 ms 760 KB Output is correct
22 Correct 49 ms 888 KB Output is correct
23 Correct 46 ms 760 KB Output is correct
24 Correct 71 ms 796 KB Output is correct
25 Correct 48 ms 760 KB Output is correct
26 Correct 47 ms 760 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1658 ms 56568 KB Output is correct
2 Correct 1637 ms 56604 KB Output is correct
3 Correct 1655 ms 56356 KB Output is correct
4 Correct 1685 ms 56552 KB Output is correct
5 Correct 1405 ms 56308 KB Output is correct
6 Correct 1637 ms 56416 KB Output is correct
7 Correct 1421 ms 56316 KB Output is correct
8 Correct 1426 ms 56420 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 766 ms 19768 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1534 ms 56100 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 8 ms 380 KB Output is correct
17 Correct 8 ms 380 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 72 ms 760 KB Output is correct
20 Correct 65 ms 760 KB Output is correct
21 Correct 127 ms 760 KB Output is correct
22 Correct 49 ms 888 KB Output is correct
23 Correct 46 ms 760 KB Output is correct
24 Correct 71 ms 796 KB Output is correct
25 Correct 48 ms 760 KB Output is correct
26 Correct 47 ms 760 KB Output is correct
27 Incorrect 32 ms 2296 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 8 ms 380 KB Output is correct
17 Correct 8 ms 380 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 72 ms 760 KB Output is correct
20 Correct 65 ms 760 KB Output is correct
21 Correct 127 ms 760 KB Output is correct
22 Correct 49 ms 888 KB Output is correct
23 Correct 46 ms 760 KB Output is correct
24 Correct 71 ms 796 KB Output is correct
25 Correct 48 ms 760 KB Output is correct
26 Correct 47 ms 760 KB Output is correct
27 Correct 1658 ms 56568 KB Output is correct
28 Correct 1637 ms 56604 KB Output is correct
29 Correct 1655 ms 56356 KB Output is correct
30 Correct 1685 ms 56552 KB Output is correct
31 Correct 1405 ms 56308 KB Output is correct
32 Correct 1637 ms 56416 KB Output is correct
33 Correct 1421 ms 56316 KB Output is correct
34 Correct 1426 ms 56420 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Incorrect 766 ms 19768 KB Output isn't correct
37 Halted 0 ms 0 KB -