oj.uz

답안 #103223

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103223 2019-03-29T08:53:13 Z E869120 원 고르기 (APIO18_circle_selection) C++14
45 / 100
 3000 ms 555924 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; unsigned int 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_(unsigned int ax, unsigned int ay, unsigned int bx, unsigned int 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

# 결과 실행 시간 메모리 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 2 ms 640 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 3 ms 640 KB Output is correct
15 Correct 3 ms 640 KB Output is correct
16 Correct 7 ms 2944 KB Output is correct
17 Correct 7 ms 2944 KB Output is correct
18 Correct 6 ms 2944 KB Output is correct
19 Correct 31 ms 13396 KB Output is correct
20 Correct 33 ms 13412 KB Output is correct
21 Correct 39 ms 13412 KB Output is correct
22 Correct 36 ms 13312 KB Output is correct
23 Correct 33 ms 13312 KB Output is correct
24 Correct 36 ms 13336 KB Output is correct
25 Correct 46 ms 13312 KB Output is correct
26 Correct 35 ms 13312 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3074 ms 555924 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 890 ms 204252 KB Output is correct
3 Correct 2761 ms 552628 KB Output is correct
4 Correct 2822 ms 552660 KB Output is correct
5 Correct 2803 ms 537812 KB Output is correct
6 Correct 1220 ms 288268 KB Output is correct
7 Correct 650 ms 168044 KB Output is correct
8 Correct 120 ms 34928 KB Output is correct
9 Correct 2821 ms 552528 KB Output is correct
10 Correct 2587 ms 552772 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2394 ms 552788 KB Output is correct
2 Correct 2253 ms 552552 KB Output is correct
3 Correct 2234 ms 552692 KB Output is correct
4 Correct 2237 ms 552656 KB Output is correct
5 Correct 2319 ms 552664 KB Output is correct
6 Correct 2244 ms 552640 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 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 2 ms 640 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 3 ms 640 KB Output is correct
15 Correct 3 ms 640 KB Output is correct
16 Correct 7 ms 2944 KB Output is correct
17 Correct 7 ms 2944 KB Output is correct
18 Correct 6 ms 2944 KB Output is correct
19 Correct 31 ms 13396 KB Output is correct
20 Correct 33 ms 13412 KB Output is correct
21 Correct 39 ms 13412 KB Output is correct
22 Correct 36 ms 13312 KB Output is correct
23 Correct 33 ms 13312 KB Output is correct
24 Correct 36 ms 13336 KB Output is correct
25 Correct 46 ms 13312 KB Output is correct
26 Correct 35 ms 13312 KB Output is correct
27 Correct 78 ms 26356 KB Output is correct
28 Correct 76 ms 26484 KB Output is correct
29 Correct 80 ms 26356 KB Output is correct
30 Correct 70 ms 26228 KB Output is correct
31 Correct 85 ms 26228 KB Output is correct
32 Correct 73 ms 26228 KB Output is correct
33 Correct 819 ms 205252 KB Output is correct
34 Correct 748 ms 205036 KB Output is correct
35 Correct 864 ms 205096 KB Output is correct
36 Correct 914 ms 204136 KB Output is correct
37 Correct 915 ms 204008 KB Output is correct
38 Correct 953 ms 204008 KB Output is correct
39 Execution timed out 3120 ms 203752 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 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 2 ms 640 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 3 ms 640 KB Output is correct
15 Correct 3 ms 640 KB Output is correct
16 Correct 7 ms 2944 KB Output is correct
17 Correct 7 ms 2944 KB Output is correct
18 Correct 6 ms 2944 KB Output is correct
19 Correct 31 ms 13396 KB Output is correct
20 Correct 33 ms 13412 KB Output is correct
21 Correct 39 ms 13412 KB Output is correct
22 Correct 36 ms 13312 KB Output is correct
23 Correct 33 ms 13312 KB Output is correct
24 Correct 36 ms 13336 KB Output is correct
25 Correct 46 ms 13312 KB Output is correct
26 Correct 35 ms 13312 KB Output is correct
27 Execution timed out 3074 ms 555924 KB Time limit exceeded
28 Halted 0 ms 0 KB -