oj.uz

Submission #794690

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

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

const int K = 8;

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(XL[i], Y[i] + R[i]);
		seg.get(XR[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:105:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  105 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:105:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  105 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |                                                      ^~~~
circle_selection.cpp:71:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
circle_selection.cpp:74:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   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 340 KB Output is correct
2 Correct 1 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 6 ms 2240 KB Output is correct
20 Correct 5 ms 2260 KB Output is correct
21 Correct 5 ms 2132 KB Output is correct
22 Correct 6 ms 2644 KB Output is correct
23 Correct 12 ms 3412 KB Output is correct
24 Correct 6 ms 2644 KB Output is correct
25 Correct 5 ms 2444 KB Output is correct
26 Correct 6 ms 2624 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 519 ms 111564 KB Output is correct
2 Correct 534 ms 111540 KB Output is correct
3 Correct 518 ms 111376 KB Output is correct
4 Correct 534 ms 111556 KB Output is correct
5 Correct 421 ms 63276 KB Output is correct
6 Correct 513 ms 122272 KB Output is correct
7 Correct 486 ms 115720 KB Output is correct
8 Correct 522 ms 118012 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 380 ms 51468 KB Output is correct
3 Correct 1240 ms 179160 KB Output is correct
4 Correct 1205 ms 178420 KB Output is correct
5 Correct 1834 ms 176088 KB Output is correct
6 Correct 585 ms 80652 KB Output is correct
7 Correct 177 ms 39532 KB Output is correct
8 Correct 21 ms 8720 KB Output is correct
9 Correct 1437 ms 181456 KB Output is correct
10 Correct 2660 ms 171392 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 924 ms 168488 KB Output is correct
2 Correct 424 ms 134492 KB Output is correct
3 Correct 1268 ms 120148 KB Output is correct
4 Correct 466 ms 138204 KB Output is correct
5 Correct 461 ms 135648 KB Output is correct
6 Correct 1138 ms 114260 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 6 ms 2240 KB Output is correct
20 Correct 5 ms 2260 KB Output is correct
21 Correct 5 ms 2132 KB Output is correct
22 Correct 6 ms 2644 KB Output is correct
23 Correct 12 ms 3412 KB Output is correct
24 Correct 6 ms 2644 KB Output is correct
25 Correct 5 ms 2444 KB Output is correct
26 Correct 6 ms 2624 KB Output is correct
27 Correct 11 ms 3924 KB Output is correct
28 Correct 11 ms 3996 KB Output is correct
29 Correct 10 ms 3920 KB Output is correct
30 Correct 16 ms 5644 KB Output is correct
31 Correct 12 ms 4968 KB Output is correct
32 Correct 12 ms 4948 KB Output is correct
33 Correct 127 ms 29176 KB Output is correct
34 Correct 142 ms 29112 KB Output is correct
35 Correct 141 ms 29172 KB Output is correct
36 Correct 177 ms 41836 KB Output is correct
37 Correct 191 ms 43932 KB Output is correct
38 Correct 246 ms 46256 KB Output is correct
39 Correct 255 ms 8564 KB Output is correct
40 Correct 251 ms 8512 KB Output is correct
41 Correct 257 ms 8524 KB Output is correct
42 Correct 262 ms 9304 KB Output is correct
43 Correct 150 ms 37704 KB Output is correct
44 Correct 128 ms 36976 KB Output is correct
45 Correct 129 ms 37700 KB Output is correct
46 Correct 147 ms 37696 KB Output is correct
47 Correct 132 ms 36668 KB Output is correct
48 Correct 127 ms 37552 KB Output is correct
49 Correct 126 ms 36364 KB Output is correct
50 Correct 128 ms 37116 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 6 ms 2240 KB Output is correct
20 Correct 5 ms 2260 KB Output is correct
21 Correct 5 ms 2132 KB Output is correct
22 Correct 6 ms 2644 KB Output is correct
23 Correct 12 ms 3412 KB Output is correct
24 Correct 6 ms 2644 KB Output is correct
25 Correct 5 ms 2444 KB Output is correct
26 Correct 6 ms 2624 KB Output is correct
27 Correct 519 ms 111564 KB Output is correct
28 Correct 534 ms 111540 KB Output is correct
29 Correct 518 ms 111376 KB Output is correct
30 Correct 534 ms 111556 KB Output is correct
31 Correct 421 ms 63276 KB Output is correct
32 Correct 513 ms 122272 KB Output is correct
33 Correct 486 ms 115720 KB Output is correct
34 Correct 522 ms 118012 KB Output is correct
35 Correct 1 ms 316 KB Output is correct
36 Correct 380 ms 51468 KB Output is correct
37 Correct 1240 ms 179160 KB Output is correct
38 Correct 1205 ms 178420 KB Output is correct
39 Correct 1834 ms 176088 KB Output is correct
40 Correct 585 ms 80652 KB Output is correct
41 Correct 177 ms 39532 KB Output is correct
42 Correct 21 ms 8720 KB Output is correct
43 Correct 1437 ms 181456 KB Output is correct
44 Correct 2660 ms 171392 KB Output is correct
45 Correct 924 ms 168488 KB Output is correct
46 Correct 424 ms 134492 KB Output is correct
47 Correct 1268 ms 120148 KB Output is correct
48 Correct 466 ms 138204 KB Output is correct
49 Correct 461 ms 135648 KB Output is correct
50 Correct 1138 ms 114260 KB Output is correct
51 Correct 11 ms 3924 KB Output is correct
52 Correct 11 ms 3996 KB Output is correct
53 Correct 10 ms 3920 KB Output is correct
54 Correct 16 ms 5644 KB Output is correct
55 Correct 12 ms 4968 KB Output is correct
56 Correct 12 ms 4948 KB Output is correct
57 Correct 127 ms 29176 KB Output is correct
58 Correct 142 ms 29112 KB Output is correct
59 Correct 141 ms 29172 KB Output is correct
60 Correct 177 ms 41836 KB Output is correct
61 Correct 191 ms 43932 KB Output is correct
62 Correct 246 ms 46256 KB Output is correct
63 Correct 255 ms 8564 KB Output is correct
64 Correct 251 ms 8512 KB Output is correct
65 Correct 257 ms 8524 KB Output is correct
66 Correct 262 ms 9304 KB Output is correct
67 Correct 150 ms 37704 KB Output is correct
68 Correct 128 ms 36976 KB Output is correct
69 Correct 129 ms 37700 KB Output is correct
70 Correct 147 ms 37696 KB Output is correct
71 Correct 132 ms 36668 KB Output is correct
72 Correct 127 ms 37552 KB Output is correct
73 Correct 126 ms 36364 KB Output is correct
74 Correct 128 ms 37116 KB Output is correct
75 Correct 535 ms 120472 KB Output is correct
76 Correct 524 ms 120176 KB Output is correct
77 Correct 464 ms 120348 KB Output is correct
78 Correct 539 ms 120192 KB Output is correct
79 Correct 642 ms 120640 KB Output is correct
80 Correct 542 ms 120120 KB Output is correct
81 Correct 1077 ms 180000 KB Output is correct
82 Correct 894 ms 170920 KB Output is correct
83 Correct 903 ms 171208 KB Output is correct
84 Correct 1593 ms 195648 KB Output is correct
85 Correct 998 ms 176848 KB Output is correct
86 Correct 856 ms 169020 KB Output is correct
87 Execution timed out 3056 ms 210268 KB Time limit exceeded
88 Halted 0 ms 0 KB -