oj.uz

Submission #794697

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

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

const int INF = 2020202020;
const int K = 7;

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, int lim) {
		auto it = T[idx].s.lower_bound({y, 0});
		for (int i = 0; i < K; i++) {
			if (it == T[idx].s.end() || it->first >= lim) 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, int lim) {
		p += base; p--;
		while (p >= 1) {
			chk_node(p, y, lim);
			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], Y[i] + R[i]);
		seg.get(XL[i], Y[i] + R[i], INF);
		seg.get(XR[i], Y[i] - R[i], Y[i] + R[i]);
		seg.get(XR[i], Y[i] + R[i], INF);
		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:106:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  106 |  for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
      |  ^~~
circle_selection.cpp:106:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  106 |  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 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 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 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 576 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 5 ms 2284 KB Output is correct
20 Correct 6 ms 2244 KB Output is correct
21 Correct 5 ms 2260 KB Output is correct
22 Correct 6 ms 2760 KB Output is correct
23 Correct 11 ms 3412 KB Output is correct
24 Correct 6 ms 2644 KB Output is correct
25 Correct 5 ms 2388 KB Output is correct
26 Correct 6 ms 2644 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 507 ms 112652 KB Output is correct
2 Correct 494 ms 112588 KB Output is correct
3 Correct 495 ms 112332 KB Output is correct
4 Correct 511 ms 112660 KB Output is correct
5 Correct 418 ms 63716 KB Output is correct
6 Correct 507 ms 122808 KB Output is correct
7 Correct 488 ms 115164 KB Output is correct
8 Correct 506 ms 117308 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 326 ms 51888 KB Output is correct
3 Correct 1212 ms 178292 KB Output is correct
4 Correct 1166 ms 177740 KB Output is correct
5 Correct 1683 ms 175564 KB Output is correct
6 Correct 526 ms 79924 KB Output is correct
7 Correct 165 ms 38792 KB Output is correct
8 Correct 19 ms 8700 KB Output is correct
9 Correct 1328 ms 180752 KB Output is correct
10 Correct 2296 ms 170724 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 788 ms 169392 KB Output is correct
2 Correct 406 ms 133712 KB Output is correct
3 Correct 1054 ms 119420 KB Output is correct
4 Correct 446 ms 137520 KB Output is correct
5 Correct 427 ms 134960 KB Output is correct
6 Correct 896 ms 113592 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 312 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 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 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 576 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 5 ms 2284 KB Output is correct
20 Correct 6 ms 2244 KB Output is correct
21 Correct 5 ms 2260 KB Output is correct
22 Correct 6 ms 2760 KB Output is correct
23 Correct 11 ms 3412 KB Output is correct
24 Correct 6 ms 2644 KB Output is correct
25 Correct 5 ms 2388 KB Output is correct
26 Correct 6 ms 2644 KB Output is correct
27 Correct 12 ms 4180 KB Output is correct
28 Correct 10 ms 4168 KB Output is correct
29 Correct 10 ms 4096 KB Output is correct
30 Correct 15 ms 5832 KB Output is correct
31 Correct 11 ms 5076 KB Output is correct
32 Correct 11 ms 4996 KB Output is correct
33 Correct 136 ms 29784 KB Output is correct
34 Correct 130 ms 29628 KB Output is correct
35 Correct 139 ms 29744 KB Output is correct
36 Correct 193 ms 42368 KB Output is correct
37 Correct 208 ms 43292 KB Output is correct
38 Correct 209 ms 45420 KB Output is correct
39 Correct 201 ms 7996 KB Output is correct
40 Correct 189 ms 8016 KB Output is correct
41 Correct 193 ms 7912 KB Output is correct
42 Correct 214 ms 8240 KB Output is correct
43 Correct 127 ms 37056 KB Output is correct
44 Correct 121 ms 36268 KB Output is correct
45 Correct 125 ms 36860 KB Output is correct
46 Correct 130 ms 36904 KB Output is correct
47 Correct 120 ms 35968 KB Output is correct
48 Correct 126 ms 36900 KB Output is correct
49 Correct 124 ms 35612 KB Output is correct
50 Correct 122 ms 36416 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 312 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 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 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 576 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 5 ms 2284 KB Output is correct
20 Correct 6 ms 2244 KB Output is correct
21 Correct 5 ms 2260 KB Output is correct
22 Correct 6 ms 2760 KB Output is correct
23 Correct 11 ms 3412 KB Output is correct
24 Correct 6 ms 2644 KB Output is correct
25 Correct 5 ms 2388 KB Output is correct
26 Correct 6 ms 2644 KB Output is correct
27 Correct 507 ms 112652 KB Output is correct
28 Correct 494 ms 112588 KB Output is correct
29 Correct 495 ms 112332 KB Output is correct
30 Correct 511 ms 112660 KB Output is correct
31 Correct 418 ms 63716 KB Output is correct
32 Correct 507 ms 122808 KB Output is correct
33 Correct 488 ms 115164 KB Output is correct
34 Correct 506 ms 117308 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 326 ms 51888 KB Output is correct
37 Correct 1212 ms 178292 KB Output is correct
38 Correct 1166 ms 177740 KB Output is correct
39 Correct 1683 ms 175564 KB Output is correct
40 Correct 526 ms 79924 KB Output is correct
41 Correct 165 ms 38792 KB Output is correct
42 Correct 19 ms 8700 KB Output is correct
43 Correct 1328 ms 180752 KB Output is correct
44 Correct 2296 ms 170724 KB Output is correct
45 Correct 788 ms 169392 KB Output is correct
46 Correct 406 ms 133712 KB Output is correct
47 Correct 1054 ms 119420 KB Output is correct
48 Correct 446 ms 137520 KB Output is correct
49 Correct 427 ms 134960 KB Output is correct
50 Correct 896 ms 113592 KB Output is correct
51 Correct 12 ms 4180 KB Output is correct
52 Correct 10 ms 4168 KB Output is correct
53 Correct 10 ms 4096 KB Output is correct
54 Correct 15 ms 5832 KB Output is correct
55 Correct 11 ms 5076 KB Output is correct
56 Correct 11 ms 4996 KB Output is correct
57 Correct 136 ms 29784 KB Output is correct
58 Correct 130 ms 29628 KB Output is correct
59 Correct 139 ms 29744 KB Output is correct
60 Correct 193 ms 42368 KB Output is correct
61 Correct 208 ms 43292 KB Output is correct
62 Correct 209 ms 45420 KB Output is correct
63 Correct 201 ms 7996 KB Output is correct
64 Correct 189 ms 8016 KB Output is correct
65 Correct 193 ms 7912 KB Output is correct
66 Correct 214 ms 8240 KB Output is correct
67 Correct 127 ms 37056 KB Output is correct
68 Correct 121 ms 36268 KB Output is correct
69 Correct 125 ms 36860 KB Output is correct
70 Correct 130 ms 36904 KB Output is correct
71 Correct 120 ms 35968 KB Output is correct
72 Correct 126 ms 36900 KB Output is correct
73 Correct 124 ms 35612 KB Output is correct
74 Correct 122 ms 36416 KB Output is correct
75 Correct 512 ms 118732 KB Output is correct
76 Correct 518 ms 118984 KB Output is correct
77 Correct 453 ms 119004 KB Output is correct
78 Correct 487 ms 118844 KB Output is correct
79 Correct 675 ms 119480 KB Output is correct
80 Correct 490 ms 118732 KB Output is correct
81 Correct 1025 ms 179596 KB Output is correct
82 Correct 886 ms 170584 KB Output is correct
83 Correct 880 ms 170944 KB Output is correct
84 Correct 1434 ms 194792 KB Output is correct
85 Correct 973 ms 176596 KB Output is correct
86 Correct 841 ms 168760 KB Output is correct
87 Execution timed out 3072 ms 219288 KB Time limit exceeded
88 Halted 0 ms 0 KB -