oj.uz

Submission #794707

# Submission time Handle Problem Language Result Execution time Memory
794707 2023-07-26T19:36:17 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 196496 KB 
#include <bits/stdc++.h>

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

const int INF = 2020202020;
const int K = 15;

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});
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.end()) break;
			chk(it->second);
			it++;
		}
	}

	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] - R[i]);
		seg.get(XR[i], Y[i] - R[i]);
		if (ans[i] == i) seg.upd(XL[i], XR[i], {Y[i] + R[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:104:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  104 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:104:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  104 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~
circle_selection.cpp:72:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
circle_selection.cpp:75:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |   scanf("%d%d%d", &X[i], &Y[i], &R[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 284 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 5 ms 2132 KB Output is correct
20 Correct 4 ms 2132 KB Output is correct
21 Correct 5 ms 2012 KB Output is correct
22 Correct 7 ms 2516 KB Output is correct
23 Correct 9 ms 3284 KB Output is correct
24 Correct 5 ms 2516 KB Output is correct
25 Correct 5 ms 2260 KB Output is correct
26 Correct 5 ms 2516 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 509 ms 111456 KB Output is correct
2 Correct 508 ms 111432 KB Output is correct
3 Correct 468 ms 111240 KB Output is correct
4 Correct 479 ms 111400 KB Output is correct
5 Correct 380 ms 63144 KB Output is correct
6 Correct 521 ms 122148 KB Output is correct
7 Correct 488 ms 113924 KB Output is correct
8 Correct 478 ms 116232 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 282 ms 51228 KB Output is correct
3 Correct 1125 ms 177160 KB Output is correct
4 Correct 1105 ms 176724 KB Output is correct
5 Correct 1648 ms 174252 KB Output is correct
6 Correct 487 ms 78860 KB Output is correct
7 Correct 152 ms 37776 KB Output is correct
8 Correct 19 ms 8236 KB Output is correct
9 Correct 1269 ms 179740 KB Output is correct
10 Correct 2830 ms 169620 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 826 ms 168252 KB Output is correct
2 Correct 395 ms 132760 KB Output is correct
3 Correct 1131 ms 118404 KB Output is correct
4 Correct 432 ms 136408 KB Output is correct
5 Correct 400 ms 133796 KB Output is correct
6 Correct 902 ms 112448 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 284 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 5 ms 2132 KB Output is correct
20 Correct 4 ms 2132 KB Output is correct
21 Correct 5 ms 2012 KB Output is correct
22 Correct 7 ms 2516 KB Output is correct
23 Correct 9 ms 3284 KB Output is correct
24 Correct 5 ms 2516 KB Output is correct
25 Correct 5 ms 2260 KB Output is correct
26 Correct 5 ms 2516 KB Output is correct
27 Correct 9 ms 3796 KB Output is correct
28 Correct 9 ms 3796 KB Output is correct
29 Correct 10 ms 3796 KB Output is correct
30 Correct 13 ms 5552 KB Output is correct
31 Correct 11 ms 4820 KB Output is correct
32 Correct 10 ms 4820 KB Output is correct
33 Correct 112 ms 28980 KB Output is correct
34 Correct 129 ms 28956 KB Output is correct
35 Correct 127 ms 29100 KB Output is correct
36 Correct 165 ms 41712 KB Output is correct
37 Correct 179 ms 42232 KB Output is correct
38 Correct 202 ms 44400 KB Output is correct
39 Correct 222 ms 7448 KB Output is correct
40 Correct 217 ms 7508 KB Output is correct
41 Correct 220 ms 7408 KB Output is correct
42 Correct 220 ms 7956 KB Output is correct
43 Correct 140 ms 35952 KB Output is correct
44 Correct 114 ms 35260 KB Output is correct
45 Correct 115 ms 35856 KB Output is correct
46 Correct 136 ms 35828 KB Output is correct
47 Correct 120 ms 34928 KB Output is correct
48 Correct 123 ms 35792 KB Output is correct
49 Correct 119 ms 34620 KB Output is correct
50 Correct 117 ms 35312 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 284 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 5 ms 2132 KB Output is correct
20 Correct 4 ms 2132 KB Output is correct
21 Correct 5 ms 2012 KB Output is correct
22 Correct 7 ms 2516 KB Output is correct
23 Correct 9 ms 3284 KB Output is correct
24 Correct 5 ms 2516 KB Output is correct
25 Correct 5 ms 2260 KB Output is correct
26 Correct 5 ms 2516 KB Output is correct
27 Correct 509 ms 111456 KB Output is correct
28 Correct 508 ms 111432 KB Output is correct
29 Correct 468 ms 111240 KB Output is correct
30 Correct 479 ms 111400 KB Output is correct
31 Correct 380 ms 63144 KB Output is correct
32 Correct 521 ms 122148 KB Output is correct
33 Correct 488 ms 113924 KB Output is correct
34 Correct 478 ms 116232 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 282 ms 51228 KB Output is correct
37 Correct 1125 ms 177160 KB Output is correct
38 Correct 1105 ms 176724 KB Output is correct
39 Correct 1648 ms 174252 KB Output is correct
40 Correct 487 ms 78860 KB Output is correct
41 Correct 152 ms 37776 KB Output is correct
42 Correct 19 ms 8236 KB Output is correct
43 Correct 1269 ms 179740 KB Output is correct
44 Correct 2830 ms 169620 KB Output is correct
45 Correct 826 ms 168252 KB Output is correct
46 Correct 395 ms 132760 KB Output is correct
47 Correct 1131 ms 118404 KB Output is correct
48 Correct 432 ms 136408 KB Output is correct
49 Correct 400 ms 133796 KB Output is correct
50 Correct 902 ms 112448 KB Output is correct
51 Correct 9 ms 3796 KB Output is correct
52 Correct 9 ms 3796 KB Output is correct
53 Correct 10 ms 3796 KB Output is correct
54 Correct 13 ms 5552 KB Output is correct
55 Correct 11 ms 4820 KB Output is correct
56 Correct 10 ms 4820 KB Output is correct
57 Correct 112 ms 28980 KB Output is correct
58 Correct 129 ms 28956 KB Output is correct
59 Correct 127 ms 29100 KB Output is correct
60 Correct 165 ms 41712 KB Output is correct
61 Correct 179 ms 42232 KB Output is correct
62 Correct 202 ms 44400 KB Output is correct
63 Correct 222 ms 7448 KB Output is correct
64 Correct 217 ms 7508 KB Output is correct
65 Correct 220 ms 7408 KB Output is correct
66 Correct 220 ms 7956 KB Output is correct
67 Correct 140 ms 35952 KB Output is correct
68 Correct 114 ms 35260 KB Output is correct
69 Correct 115 ms 35856 KB Output is correct
70 Correct 136 ms 35828 KB Output is correct
71 Correct 120 ms 34928 KB Output is correct
72 Correct 123 ms 35792 KB Output is correct
73 Correct 119 ms 34620 KB Output is correct
74 Correct 117 ms 35312 KB Output is correct
75 Correct 477 ms 111180 KB Output is correct
76 Correct 480 ms 111468 KB Output is correct
77 Correct 461 ms 111444 KB Output is correct
78 Correct 448 ms 111184 KB Output is correct
79 Correct 578 ms 111964 KB Output is correct
80 Correct 465 ms 111184 KB Output is correct
81 Correct 1031 ms 172052 KB Output is correct
82 Correct 819 ms 163076 KB Output is correct
83 Correct 900 ms 163272 KB Output is correct
84 Correct 1525 ms 187296 KB Output is correct
85 Correct 935 ms 169104 KB Output is correct
86 Correct 826 ms 161124 KB Output is correct
87 Execution timed out 3084 ms 196496 KB Time limit exceeded
88 Halted 0 ms 0 KB -