oj.uz

Submission #851262

# Submission time Handle Problem Language Result Execution time Memory
851262 2023-09-19T08:15:38 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 238988 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;

const int INF = 2020202020;
const int K = 2;

int N;
int X[303030];
int Y[303030];
int R[303030];
int XL[303030];
int XR[303030];
int ans[303030];
int cur;

bool intersect(int i, int j) {
	long long dx = X[i] - X[j], dy = Y[i] - Y[j], r = R[i] + R[j];
	return dx * dx + dy * dy <= r * r;
}

void chk(int cand) {
	if (intersect(cur, cand)) {
		int &t = ans[cur];
		if (pii(R[cand], -cand) > pii(R[t], -t)) t = cand;
	}
}

struct SegTree {
	struct Node {
		set<pii> s;
	};

	int n, base;
	vector<Node> T;

	SegTree(int _n) : n(_n) {
		for (base = 1; base < n; base <<= 1);
		T.resize(base + base);
	}

	void chk_node(int idx, int y) {
		auto it = T[idx].s.lower_bound({y, 0});
		auto tmp = it;
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.end()) break;
			chk(it->second);
			it++;
		}
		it = tmp;
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.begin()) break;
			it--;
			chk(it->second);
		}
	}

	void upd(int p, int q, pii x) {
		p += base; q += base;
		p--; q--;
		while (p <= q) {
			if (p & 1) T[p++].s.insert(x);
			if (~q & 1) T[q--].s.insert(x);
			p >>= 1; q >>= 1;
		}
	}

	void get(int p, int y) {
		p += base; p--;
		while (p >= 1) {
			chk_node(p, y);
			p >>= 1;
		}
	}
};

int main() {
	scanf("%d", &N);
	vector<int> v;
	for (int i = 1; i <= N; i++) {
		scanf("%d%d%d", &X[i], &Y[i], &R[i]);
		XL[i] = X[i] - R[i], XR[i] = X[i] + R[i];
		v.push_back(XL[i]);
		v.push_back(XR[i]);
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	for (int i = 1; i <= N; i++) {
		XL[i] = lower_bound(v.begin(), v.end(), XL[i]) - v.begin() + 1;
		XR[i] = lower_bound(v.begin(), v.end(), XR[i]) - v.begin() + 1;
	}

	int M = v.size();
	SegTree seg(M);

	vector<int> idx(N);
	iota(idx.begin(), idx.end(), 1);
	sort(idx.begin(), idx.end(), [&](int a, int b) {
		return pii(R[a], -a) > pii(R[b], -b);
	});

	for (int i : idx) {
		cur = i;
		ans[i] = i;
		seg.get(XL[i], Y[i]);
		seg.get(XR[i], Y[i]);
		if (ans[i] == i) seg.upd(XL[i], XR[i], {Y[i], i});
	}

	for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
	return 0;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:111:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  111 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:111:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  111 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~
circle_selection.cpp:79:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
circle_selection.cpp:82:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |   scanf("%d%d%d", &X[i], &Y[i], &R[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6592 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8796 KB Output is correct
23 Correct 10 ms 9308 KB Output is correct
24 Correct 6 ms 8520 KB Output is correct
25 Correct 6 ms 8284 KB Output is correct
26 Correct 6 ms 8452 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 414 ms 111608 KB Output is correct
2 Correct 409 ms 113176 KB Output is correct
3 Correct 419 ms 112308 KB Output is correct
4 Correct 408 ms 113076 KB Output is correct
5 Correct 367 ms 64212 KB Output is correct
6 Correct 428 ms 124028 KB Output is correct
7 Correct 398 ms 115112 KB Output is correct
8 Correct 443 ms 118052 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 291 ms 55436 KB Output is correct
3 Correct 1124 ms 178764 KB Output is correct
4 Correct 1124 ms 176916 KB Output is correct
5 Correct 1529 ms 175564 KB Output is correct
6 Correct 489 ms 81720 KB Output is correct
7 Correct 158 ms 42372 KB Output is correct
8 Correct 17 ms 14040 KB Output is correct
9 Correct 1261 ms 181356 KB Output is correct
10 Correct 2025 ms 171048 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 734 ms 169840 KB Output is correct
2 Correct 347 ms 133560 KB Output is correct
3 Correct 874 ms 119320 KB Output is correct
4 Correct 387 ms 137220 KB Output is correct
5 Correct 361 ms 134148 KB Output is correct
6 Correct 637 ms 112452 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6592 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8796 KB Output is correct
23 Correct 10 ms 9308 KB Output is correct
24 Correct 6 ms 8520 KB Output is correct
25 Correct 6 ms 8284 KB Output is correct
26 Correct 6 ms 8452 KB Output is correct
27 Correct 9 ms 9820 KB Output is correct
28 Correct 10 ms 9816 KB Output is correct
29 Correct 9 ms 9820 KB Output is correct
30 Correct 14 ms 11608 KB Output is correct
31 Correct 14 ms 10844 KB Output is correct
32 Correct 11 ms 10844 KB Output is correct
33 Correct 105 ms 32964 KB Output is correct
34 Correct 104 ms 33120 KB Output is correct
35 Correct 115 ms 33160 KB Output is correct
36 Correct 173 ms 45708 KB Output is correct
37 Correct 156 ms 46280 KB Output is correct
38 Correct 199 ms 48508 KB Output is correct
39 Correct 136 ms 11592 KB Output is correct
40 Correct 135 ms 11716 KB Output is correct
41 Correct 132 ms 11356 KB Output is correct
42 Correct 142 ms 11852 KB Output is correct
43 Correct 104 ms 39916 KB Output is correct
44 Correct 107 ms 39264 KB Output is correct
45 Correct 107 ms 39876 KB Output is correct
46 Correct 102 ms 39700 KB Output is correct
47 Correct 102 ms 38988 KB Output is correct
48 Correct 106 ms 39928 KB Output is correct
49 Correct 101 ms 38476 KB Output is correct
50 Correct 110 ms 39768 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6592 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 5 ms 8284 KB Output is correct
22 Correct 6 ms 8796 KB Output is correct
23 Correct 10 ms 9308 KB Output is correct
24 Correct 6 ms 8520 KB Output is correct
25 Correct 6 ms 8284 KB Output is correct
26 Correct 6 ms 8452 KB Output is correct
27 Correct 414 ms 111608 KB Output is correct
28 Correct 409 ms 113176 KB Output is correct
29 Correct 419 ms 112308 KB Output is correct
30 Correct 408 ms 113076 KB Output is correct
31 Correct 367 ms 64212 KB Output is correct
32 Correct 428 ms 124028 KB Output is correct
33 Correct 398 ms 115112 KB Output is correct
34 Correct 443 ms 118052 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 291 ms 55436 KB Output is correct
37 Correct 1124 ms 178764 KB Output is correct
38 Correct 1124 ms 176916 KB Output is correct
39 Correct 1529 ms 175564 KB Output is correct
40 Correct 489 ms 81720 KB Output is correct
41 Correct 158 ms 42372 KB Output is correct
42 Correct 17 ms 14040 KB Output is correct
43 Correct 1261 ms 181356 KB Output is correct
44 Correct 2025 ms 171048 KB Output is correct
45 Correct 734 ms 169840 KB Output is correct
46 Correct 347 ms 133560 KB Output is correct
47 Correct 874 ms 119320 KB Output is correct
48 Correct 387 ms 137220 KB Output is correct
49 Correct 361 ms 134148 KB Output is correct
50 Correct 637 ms 112452 KB Output is correct
51 Correct 9 ms 9820 KB Output is correct
52 Correct 10 ms 9816 KB Output is correct
53 Correct 9 ms 9820 KB Output is correct
54 Correct 14 ms 11608 KB Output is correct
55 Correct 14 ms 10844 KB Output is correct
56 Correct 11 ms 10844 KB Output is correct
57 Correct 105 ms 32964 KB Output is correct
58 Correct 104 ms 33120 KB Output is correct
59 Correct 115 ms 33160 KB Output is correct
60 Correct 173 ms 45708 KB Output is correct
61 Correct 156 ms 46280 KB Output is correct
62 Correct 199 ms 48508 KB Output is correct
63 Correct 136 ms 11592 KB Output is correct
64 Correct 135 ms 11716 KB Output is correct
65 Correct 132 ms 11356 KB Output is correct
66 Correct 142 ms 11852 KB Output is correct
67 Correct 104 ms 39916 KB Output is correct
68 Correct 107 ms 39264 KB Output is correct
69 Correct 107 ms 39876 KB Output is correct
70 Correct 102 ms 39700 KB Output is correct
71 Correct 102 ms 38988 KB Output is correct
72 Correct 106 ms 39928 KB Output is correct
73 Correct 101 ms 38476 KB Output is correct
74 Correct 110 ms 39768 KB Output is correct
75 Correct 415 ms 113056 KB Output is correct
76 Correct 417 ms 112348 KB Output is correct
77 Correct 366 ms 113048 KB Output is correct
78 Correct 391 ms 112872 KB Output is correct
79 Correct 491 ms 113544 KB Output is correct
80 Correct 398 ms 121592 KB Output is correct
81 Correct 1010 ms 181648 KB Output is correct
82 Correct 791 ms 171628 KB Output is correct
83 Correct 806 ms 171792 KB Output is correct
84 Correct 1430 ms 197300 KB Output is correct
85 Correct 947 ms 177472 KB Output is correct
86 Correct 771 ms 169116 KB Output is correct
87 Execution timed out 3030 ms 238988 KB Time limit exceeded
88 Halted 0 ms 0 KB -