답안 #57008 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57008	2018-07-13T15:02:26 Z	leejseo	원 고르기 (APIO18_circle_selection)	C++	7 / 100	1047 ms	66804 KB

circle_selection

#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;

inline long long sq(long long x) { return x * x; }

typedef struct Circle{
	int x, y;
	int r;
	int i;
	Circle(int i_, int x_, int y_, int r_){ i = i_, x = x_, y = y_, r = r_; }
	bool meet(const Circle &c) const{
		return (sq((long long) (x - c.x)) + sq((long long) (y - c.y)) <= sq((long long) (r + c.r)));
	}
	bool operator < (const Circle &c) const{
		if (r != c.r) return r > c.r;
		return i < c.i;
	}
} Circle;

vector<Circle> L;
set<pii> S; //bst w/ x-coord & index

int ans[300000];
bool vis[300000];
int N;

int input(){
	scanf("%d", &N);
	int minr = 1<<30;
	int maxr = -1;
	bool ally0 = 1;
	int x, y, r;
	for (int i=0; i<N; i++){
		scanf("%d%d%d", &x, &y, &r);
		L.push_back(Circle(i, x, y, r));
		minr = min(minr, r);
		maxr = max(maxr, r);
		if (y != 0) ally0 = 0;
	}
	if (N <= 5000) return 1;
	if (ally0) return 2;
	if (minr == maxr) return 4;
	return 3; // we skip sub5/6 we assume sub3
}

void sub1(){
	sort(L.begin(), L.end());
	for (int i=0; i<N; i++){
		if (vis[i]) continue;
		int ind = L[i].i;
		ans[ind] = ind;
		vis[i] = 1;
		for (int j=0; j<N; j++){
			if (vis[j]) continue;
			if (L[i].meet(L[j])){
				ans[L[j].i] = ind;
				vis[j] = 1;
			}
		}
	}
}

void sub2(){
	sort(L.begin(), L.end());
	for (int i=0; i<N; i++){
		S.insert(pii(L[i].x - L[i].r, i));
		S.insert(pii(L[i].x + L[i].r, i));
	}
	set<pii>::iterator iter;
	for (int i=0; i<N; i++){
		if (vis[i]) continue;
		int ind = L[i].i;
		ans[ind] = ind;
		vis[i] = 1;
		iter = S.lower_bound(make_pair(L[i].x-L[i].r, 0));
		pii com = pii(L[i].x+L[i].r, 1000000);
		for (;((*iter)<com)&&(!S.empty());){
			if (iter == S.end()) break;
			int j = (*iter).second;
			if (!vis[j]){
				ans[L[j].i] = ind;
				vis[j] = 1;
			}
			S.erase(iter);
		}
	}
}

int main(void){
	int st = input();
	if (st == 1){
		sub1();
		for (int i=0; i<N; i++){
			printf("%d ", ans[i]+1);
		}
		printf("\n");
	}
	else if (st == 2){
		sub2();
		for (int i=0; i<N; i++) printf("%d ", ans[i] + 1);
		printf("\n");
	}
	else{
		printf("-1");
	}
}

Compilation message

circle_selection.cpp: In function 'int input()':
circle_selection.cpp:30:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
circle_selection.cpp:36:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &x, &y, &r);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	3 ms	356 KB	Output is correct
4	Correct	2 ms	392 KB	Output is correct
5	Correct	2 ms	392 KB	Output is correct
6	Correct	3 ms	520 KB	Output is correct
7	Correct	2 ms	544 KB	Output is correct
8	Correct	2 ms	620 KB	Output is correct
9	Correct	2 ms	668 KB	Output is correct
10	Correct	2 ms	668 KB	Output is correct
11	Correct	2 ms	668 KB	Output is correct
12	Correct	2 ms	668 KB	Output is correct
13	Correct	3 ms	668 KB	Output is correct
14	Correct	3 ms	668 KB	Output is correct
15	Correct	2 ms	668 KB	Output is correct
16	Correct	3 ms	668 KB	Output is correct
17	Correct	3 ms	668 KB	Output is correct
18	Correct	3 ms	668 KB	Output is correct
19	Correct	6 ms	996 KB	Output is correct
20	Correct	9 ms	996 KB	Output is correct
21	Correct	6 ms	996 KB	Output is correct
22	Correct	92 ms	996 KB	Output is correct
23	Correct	84 ms	996 KB	Output is correct
24	Correct	84 ms	996 KB	Output is correct
25	Correct	60 ms	996 KB	Output is correct
26	Correct	56 ms	996 KB	Output is correct

Subtask #2
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1047 ms	66804 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	2 ms	66804 KB	Output is correct
2	Incorrect	66 ms	66804 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	190 ms	66804 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	3 ms	356 KB	Output is correct
4	Correct	2 ms	392 KB	Output is correct
5	Correct	2 ms	392 KB	Output is correct
6	Correct	3 ms	520 KB	Output is correct
7	Correct	2 ms	544 KB	Output is correct
8	Correct	2 ms	620 KB	Output is correct
9	Correct	2 ms	668 KB	Output is correct
10	Correct	2 ms	668 KB	Output is correct
11	Correct	2 ms	668 KB	Output is correct
12	Correct	2 ms	668 KB	Output is correct
13	Correct	3 ms	668 KB	Output is correct
14	Correct	3 ms	668 KB	Output is correct
15	Correct	2 ms	668 KB	Output is correct
16	Correct	3 ms	668 KB	Output is correct
17	Correct	3 ms	668 KB	Output is correct
18	Correct	3 ms	668 KB	Output is correct
19	Correct	6 ms	996 KB	Output is correct
20	Correct	9 ms	996 KB	Output is correct
21	Correct	6 ms	996 KB	Output is correct
22	Correct	92 ms	996 KB	Output is correct
23	Correct	84 ms	996 KB	Output is correct
24	Correct	84 ms	996 KB	Output is correct
25	Correct	60 ms	996 KB	Output is correct
26	Correct	56 ms	996 KB	Output is correct
27	Incorrect	9 ms	66804 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #6
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	3 ms	356 KB	Output is correct
4	Correct	2 ms	392 KB	Output is correct
5	Correct	2 ms	392 KB	Output is correct
6	Correct	3 ms	520 KB	Output is correct
7	Correct	2 ms	544 KB	Output is correct
8	Correct	2 ms	620 KB	Output is correct
9	Correct	2 ms	668 KB	Output is correct
10	Correct	2 ms	668 KB	Output is correct
11	Correct	2 ms	668 KB	Output is correct
12	Correct	2 ms	668 KB	Output is correct
13	Correct	3 ms	668 KB	Output is correct
14	Correct	3 ms	668 KB	Output is correct
15	Correct	2 ms	668 KB	Output is correct
16	Correct	3 ms	668 KB	Output is correct
17	Correct	3 ms	668 KB	Output is correct
18	Correct	3 ms	668 KB	Output is correct
19	Correct	6 ms	996 KB	Output is correct
20	Correct	9 ms	996 KB	Output is correct
21	Correct	6 ms	996 KB	Output is correct
22	Correct	92 ms	996 KB	Output is correct
23	Correct	84 ms	996 KB	Output is correct
24	Correct	84 ms	996 KB	Output is correct
25	Correct	60 ms	996 KB	Output is correct
26	Correct	56 ms	996 KB	Output is correct
27	Runtime error	1047 ms	66804 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
28	Halted	0 ms	0 KB	-

답안 #57008

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 0 / 12.0

Subtask #3 0 / 15.0

Subtask #4 0 / 23.0

Subtask #5 0 / 30.0

Subtask #6 0 / 13.0

Subtask #1
7.0 / 7.0

Subtask #2
0 / 12.0

Subtask #3
0 / 15.0

Subtask #4
0 / 23.0

Subtask #5
0 / 30.0

Subtask #6
0 / 13.0