oj.uz

Submission #103218

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

int cntv = 0;

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

vector<Node>vec;
Node BASE = { 0, -1, -1, {} };

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

	void init() {
		size_ = 1;
	}
	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 & 1) == 1) {
				int dep = (i >> 1);
				if (px >= (1LL << dep)) {
					if (vec[cx].r == -1) { vec[cx].r = size_; size_++; }
					cx = vec[cx].r; px -= (1LL << dep);
				}
				else {
					if (vec[cx].l == -1) { vec[cx].l = size_; size_++; }
					cx = vec[cx].l;
				}
			}
			else {
				int dep = (i >> 1);
				if (py >= (1LL << dep)) {
					if (vec[cx].r == -1) { vec[cx].r = size_; size_++; }
					cx = vec[cx].r; py -= (1LL << dep);
				}
				else {
					if (vec[cx].l == -1) { vec[cx].l = size_; size_++; }
					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 & 1) == 1) {
				int dep = (i >> 1);
				if (px >= (1LL << dep)) {
					if (vec[cx].r == -1) { vec[cx].r = size_; size_++; }
					cx = vec[cx].r; px -= (1LL << dep);
				}
				else {
					if (vec[cx].l == -1) { vec[cx].l = size_; size_++; }
					cx = vec[cx].l;
				}
			}
			else {
				int dep = (i >> 1);
				if (py >= (1LL << dep)) {
					if (vec[cx].r == -1) { vec[cx].r = size_; size_++; }
					cx = vec[cx].r; py -= (1LL << dep);
				}
				else {
					if (vec[cx].l == -1) { vec[cx].l = size_; size_++; }
					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;
		}
		cntv++;
		if (dep % 2 == 0) {
			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() {
	if (N <= 10000) vec.resize(N * 64, BASE);
	else if (N <= 100000) vec.resize(N * 50, BASE);
	else vec.resize(N * 45, BASE);

	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(); }
	}
	return;
}

long long Rand() {
	long long s = 1, t = 0;
	for (int i = 0; i < 3; i++) { t += (rand() % 1024)*s; s *= 1024; }
	return t;
}

int main() {
	srand((unsigned)time(NULL));
	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:6:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
circle_selection.cpp: In function 'void solve_subtasks()':
circle_selection.cpp:148: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:168:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &N);
  ~~~~~^~~~~~~~~~~~
circle_selection.cpp:170: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 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 688 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 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 3 ms 640 KB Output is correct
16 Correct 6 ms 2944 KB Output is correct
17 Correct 10 ms 2944 KB Output is correct
18 Correct 8 ms 2944 KB Output is correct
19 Correct 38 ms 13344 KB Output is correct
20 Correct 37 ms 13432 KB Output is correct
21 Correct 39 ms 13440 KB Output is correct
22 Correct 41 ms 13312 KB Output is correct
23 Correct 44 ms 13312 KB Output is correct
24 Correct 40 ms 13312 KB Output is correct
25 Correct 38 ms 13312 KB Output is correct
26 Correct 39 ms 13432 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 979 ms 204000 KB Output is correct
3 Correct 2816 ms 552680 KB Output is correct
4 Correct 2973 ms 552800 KB Output is correct
5 Correct 2843 ms 537680 KB Output is correct
6 Correct 1351 ms 288324 KB Output is correct
7 Correct 714 ms 168280 KB Output is correct
8 Correct 145 ms 35184 KB Output is correct
9 Correct 2980 ms 552660 KB Output is correct
10 Correct 2747 ms 552636 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2534 ms 552600 KB Output is correct
2 Correct 2338 ms 552568 KB Output is correct
3 Correct 2240 ms 552548 KB Output is correct
4 Correct 2261 ms 552580 KB Output is correct
5 Correct 2437 ms 552732 KB Output is correct
6 Correct 2178 ms 552464 KB Output is correct

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 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 688 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 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 3 ms 640 KB Output is correct
16 Correct 6 ms 2944 KB Output is correct
17 Correct 10 ms 2944 KB Output is correct
18 Correct 8 ms 2944 KB Output is correct
19 Correct 38 ms 13344 KB Output is correct
20 Correct 37 ms 13432 KB Output is correct
21 Correct 39 ms 13440 KB Output is correct
22 Correct 41 ms 13312 KB Output is correct
23 Correct 44 ms 13312 KB Output is correct
24 Correct 40 ms 13312 KB Output is correct
25 Correct 38 ms 13312 KB Output is correct
26 Correct 39 ms 13432 KB Output is correct
27 Correct 70 ms 26356 KB Output is correct
28 Correct 73 ms 26472 KB Output is correct
29 Correct 75 ms 26260 KB Output is correct
30 Correct 78 ms 26160 KB Output is correct
31 Correct 72 ms 26228 KB Output is correct
32 Correct 89 ms 26180 KB Output is correct
33 Correct 816 ms 204996 KB Output is correct
34 Correct 809 ms 204872 KB Output is correct
35 Correct 897 ms 204876 KB Output is correct
36 Correct 903 ms 204020 KB Output is correct
37 Correct 918 ms 204020 KB Output is correct
38 Correct 886 ms 203984 KB Output is correct
39 Execution timed out 3076 ms 204536 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 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 688 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 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 3 ms 640 KB Output is correct
16 Correct 6 ms 2944 KB Output is correct
17 Correct 10 ms 2944 KB Output is correct
18 Correct 8 ms 2944 KB Output is correct
19 Correct 38 ms 13344 KB Output is correct
20 Correct 37 ms 13432 KB Output is correct
21 Correct 39 ms 13440 KB Output is correct
22 Correct 41 ms 13312 KB Output is correct
23 Correct 44 ms 13312 KB Output is correct
24 Correct 40 ms 13312 KB Output is correct
25 Correct 38 ms 13312 KB Output is correct
26 Correct 39 ms 13432 KB Output is correct
27 Execution timed out 3111 ms 555884 KB Time limit exceeded
28 Halted 0 ms 0 KB -