Submission #393328

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
393328	2021-04-23T07:59:42 Z	Nima_Naderi	Circle selection (APIO18_circle_selection)	C++14	7 / 100	81 ms	836 KB

circle_selection

//In the name of God
//#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
const ll MXN = 5e3 + 10;
ll n;
ll X[MXN], Y[MXN], R[MXN], A[MXN];
bool Crs(ll i, ll j){
	ll dis = (X[i] - X[j]) * (X[i] - X[j]) + (Y[i] - Y[j]) * (Y[i] - Y[j]);
	return (dis <= (R[j] + R[i]) * (R[i] + R[j]));
}
set<pll> st;
void Rm(ll i){
	auto itr = st.find({-R[i], i});
	st.erase(itr);
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i ++) cin >> X[i] >> Y[i] >> R[i];
	for(int i = 1; i <= n; i ++) st.insert({-R[i], i});
	while(!st.empty()){
		ll i = st.begin() -> second;
		Rm(i), A[i] = i;
		for(int j = 1; j <= n; j ++){
			if(!A[j] && Crs(i, j)) A[j] = i, Rm(j);
		}
	}
	for(int i = 1; i <= n; i ++) cout << A[i] << ' '; cout << '\n';
	return 0;
}
//! N.N

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:32:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   32 |  for(int i = 1; i <= n; i ++) cout << A[i] << ' '; cout << '\n';
      |  ^~~
circle_selection.cpp:32:52: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   32 |  for(int i = 1; i <= n; i ++) cout << A[i] << ' '; cout << '\n';
      |                                                    ^~~~

Subtask #1

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	216 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	4 ms	716 KB	Output is correct
20	Correct	5 ms	716 KB	Output is correct
21	Correct	8 ms	716 KB	Output is correct
22	Correct	67 ms	768 KB	Output is correct
23	Correct	81 ms	760 KB	Output is correct
24	Correct	78 ms	716 KB	Output is correct
25	Correct	80 ms	776 KB	Output is correct
26	Correct	67 ms	836 KB	Output is correct

Subtask #2

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	3 ms	632 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Runtime error	3 ms	588 KB	Execution killed with signal 11
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	3 ms	588 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	216 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	4 ms	716 KB	Output is correct
20	Correct	5 ms	716 KB	Output is correct
21	Correct	8 ms	716 KB	Output is correct
22	Correct	67 ms	768 KB	Output is correct
23	Correct	81 ms	760 KB	Output is correct
24	Correct	78 ms	716 KB	Output is correct
25	Correct	80 ms	776 KB	Output is correct
26	Correct	67 ms	836 KB	Output is correct
27	Runtime error	3 ms	588 KB	Execution killed with signal 11
28	Halted	0 ms	0 KB	-

Subtask #6

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	216 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	4 ms	716 KB	Output is correct
20	Correct	5 ms	716 KB	Output is correct
21	Correct	8 ms	716 KB	Output is correct
22	Correct	67 ms	768 KB	Output is correct
23	Correct	81 ms	760 KB	Output is correct
24	Correct	78 ms	716 KB	Output is correct
25	Correct	80 ms	776 KB	Output is correct
26	Correct	67 ms	836 KB	Output is correct
27	Runtime error	3 ms	632 KB	Execution killed with signal 11
28	Halted	0 ms	0 KB	-