답안 #263285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
263285	2020-08-13T15:04:52 Z	dsjong	원 고르기 (APIO18_circle_selection)	C++14	7 / 100	67 ms	1920 KB

circle_selection

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define F first
#define S second
int ans[5005];
int x[5005], y[5005], r[5005];
bool isct(int i, int j){
	int md=(r[i]+r[j])*(r[i]+r[j]);
	int d=(x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]);
	return d<=md;
}
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int n;
	cin>>n;
	vector<pii>v;
	for(int i=1;i<=n;i++){
		cin>>x[i]>>y[i]>>r[i];
		v.push_back({r[i], -i});
	}
	sort(v.begin(), v.end());
	while(!v.empty()){
		int cur=-v.back().S;
		v.pop_back();
		if(ans[cur]) continue;
		for(int i=1;i<=n;i++){
			if(isct(i, cur) && ans[i]==0) ans[i]=cur;
		}
	}
	for(int i=1;i<=n;i++){
		cout<<ans[i]<<" ";
	}
}

Subtask #1

7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	416 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	360 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	396 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	2 ms	512 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	3 ms	896 KB	Output is correct
20	Correct	5 ms	896 KB	Output is correct
21	Correct	4 ms	896 KB	Output is correct
22	Correct	67 ms	888 KB	Output is correct
23	Correct	53 ms	888 KB	Output is correct
24	Correct	47 ms	896 KB	Output is correct
25	Correct	41 ms	888 KB	Output is correct
26	Correct	47 ms	872 KB	Output is correct

Subtask #2

0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	5 ms	1920 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Runtime error	7 ms	1920 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	6 ms	1920 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	416 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	360 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	396 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	2 ms	512 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	3 ms	896 KB	Output is correct
20	Correct	5 ms	896 KB	Output is correct
21	Correct	4 ms	896 KB	Output is correct
22	Correct	67 ms	888 KB	Output is correct
23	Correct	53 ms	888 KB	Output is correct
24	Correct	47 ms	896 KB	Output is correct
25	Correct	41 ms	888 KB	Output is correct
26	Correct	47 ms	872 KB	Output is correct
27	Runtime error	6 ms	1664 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
28	Halted	0 ms	0 KB	-

Subtask #6

0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	416 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	360 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	396 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	2 ms	512 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	3 ms	896 KB	Output is correct
20	Correct	5 ms	896 KB	Output is correct
21	Correct	4 ms	896 KB	Output is correct
22	Correct	67 ms	888 KB	Output is correct
23	Correct	53 ms	888 KB	Output is correct
24	Correct	47 ms	896 KB	Output is correct
25	Correct	41 ms	888 KB	Output is correct
26	Correct	47 ms	872 KB	Output is correct
27	Runtime error	5 ms	1920 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
28	Halted	0 ms	0 KB	-