oj.uz

Submission #673856

# Submission time Handle Problem Language Result Execution time Memory
673856 2022-12-22T09:41:18 Z Dan4Life Circle selection (APIO18_circle_selection) C++17
7 / 100
 3000 ms 33428 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;

bool intersects(int i, int j){
	int rr = v[i].r+v[j].r;
	int xx = v[i].x-v[j].x;
	int yy = v[i].y-v[j].y;
	return rr*rr>=xx*xx+yy*yy;
}

int32_t main(){
	ios::sync_with_stdio(false); cin.tie(0); bool ok=true;
	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}); ok&=(v[i].y==0);
	}
	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;
		if(!ok){
			for(int j = i; j < n; j++)
				if(intersects(i,j) and elim[v[j].i]==-1) elim[v[j].i]=v[i].i;
		}
		else{
			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] << " ";
}
/*
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
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 248 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 5 ms 976 KB Output is correct
20 Correct 4 ms 988 KB Output is correct
21 Correct 4 ms 1028 KB Output is correct
22 Correct 43 ms 980 KB Output is correct
23 Correct 37 ms 972 KB Output is correct
24 Correct 38 ms 988 KB Output is correct
25 Correct 37 ms 956 KB Output is correct
26 Correct 37 ms 980 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 370 ms 33428 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 324 KB Output is correct
2 Execution timed out 3072 ms 10784 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3090 ms 31460 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 248 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 5 ms 976 KB Output is correct
20 Correct 4 ms 988 KB Output is correct
21 Correct 4 ms 1028 KB Output is correct
22 Correct 43 ms 980 KB Output is correct
23 Correct 37 ms 972 KB Output is correct
24 Correct 38 ms 988 KB Output is correct
25 Correct 37 ms 956 KB Output is correct
26 Correct 37 ms 980 KB Output is correct
27 Correct 8 ms 1620 KB Output is correct
28 Correct 8 ms 1620 KB Output is correct
29 Correct 7 ms 1620 KB Output is correct
30 Correct 133 ms 1620 KB Output is correct
31 Correct 123 ms 1612 KB Output is correct
32 Correct 132 ms 1616 KB Output is correct
33 Correct 87 ms 11728 KB Output is correct
34 Correct 89 ms 11740 KB Output is correct
35 Correct 90 ms 11704 KB Output is correct
36 Execution timed out 3084 ms 11092 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 248 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 5 ms 976 KB Output is correct
20 Correct 4 ms 988 KB Output is correct
21 Correct 4 ms 1028 KB Output is correct
22 Correct 43 ms 980 KB Output is correct
23 Correct 37 ms 972 KB Output is correct
24 Correct 38 ms 988 KB Output is correct
25 Correct 37 ms 956 KB Output is correct
26 Correct 37 ms 980 KB Output is correct
27 Incorrect 370 ms 33428 KB Output isn't correct
28 Halted 0 ms 0 KB -