oj.uz

Submission #851259

# Submission time Handle Problem Language Result Execution time Memory
851259 2023-09-19T08:08:35 Z dlalswp25 Circle selection (APIO18_circle_selection) C++17
87 / 100
 1475 ms 189496 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});
		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 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 3 ms 6744 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 10 ms 9560 KB Output is correct
24 Correct 6 ms 8792 KB Output is correct
25 Correct 6 ms 8536 KB Output is correct
26 Correct 5 ms 8792 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 384 ms 118420 KB Output is correct
2 Correct 390 ms 118456 KB Output is correct
3 Correct 390 ms 119576 KB Output is correct
4 Correct 410 ms 118936 KB Output is correct
5 Correct 354 ms 69652 KB Output is correct
6 Correct 415 ms 128256 KB Output is correct
7 Correct 389 ms 118812 KB Output is correct
8 Correct 409 ms 121268 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 238 ms 58052 KB Output is correct
3 Correct 957 ms 186056 KB Output is correct
4 Correct 941 ms 184932 KB Output is correct
5 Correct 1164 ms 182776 KB Output is correct
6 Correct 392 ms 86204 KB Output is correct
7 Correct 132 ms 44436 KB Output is correct
8 Correct 18 ms 14548 KB Output is correct
9 Correct 1090 ms 189496 KB Output is correct
10 Correct 1475 ms 178452 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 675 ms 177016 KB Output is correct
2 Correct 334 ms 140056 KB Output is correct
3 Correct 608 ms 127580 KB Output is correct
4 Correct 363 ms 144560 KB Output is correct
5 Correct 347 ms 141748 KB Output is correct
6 Correct 525 ms 121160 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 3 ms 6744 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 10 ms 9560 KB Output is correct
24 Correct 6 ms 8792 KB Output is correct
25 Correct 6 ms 8536 KB Output is correct
26 Correct 5 ms 8792 KB Output is correct
27 Correct 12 ms 10072 KB Output is correct
28 Correct 9 ms 10072 KB Output is correct
29 Correct 9 ms 10072 KB Output is correct
30 Correct 13 ms 11864 KB Output is correct
31 Correct 10 ms 11096 KB Output is correct
32 Correct 10 ms 11096 KB Output is correct
33 Correct 97 ms 36216 KB Output is correct
34 Correct 111 ms 36172 KB Output is correct
35 Correct 119 ms 36036 KB Output is correct
36 Correct 159 ms 48324 KB Output is correct
37 Correct 164 ms 48916 KB Output is correct
38 Correct 166 ms 51140 KB Output is correct
39 Correct 119 ms 12648 KB Output is correct
40 Correct 117 ms 12484 KB Output is correct
41 Correct 117 ms 12456 KB Output is correct
42 Correct 131 ms 13508 KB Output is correct
43 Correct 100 ms 42692 KB Output is correct
44 Correct 101 ms 41920 KB Output is correct
45 Correct 107 ms 42628 KB Output is correct
46 Correct 102 ms 42328 KB Output is correct
47 Correct 98 ms 41664 KB Output is correct
48 Correct 100 ms 42440 KB Output is correct
49 Correct 100 ms 41088 KB Output is correct
50 Correct 105 ms 41864 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 3 ms 6744 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 5 ms 8280 KB Output is correct
20 Correct 5 ms 8280 KB Output is correct
21 Correct 5 ms 8280 KB Output is correct
22 Correct 6 ms 8792 KB Output is correct
23 Correct 10 ms 9560 KB Output is correct
24 Correct 6 ms 8792 KB Output is correct
25 Correct 6 ms 8536 KB Output is correct
26 Correct 5 ms 8792 KB Output is correct
27 Correct 384 ms 118420 KB Output is correct
28 Correct 390 ms 118456 KB Output is correct
29 Correct 390 ms 119576 KB Output is correct
30 Correct 410 ms 118936 KB Output is correct
31 Correct 354 ms 69652 KB Output is correct
32 Correct 415 ms 128256 KB Output is correct
33 Correct 389 ms 118812 KB Output is correct
34 Correct 409 ms 121268 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 238 ms 58052 KB Output is correct
37 Correct 957 ms 186056 KB Output is correct
38 Correct 941 ms 184932 KB Output is correct
39 Correct 1164 ms 182776 KB Output is correct
40 Correct 392 ms 86204 KB Output is correct
41 Correct 132 ms 44436 KB Output is correct
42 Correct 18 ms 14548 KB Output is correct
43 Correct 1090 ms 189496 KB Output is correct
44 Correct 1475 ms 178452 KB Output is correct
45 Correct 675 ms 177016 KB Output is correct
46 Correct 334 ms 140056 KB Output is correct
47 Correct 608 ms 127580 KB Output is correct
48 Correct 363 ms 144560 KB Output is correct
49 Correct 347 ms 141748 KB Output is correct
50 Correct 525 ms 121160 KB Output is correct
51 Correct 12 ms 10072 KB Output is correct
52 Correct 9 ms 10072 KB Output is correct
53 Correct 9 ms 10072 KB Output is correct
54 Correct 13 ms 11864 KB Output is correct
55 Correct 10 ms 11096 KB Output is correct
56 Correct 10 ms 11096 KB Output is correct
57 Correct 97 ms 36216 KB Output is correct
58 Correct 111 ms 36172 KB Output is correct
59 Correct 119 ms 36036 KB Output is correct
60 Correct 159 ms 48324 KB Output is correct
61 Correct 164 ms 48916 KB Output is correct
62 Correct 166 ms 51140 KB Output is correct
63 Correct 119 ms 12648 KB Output is correct
64 Correct 117 ms 12484 KB Output is correct
65 Correct 117 ms 12456 KB Output is correct
66 Correct 131 ms 13508 KB Output is correct
67 Correct 100 ms 42692 KB Output is correct
68 Correct 101 ms 41920 KB Output is correct
69 Correct 107 ms 42628 KB Output is correct
70 Correct 102 ms 42328 KB Output is correct
71 Correct 98 ms 41664 KB Output is correct
72 Correct 100 ms 42440 KB Output is correct
73 Correct 100 ms 41088 KB Output is correct
74 Correct 105 ms 41864 KB Output is correct
75 Correct 503 ms 122060 KB Output is correct
76 Correct 402 ms 120500 KB Output is correct
77 Correct 366 ms 121268 KB Output is correct
78 Correct 381 ms 121500 KB Output is correct
79 Incorrect 440 ms 121012 KB Output isn't correct
80 Halted 0 ms 0 KB -