답안 #90964 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
90964	2018-12-25T10:32:25 Z	tincamatei	원 고르기 (APIO18_circle_selection)	C++14	49 / 100	3000 ms	55216 KB

circle_selection

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 300000;
int xc[1+MAX_N], yc[1+MAX_N], rc[1+MAX_N];
int poz[1+MAX_N], rez[1+MAX_N];
double ld[1+MAX_N], rd[1+MAX_N];

set<pair<double, int>> sl, sr;

bool cmp(int a, int b) {
	return rc[a] > rc[b] || (rc[a] == rc[b] && a < b);
}

double dist(int xa, int ya, int xb, int yb) {
	return sqrt((long long)(xa - xb) * (xa - xb) +
	            (long long)(ya - yb) * (ya - yb));
}

int main() {
#ifdef HOME
	FILE *fin = fopen("input.in", "r");
	FILE *fout = fopen("output.out", "w");
#else
	FILE *fin = stdin;
	FILE *fout = stdout;
#endif

	int n, ox, oy, mnx, mny;

	mnx = mny = 1000000000;

	fscanf(fin, "%d", &n);
	
	for(int i = 1; i <= n; ++i) {
		fscanf(fin, "%d%d%d", &xc[i], &yc[i], &rc[i]);
		mnx = min(mnx, xc[i]);
		mny = min(mny, yc[i]);
	}
	
	ox = oy = -2000000000;	

	for(int i = 1; i <= n; ++i) {
		xc[i] -= mnx;
		yc[i] -= mny;

		double d = dist(ox, oy, xc[i], yc[i]);

		ld[i] = d - rc[i];
		rd[i] = d + rc[i];
		
		sl.insert(make_pair(ld[i], i));
		sr.insert(make_pair(rd[i], i));
		poz[i - 1] = i;
	}

	sort(poz, poz + n, cmp);

	for(int i = 0; i < n; ++i) {
		int x = poz[i];
		
		if(rez[x] == 0) {
			set<pair<double, int> >::iterator it;

			it = sl.lower_bound(make_pair(ld[x], -1));
		
			while(it != sl.end() && it->first <= rd[x]) {
				int todel = it->second;
					
				if((long long)(rc[x] + rc[todel]) * (rc[x] + rc[todel]) >= 
				   (long long)(xc[x] - xc[todel]) * (xc[x] - xc[todel]) +
					 (long long)(yc[x] - yc[todel]) * (yc[x] - yc[todel])) {
					rez[todel] = x;
	
					sr.erase(make_pair(rd[todel], todel));
					it = sl.erase(it);
				} else
					it++;
			}
	
			it = sr.lower_bound(make_pair(ld[x], -1));
			while(it != sr.end() && it->first <= rd[x]) {
				int todel = it->second;
				if((long long)(rc[x] + rc[todel]) * (rc[x] + rc[todel]) >= 
				   (long long)(xc[x] - xc[todel]) * (xc[x] - xc[todel]) +
					 (long long)(yc[x] - yc[todel]) * (yc[x] - yc[todel])) {
					rez[todel] = x;
	
					sl.erase(make_pair(ld[todel], todel));
					it = sr.erase(it);
				} else
					it++;
			}
		}
	}
	
	for(int i = 1; i <= n; ++i)
		fprintf(fout, "%d ", rez[i]);

#ifdef HOME
	fclose(fin);
	fclose(fout);
#endif
	return 0;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:34:8: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fscanf(fin, "%d", &n);
  ~~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:37:9: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   fscanf(fin, "%d%d%d", &xc[i], &yc[i], &rc[i]);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	508 KB	Output is correct
3	Correct	2 ms	508 KB	Output is correct
4	Correct	2 ms	508 KB	Output is correct
5	Correct	2 ms	508 KB	Output is correct
6	Correct	2 ms	508 KB	Output is correct
7	Correct	2 ms	536 KB	Output is correct
8	Correct	2 ms	536 KB	Output is correct
9	Correct	2 ms	612 KB	Output is correct
10	Correct	2 ms	612 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	612 KB	Output is correct
13	Correct	2 ms	612 KB	Output is correct
14	Correct	2 ms	740 KB	Output is correct
15	Correct	2 ms	740 KB	Output is correct
16	Correct	3 ms	776 KB	Output is correct
17	Correct	3 ms	824 KB	Output is correct
18	Correct	3 ms	856 KB	Output is correct
19	Correct	9 ms	1784 KB	Output is correct
20	Correct	8 ms	1936 KB	Output is correct
21	Correct	9 ms	1976 KB	Output is correct
22	Correct	10 ms	2148 KB	Output is correct
23	Correct	10 ms	2312 KB	Output is correct
24	Correct	10 ms	2412 KB	Output is correct
25	Correct	10 ms	2576 KB	Output is correct
26	Correct	10 ms	2680 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1306 ms	53056 KB	Output is correct
2	Correct	1331 ms	53160 KB	Output is correct
3	Correct	1408 ms	53588 KB	Output is correct
4	Correct	1394 ms	53940 KB	Output is correct
5	Correct	1161 ms	53940 KB	Output is correct
6	Correct	1300 ms	53940 KB	Output is correct
7	Correct	1176 ms	53940 KB	Output is correct
8	Correct	1204 ms	53940 KB	Output is correct

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	53940 KB	Output is correct
2	Correct	681 ms	53940 KB	Output is correct
3	Correct	2709 ms	53940 KB	Output is correct
4	Correct	2093 ms	55016 KB	Output is correct
5	Correct	2087 ms	55016 KB	Output is correct
6	Correct	704 ms	55016 KB	Output is correct
7	Correct	317 ms	55016 KB	Output is correct
8	Correct	33 ms	55016 KB	Output is correct
9	Correct	2346 ms	55088 KB	Output is correct
10	Execution timed out	3036 ms	55088 KB	Time limit exceeded

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1291 ms	55216 KB	Output is correct
2	Correct	1168 ms	55216 KB	Output is correct
3	Execution timed out	3014 ms	55216 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	508 KB	Output is correct
3	Correct	2 ms	508 KB	Output is correct
4	Correct	2 ms	508 KB	Output is correct
5	Correct	2 ms	508 KB	Output is correct
6	Correct	2 ms	508 KB	Output is correct
7	Correct	2 ms	536 KB	Output is correct
8	Correct	2 ms	536 KB	Output is correct
9	Correct	2 ms	612 KB	Output is correct
10	Correct	2 ms	612 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	612 KB	Output is correct
13	Correct	2 ms	612 KB	Output is correct
14	Correct	2 ms	740 KB	Output is correct
15	Correct	2 ms	740 KB	Output is correct
16	Correct	3 ms	776 KB	Output is correct
17	Correct	3 ms	824 KB	Output is correct
18	Correct	3 ms	856 KB	Output is correct
19	Correct	9 ms	1784 KB	Output is correct
20	Correct	8 ms	1936 KB	Output is correct
21	Correct	9 ms	1976 KB	Output is correct
22	Correct	10 ms	2148 KB	Output is correct
23	Correct	10 ms	2312 KB	Output is correct
24	Correct	10 ms	2412 KB	Output is correct
25	Correct	10 ms	2576 KB	Output is correct
26	Correct	10 ms	2680 KB	Output is correct
27	Correct	18 ms	55216 KB	Output is correct
28	Correct	18 ms	55216 KB	Output is correct
29	Correct	17 ms	55216 KB	Output is correct
30	Correct	20 ms	55216 KB	Output is correct
31	Correct	22 ms	55216 KB	Output is correct
32	Correct	21 ms	55216 KB	Output is correct
33	Correct	295 ms	55216 KB	Output is correct
34	Correct	299 ms	55216 KB	Output is correct
35	Correct	373 ms	55216 KB	Output is correct
36	Correct	462 ms	55216 KB	Output is correct
37	Correct	393 ms	55216 KB	Output is correct
38	Correct	416 ms	55216 KB	Output is correct
39	Correct	1686 ms	55216 KB	Output is correct
40	Correct	1699 ms	55216 KB	Output is correct
41	Correct	1606 ms	55216 KB	Output is correct
42	Correct	734 ms	55216 KB	Output is correct
43	Correct	239 ms	55216 KB	Output is correct
44	Correct	242 ms	55216 KB	Output is correct
45	Correct	249 ms	55216 KB	Output is correct
46	Correct	254 ms	55216 KB	Output is correct
47	Correct	294 ms	55216 KB	Output is correct
48	Correct	254 ms	55216 KB	Output is correct
49	Correct	260 ms	55216 KB	Output is correct
50	Correct	239 ms	55216 KB	Output is correct

Subtask #6
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	508 KB	Output is correct
3	Correct	2 ms	508 KB	Output is correct
4	Correct	2 ms	508 KB	Output is correct
5	Correct	2 ms	508 KB	Output is correct
6	Correct	2 ms	508 KB	Output is correct
7	Correct	2 ms	536 KB	Output is correct
8	Correct	2 ms	536 KB	Output is correct
9	Correct	2 ms	612 KB	Output is correct
10	Correct	2 ms	612 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	612 KB	Output is correct
13	Correct	2 ms	612 KB	Output is correct
14	Correct	2 ms	740 KB	Output is correct
15	Correct	2 ms	740 KB	Output is correct
16	Correct	3 ms	776 KB	Output is correct
17	Correct	3 ms	824 KB	Output is correct
18	Correct	3 ms	856 KB	Output is correct
19	Correct	9 ms	1784 KB	Output is correct
20	Correct	8 ms	1936 KB	Output is correct
21	Correct	9 ms	1976 KB	Output is correct
22	Correct	10 ms	2148 KB	Output is correct
23	Correct	10 ms	2312 KB	Output is correct
24	Correct	10 ms	2412 KB	Output is correct
25	Correct	10 ms	2576 KB	Output is correct
26	Correct	10 ms	2680 KB	Output is correct
27	Correct	1306 ms	53056 KB	Output is correct
28	Correct	1331 ms	53160 KB	Output is correct
29	Correct	1408 ms	53588 KB	Output is correct
30	Correct	1394 ms	53940 KB	Output is correct
31	Correct	1161 ms	53940 KB	Output is correct
32	Correct	1300 ms	53940 KB	Output is correct
33	Correct	1176 ms	53940 KB	Output is correct
34	Correct	1204 ms	53940 KB	Output is correct
35	Correct	2 ms	53940 KB	Output is correct
36	Correct	681 ms	53940 KB	Output is correct
37	Correct	2709 ms	53940 KB	Output is correct
38	Correct	2093 ms	55016 KB	Output is correct
39	Correct	2087 ms	55016 KB	Output is correct
40	Correct	704 ms	55016 KB	Output is correct
41	Correct	317 ms	55016 KB	Output is correct
42	Correct	33 ms	55016 KB	Output is correct
43	Correct	2346 ms	55088 KB	Output is correct
44	Execution timed out	3036 ms	55088 KB	Time limit exceeded

답안 #90964

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 15.0

Subtask #4 0 / 23.0

Subtask #5 30.0 / 30.0

Subtask #6 0 / 13.0

Subtask #1
7.0 / 7.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 15.0

Subtask #4
0 / 23.0

Subtask #5
30.0 / 30.0

Subtask #6
0 / 13.0