oj.uz

Submission #90951

# Submission time Handle Problem Language Result Execution time Memory
90951 2018-12-25T09:46:26 Z tincamatei Circle selection (APIO18_circle_selection) C++14
0 / 100
 3000 ms 96704 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];
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;

	srand(time(NULL));

	ox = rand() % 2000000001 - 1000000000;
	oy = rand() % 2000000001 - 1000000000;

	fscanf(fin, "%d", &n);
	for(int i = 1; i <= n; ++i) {
		fscanf(fin, "%d%d%d", &xc[i], &yc[i], &rc[i]);
		
		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(rc[x] + rc[todel] >= dist(xc[x], yc[x], xc[todel], 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(rc[x] + rc[todel] >= dist(xc[x], yc[x], xc[todel], yc[todel])) {
					rez[todel] = x;
	
					sl.erase(make_pair(rd[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:36: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:38: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
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 636 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 884 KB Output is correct
6 Correct 2 ms 884 KB Output is correct
7 Correct 2 ms 884 KB Output is correct
8 Incorrect 2 ms 884 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1392 ms 57812 KB Output is correct
2 Incorrect 1370 ms 64488 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 64488 KB Output is correct
2 Correct 746 ms 64488 KB Output is correct
3 Execution timed out 3021 ms 73352 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1576 ms 83164 KB Output is correct
2 Correct 1238 ms 90280 KB Output is correct
3 Execution timed out 3061 ms 96704 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 504 KB Output is correct
2 Correct 2 ms 636 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 884 KB Output is correct
6 Correct 2 ms 884 KB Output is correct
7 Correct 2 ms 884 KB Output is correct
8 Incorrect 2 ms 884 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 636 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 884 KB Output is correct
6 Correct 2 ms 884 KB Output is correct
7 Correct 2 ms 884 KB Output is correct
8 Incorrect 2 ms 884 KB Output isn't correct
9 Halted 0 ms 0 KB -