oj.uz

Submission #673837

# Submission time Handle Problem Language Result Execution time Memory
673837 2022-12-22T09:15:06 Z Dan4Life Circle selection (APIO18_circle_selection) C++17
0 / 100
 667 ms 40496 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define int long long 
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
using ll = long long;
const int maxn = (int)3e5+10;
const ll LINF = (ll)2e18;
struct circle{
	int x, y, r, i;
};

int n, elim[maxn];
vector<circle> v;

int poww(int a, int b){
	if(b==0) return 1;
	int x = poww(a,b/2); x*=x;
	if(b&1) x*=a;
	return x;
}

bool intersects(int i, int j){
	return poww(v[i].r+v[j].r,2)-poww(abs(v[i].y-v[j].y),2)>=poww(abs(v[i].x-v[j].x),2);
}

int32_t main(){
	cin >> n; v.resize(n); set<pair<int,int>> S;
	for(int i = 0; i < n; i++){
		cin >> v[i].x >> v[i].y >> v[i].r; 
		v[i].i=i; elim[i]=-1; S.insert({v[i].x, i});
	}
	sort(all(v), [&](circle a, circle b){
		if(a.r!=b.r) return a.r > b.r;
		return a.i < b.i;
	});
	for(int i = 0; i < n; i++){
		if(elim[v[i].i]!=-1) continue;
		/*for(int j = i; j < n; j++)
			if(intersects(i,j)) elim[v[j].i]=v[i].i;*/
		while(!S.empty()){
			auto itr = S.lower_bound({v[i].x-v[i].r,-1});
			if(itr!=S.end() and itr->fi <= v[i].x) elim[itr->se]=v[i].i, S.erase(itr);
			else break;
		}
	}
	for(int i = 0; i < n; i++) cout << elim[i]+1 << " ";
}
/*
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
*/

Subtask #1
0 / 7.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

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

Subtask #6
0 / 13.0

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