oj.uz

Submission #982272

# Submission time Handle Problem Language Result Execution time Memory
982272 2024-05-14T05:20:03 Z Jawad_Akbar_JJ Circle selection (APIO18_circle_selection) C++17
7 / 100
 2407 ms 101016 KB 
#include <iostream>
#include <set>

using namespace std;
#define int long long

const int N = 3e5 + 10;

int x[N];
int y[N];
int r[N];

int erased[N];

int dist(int i,int j){
	int xd = x[i] - x[j];
	int yd = y[i] - y[j];
	return xd * xd + yd * yd;
}

void sub1(int n){
	set<pair<int,int>> s;

	for (int i=1;i<=n;i++)
		s.insert({-r[i],i});

	while (s.size() > 0){
		int i = (*begin(s)).second;
		for (int j=1;j<=n;j++)
			if (!erased[j] and dist(i,j) <= (r[i] + r[j]) * (r[i] + r[j])){
				s.erase({-r[j],j});
				erased[j] = i;
			}
	}
	for (int i=1;i<=n;i++)
		cout<<erased[i]<<' ';
	cout<<'\n';
	exit(0);
}

void sub2(int n){
	set<pair<int,int>> s,X;

	for (int i=1;i<=n;i++){
		s.insert({-r[i],i});
		X.insert({x[i] - r[i],i});
		X.insert({x[i] + r[i],i});
		X.insert({x[i],i});
	}

	set<int> ind;

	while (s.size() > 0){
		int i = (*begin(s)).second;
		cout<<x[i]<<" "<<y[i]<<" "<<r[i]<<" "<<i<<endl;
		auto u = X.upper_bound({x[i] - r[i],0});
		while (u != X.end() and (*u).first <= x[i] + r[i]){
			ind.insert((*u).second);
			u = next(u);
		}

		for (int j : ind){
			if (erased[j])
				continue;
			erased[j] = i;
			s.erase({-r[j],j});
			X.erase({x[j] - r[j],j});
			X.erase({x[j] + r[j],j});
			X.erase({x[j],j});
		}
	}

	for (int i=1;i<=n;i++)
		cout<<erased[i]<<' ';
	cout<<'\n';
	exit(0);
}

signed main(){

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int n;
	cin>>n;

	for (int i=1;i<=n;i++){
		cin>>x[i]>>y[i]>>r[i];
		y[0] += y[i];
	}
	

	if (y[0] == 0)
		sub2(n);

	if (n <= 5000)
		sub1(n);

}

// 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


// 10
// 1 0 1
// 3 0 1
// 5 0 2
// 7 0 1
// 9 0 3
// 11 0 1
// 13 0 2
// 15 0 1
// 16 0 1
// 17 0 1

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6744 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 5 ms 7004 KB Output is correct
20 Correct 4 ms 6748 KB Output is correct
21 Correct 4 ms 6976 KB Output is correct
22 Correct 40 ms 6972 KB Output is correct
23 Correct 41 ms 6948 KB Output is correct
24 Correct 40 ms 6964 KB Output is correct
25 Correct 39 ms 6964 KB Output is correct
26 Correct 39 ms 6748 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 62 ms 7504 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 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6744 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 5 ms 7004 KB Output is correct
20 Correct 4 ms 6748 KB Output is correct
21 Correct 4 ms 6976 KB Output is correct
22 Correct 40 ms 6972 KB Output is correct
23 Correct 41 ms 6948 KB Output is correct
24 Correct 40 ms 6964 KB Output is correct
25 Correct 39 ms 6964 KB Output is correct
26 Correct 39 ms 6748 KB Output is correct
27 Incorrect 3 ms 6488 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 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6744 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 5 ms 7004 KB Output is correct
20 Correct 4 ms 6748 KB Output is correct
21 Correct 4 ms 6976 KB Output is correct
22 Correct 40 ms 6972 KB Output is correct
23 Correct 41 ms 6948 KB Output is correct
24 Correct 40 ms 6964 KB Output is correct
25 Correct 39 ms 6964 KB Output is correct
26 Correct 39 ms 6748 KB Output is correct
27 Incorrect 2407 ms 101016 KB Output isn't correct
28 Halted 0 ms 0 KB -