oj.uz

Submission #103203

# Submission time Handle Problem Language Result Execution time Memory
103203 2019-03-29T08:19:45 Z E869120 Circle selection (APIO18_circle_selection) C++14
7 / 100
 3000 ms 675140 KB 
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
#pragma warning (disable: 4996)

struct Node {
	int val, l, r; vector<int>num;
};

class SegmentTree {
public:
	vector<Node>vec; Node BASE; vector<int>V; long long lx, ly, rx, ry;

	void init() {
		BASE.l = -1; BASE.r = -1; BASE.val = 0;
		vec.push_back(BASE);
	}
	void add(long long px, long long py, int NN) {
		int cx = 0;
		for (int i = 61; i >= 0; i--) {
			vec[cx].val += 1;
			if (i >= 31) {
				int dep = i - 31;
				if (px >= (1LL << dep)) {
					if (vec[cx].r == -1) { vec[cx].r = vec.size(); vec.push_back(BASE); }
					cx = vec[cx].r; px -= (1LL << dep);
				}
				else {
					if (vec[cx].l == -1) { vec[cx].l = vec.size(); vec.push_back(BASE); }
					cx = vec[cx].l;
				}
			}
			else {
				int dep = i;
				if (py >= (1LL << dep)) {
					if (vec[cx].r == -1) { vec[cx].r = vec.size(); vec.push_back(BASE); }
					cx = vec[cx].r; py -= (1LL << dep);
				}
				else {
					if (vec[cx].l == -1) { vec[cx].l = vec.size(); vec.push_back(BASE); }
					cx = vec[cx].l;
				}
			}
		}
		vec[cx].val++; vec[cx].num.push_back(NN);
	}
	void lose(long long px, long long py, int NN) {
		int cx = 0;
		for (int i = 61; i >= 0; i--) {
			vec[cx].val -= 1;
			if (i >= 31) {
				int dep = i - 31;
				if (px >= (1LL << dep)) {
					if (vec[cx].r == -1) { vec[cx].r = vec.size(); vec.push_back(BASE); }
					cx = vec[cx].r; px -= (1LL << dep);
				}
				else {
					if (vec[cx].l == -1) { vec[cx].l = vec.size(); vec.push_back(BASE); }
					cx = vec[cx].l;
				}
			}
			else {
				int dep = i;
				if (py >= (1LL << dep)) {
					if (vec[cx].r == -1) { vec[cx].r = vec.size(); vec.push_back(BASE); }
					cx = vec[cx].r; py -= (1LL << dep);
				}
				else {
					if (vec[cx].l == -1) { vec[cx].l = vec.size(); vec.push_back(BASE); }
					cx = vec[cx].l;
				}
			}
		}
		vec[cx].val--; vec[cx].num.clear();
	}
	void query_(long long ax, long long ay, long long bx, long long by, int dep, int u) {
		if (vec[u].val == 0) return;
		if (rx <= ax || bx <= lx || ry <= ay || by <= ly) return;
		if (dep == 0) {
			for (int i : vec[u].num) V.push_back(i);
			return;
		}

		if (dep >= 32) {
			if (vec[u].l >= 0) query_(ax, ay, (ax + bx) >> 1, by, dep - 1, vec[u].l);
			if (vec[u].r >= 0) query_((ax + bx) >> 1, ay, bx, by, dep - 1, vec[u].r);
		}
		else {
			if (vec[u].l >= 0) query_(ax, ay, bx, (ay + by) >> 1, dep - 1, vec[u].l);
			if (vec[u].r >= 0) query_(ax, (ay + by) >> 1, bx, by, dep - 1, vec[u].r);
		}
	}
	vector<int> query(long long LX, long long LY, long long RX, long long RY) {
		LX = max(LX, 0LL); LY = max(LY, 0LL); RX = min(RX, (1LL << 31)); RY = min(RY, (1LL << 31));
		lx = LX; ly = LY; rx = RX; ry = RY;
		V.clear();
		query_(0, 0, (1LL << 31), (1LL << 31), 62, 0);
		return V;
	}
};

long long N, X[1 << 19], Y[1 << 19], R[1 << 19], score[1 << 19];
bool used[1 << 19];

long long dist(int p1, int p2) {
	return (X[p1] - X[p2]) * (X[p1] - X[p2]) + abs(Y[p1] - Y[p2]) * abs(Y[p1] - Y[p2]);
}

void solve_Jury() {
	while (true) {
		int maxn = -1, id = -1;
		for (int i = 1; i <= N; i++) {
			if (used[i] == true) continue;
			if (maxn < R[i]) { maxn = R[i]; id = i; }
		}

		if (id == -1) break;

		for (int i = 1; i <= N; i++) {
			if (used[i] == true) continue;
			if (dist(id, i) <= (R[i] + R[id]) * (R[i] + R[id])) { used[i] = true; score[i] = id; }
		}
	}
}

bool uses[1 << 19]; SegmentTree Z;

void solve_subtasks() {
	priority_queue<pair<long long, int>, vector<pair<long long, int>>, less<pair<long long, int>>>Q;
	Z.init();
	for (int i = 1; i <= N; i++) Q.push(make_pair(R[i], -i));
	for (int i = 1; i <= N; i++) Z.add(X[i], Y[i], i);

	while (!Q.empty()) {
		int pos = -Q.top().second;
		vector<int>E = Z.query(X[pos] - 2LL * R[pos], Y[pos] - 2LL * R[pos], X[pos] + 2LL * R[pos] + 1LL, Y[pos] + 2LL * R[pos] + 1LL);

		for (int i = 0; i < E.size(); i++) {
			if (dist(pos, E[i]) <= 1LL * (R[pos] + R[E[i]]) * (R[pos] + R[E[i]])) {
				Z.lose(X[E[i]], Y[E[i]], E[i]);
				used[E[i]] = true;
				score[E[i]] = pos;
			}
		}
		while (!Q.empty()) { int pos = -Q.top().second; if (used[pos] == false) break; Q.pop(); }
	}
}

int main() {
	scanf("%lld", &N);
	for (int i = 1; i <= N; i++) {
		scanf("%lld%lld%lld", &X[i], &Y[i], &R[i]);
		X[i] += (1LL << 30); Y[i] += (1LL << 30);
	}

	if (N <= 2) {
		solve_Jury();
	}

	else {
		solve_subtasks();
	}

	for (int i = 1; i <= N; i++) {
		if (i >= 2) printf(" ");
		printf("%lld", score[i]);
	}
	printf("\n");
	return 0;
}

Compilation message

circle_selection.cpp:5:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
circle_selection.cpp: In function 'void solve_subtasks()':
circle_selection.cpp:139:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < E.size(); i++) {
                   ~~^~~~~~~~~~
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:151:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &N);
  ~~~~~^~~~~~~~~~~~
circle_selection.cpp:153:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &X[i], &Y[i], &R[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 864 KB Output is correct
7 Correct 3 ms 864 KB Output is correct
8 Correct 3 ms 864 KB Output is correct
9 Correct 3 ms 864 KB Output is correct
10 Correct 3 ms 864 KB Output is correct
11 Correct 5 ms 864 KB Output is correct
12 Correct 3 ms 864 KB Output is correct
13 Correct 3 ms 864 KB Output is correct
14 Correct 3 ms 864 KB Output is correct
15 Correct 3 ms 864 KB Output is correct
16 Correct 9 ms 3196 KB Output is correct
17 Correct 11 ms 3196 KB Output is correct
18 Correct 8 ms 3068 KB Output is correct
19 Correct 51 ms 10988 KB Output is correct
20 Correct 38 ms 10980 KB Output is correct
21 Correct 49 ms 10988 KB Output is correct
22 Correct 47 ms 10988 KB Output is correct
23 Correct 110 ms 10980 KB Output is correct
24 Correct 43 ms 10988 KB Output is correct
25 Correct 50 ms 10980 KB Output is correct
26 Correct 51 ms 10980 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3050 ms 674960 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Execution timed out 3033 ms 335568 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3069 ms 675140 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 864 KB Output is correct
7 Correct 3 ms 864 KB Output is correct
8 Correct 3 ms 864 KB Output is correct
9 Correct 3 ms 864 KB Output is correct
10 Correct 3 ms 864 KB Output is correct
11 Correct 5 ms 864 KB Output is correct
12 Correct 3 ms 864 KB Output is correct
13 Correct 3 ms 864 KB Output is correct
14 Correct 3 ms 864 KB Output is correct
15 Correct 3 ms 864 KB Output is correct
16 Correct 9 ms 3196 KB Output is correct
17 Correct 11 ms 3196 KB Output is correct
18 Correct 8 ms 3068 KB Output is correct
19 Correct 51 ms 10988 KB Output is correct
20 Correct 38 ms 10980 KB Output is correct
21 Correct 49 ms 10988 KB Output is correct
22 Correct 47 ms 10988 KB Output is correct
23 Correct 110 ms 10980 KB Output is correct
24 Correct 43 ms 10988 KB Output is correct
25 Correct 50 ms 10980 KB Output is correct
26 Correct 51 ms 10980 KB Output is correct
27 Correct 94 ms 21488 KB Output is correct
28 Correct 92 ms 21464 KB Output is correct
29 Correct 81 ms 21532 KB Output is correct
30 Correct 177 ms 21452 KB Output is correct
31 Correct 122 ms 21460 KB Output is correct
32 Correct 110 ms 21472 KB Output is correct
33 Correct 1225 ms 335820 KB Output is correct
34 Correct 1259 ms 335508 KB Output is correct
35 Correct 1274 ms 335732 KB Output is correct
36 Correct 1657 ms 335700 KB Output is correct
37 Correct 1674 ms 335744 KB Output is correct
38 Correct 1904 ms 335588 KB Output is correct
39 Execution timed out 3014 ms 26700 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 864 KB Output is correct
7 Correct 3 ms 864 KB Output is correct
8 Correct 3 ms 864 KB Output is correct
9 Correct 3 ms 864 KB Output is correct
10 Correct 3 ms 864 KB Output is correct
11 Correct 5 ms 864 KB Output is correct
12 Correct 3 ms 864 KB Output is correct
13 Correct 3 ms 864 KB Output is correct
14 Correct 3 ms 864 KB Output is correct
15 Correct 3 ms 864 KB Output is correct
16 Correct 9 ms 3196 KB Output is correct
17 Correct 11 ms 3196 KB Output is correct
18 Correct 8 ms 3068 KB Output is correct
19 Correct 51 ms 10988 KB Output is correct
20 Correct 38 ms 10980 KB Output is correct
21 Correct 49 ms 10988 KB Output is correct
22 Correct 47 ms 10988 KB Output is correct
23 Correct 110 ms 10980 KB Output is correct
24 Correct 43 ms 10988 KB Output is correct
25 Correct 50 ms 10980 KB Output is correct
26 Correct 51 ms 10980 KB Output is correct
27 Execution timed out 3050 ms 674960 KB Time limit exceeded
28 Halted 0 ms 0 KB -