oj.uz

Submission #90971

# Submission time Handle Problem Language Result Execution time Memory
90971 2018-12-25T10:41:22 Z tincamatei Circle selection (APIO18_circle_selection) C++14
19 / 100
 3000 ms 54224 KB 
#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];
long long ld[1+MAX_N], rd[1+MAX_N];

set<pair<long long, 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;

		long long d = llabs(ox - xc[i]) + llabs(oy - yc[i]);

		ld[i] = d - 2 * rc[i];
		rd[i] = d + 2 * 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<long long, 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 520 KB Output is correct
4 Correct 2 ms 520 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 3 ms 764 KB Output is correct
17 Correct 3 ms 796 KB Output is correct
18 Correct 3 ms 828 KB Output is correct
19 Correct 9 ms 1628 KB Output is correct
20 Correct 8 ms 1908 KB Output is correct
21 Correct 9 ms 2076 KB Output is correct
22 Correct 10 ms 2132 KB Output is correct
23 Correct 9 ms 2264 KB Output is correct
24 Correct 9 ms 2412 KB Output is correct
25 Correct 9 ms 2552 KB Output is correct
26 Correct 9 ms 2680 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1365 ms 52508 KB Output is correct
2 Correct 1423 ms 52508 KB Output is correct
3 Correct 1278 ms 52508 KB Output is correct
4 Correct 1060 ms 52636 KB Output is correct
5 Correct 902 ms 52636 KB Output is correct
6 Correct 1010 ms 52636 KB Output is correct
7 Correct 1187 ms 52636 KB Output is correct
8 Correct 1213 ms 52636 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 52636 KB Output is correct
2 Correct 765 ms 52636 KB Output is correct
3 Correct 2869 ms 52636 KB Output is correct
4 Correct 2663 ms 53828 KB Output is correct
5 Execution timed out 3036 ms 53828 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1794 ms 54188 KB Output is correct
2 Correct 1338 ms 54224 KB Output is correct
3 Execution timed out 3034 ms 54224 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 520 KB Output is correct
4 Correct 2 ms 520 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 3 ms 764 KB Output is correct
17 Correct 3 ms 796 KB Output is correct
18 Correct 3 ms 828 KB Output is correct
19 Correct 9 ms 1628 KB Output is correct
20 Correct 8 ms 1908 KB Output is correct
21 Correct 9 ms 2076 KB Output is correct
22 Correct 10 ms 2132 KB Output is correct
23 Correct 9 ms 2264 KB Output is correct
24 Correct 9 ms 2412 KB Output is correct
25 Correct 9 ms 2552 KB Output is correct
26 Correct 9 ms 2680 KB Output is correct
27 Correct 28 ms 54224 KB Output is correct
28 Correct 18 ms 54224 KB Output is correct
29 Correct 16 ms 54224 KB Output is correct
30 Correct 18 ms 54224 KB Output is correct
31 Correct 20 ms 54224 KB Output is correct
32 Correct 19 ms 54224 KB Output is correct
33 Correct 269 ms 54224 KB Output is correct
34 Correct 270 ms 54224 KB Output is correct
35 Correct 267 ms 54224 KB Output is correct
36 Correct 426 ms 54224 KB Output is correct
37 Correct 426 ms 54224 KB Output is correct
38 Correct 503 ms 54224 KB Output is correct
39 Correct 2649 ms 54224 KB Output is correct
40 Execution timed out 3031 ms 54224 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 520 KB Output is correct
4 Correct 2 ms 520 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 3 ms 764 KB Output is correct
17 Correct 3 ms 796 KB Output is correct
18 Correct 3 ms 828 KB Output is correct
19 Correct 9 ms 1628 KB Output is correct
20 Correct 8 ms 1908 KB Output is correct
21 Correct 9 ms 2076 KB Output is correct
22 Correct 10 ms 2132 KB Output is correct
23 Correct 9 ms 2264 KB Output is correct
24 Correct 9 ms 2412 KB Output is correct
25 Correct 9 ms 2552 KB Output is correct
26 Correct 9 ms 2680 KB Output is correct
27 Correct 1365 ms 52508 KB Output is correct
28 Correct 1423 ms 52508 KB Output is correct
29 Correct 1278 ms 52508 KB Output is correct
30 Correct 1060 ms 52636 KB Output is correct
31 Correct 902 ms 52636 KB Output is correct
32 Correct 1010 ms 52636 KB Output is correct
33 Correct 1187 ms 52636 KB Output is correct
34 Correct 1213 ms 52636 KB Output is correct
35 Correct 2 ms 52636 KB Output is correct
36 Correct 765 ms 52636 KB Output is correct
37 Correct 2869 ms 52636 KB Output is correct
38 Correct 2663 ms 53828 KB Output is correct
39 Execution timed out 3036 ms 53828 KB Time limit exceeded
40 Halted 0 ms 0 KB -