oj.uz

답안 #794708

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
794708 2023-07-26T19:37:12 Z dlalswp25 원 고르기 (APIO18_circle_selection) C++14
87 / 100
 3000 ms 207472 KB 
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>

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

const int INF = 2020202020;
const int K = 10;

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: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:74:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
circle_selection.cpp:77:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |   scanf("%d%d%d", &X[i], &Y[i], &R[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 0 ms 340 KB Output is correct
12 Correct 0 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 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 4 ms 2132 KB Output is correct
20 Correct 4 ms 2132 KB Output is correct
21 Correct 5 ms 2132 KB Output is correct
22 Correct 5 ms 2516 KB Output is correct
23 Correct 12 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

# 결과 실행 시간 메모리 Grader output
1 Correct 446 ms 111436 KB Output is correct
2 Correct 476 ms 111452 KB Output is correct
3 Correct 454 ms 111184 KB Output is correct
4 Correct 464 ms 111440 KB Output is correct
5 Correct 365 ms 63200 KB Output is correct
6 Correct 454 ms 122164 KB Output is correct
7 Correct 434 ms 113972 KB Output is correct
8 Correct 455 ms 116288 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 310 ms 51340 KB Output is correct
3 Correct 1062 ms 177300 KB Output is correct
4 Correct 1130 ms 176520 KB Output is correct
5 Correct 1652 ms 174328 KB Output is correct
6 Correct 525 ms 78856 KB Output is correct
7 Correct 178 ms 37772 KB Output is correct
8 Correct 18 ms 8240 KB Output is correct
9 Correct 1304 ms 179656 KB Output is correct
10 Correct 2506 ms 169528 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 767 ms 168216 KB Output is correct
2 Correct 390 ms 132780 KB Output is correct
3 Correct 1010 ms 118304 KB Output is correct
4 Correct 435 ms 136424 KB Output is correct
5 Correct 405 ms 133812 KB Output is correct
6 Correct 831 ms 112516 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 0 ms 340 KB Output is correct
12 Correct 0 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 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 4 ms 2132 KB Output is correct
20 Correct 4 ms 2132 KB Output is correct
21 Correct 5 ms 2132 KB Output is correct
22 Correct 5 ms 2516 KB Output is correct
23 Correct 12 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 3868 KB Output is correct
29 Correct 9 ms 3796 KB Output is correct
30 Correct 16 ms 5600 KB Output is correct
31 Correct 11 ms 4820 KB Output is correct
32 Correct 11 ms 4828 KB Output is correct
33 Correct 114 ms 29044 KB Output is correct
34 Correct 117 ms 29036 KB Output is correct
35 Correct 123 ms 28984 KB Output is correct
36 Correct 163 ms 41800 KB Output is correct
37 Correct 181 ms 42356 KB Output is correct
38 Correct 201 ms 44332 KB Output is correct
39 Correct 193 ms 7484 KB Output is correct
40 Correct 187 ms 7488 KB Output is correct
41 Correct 189 ms 7468 KB Output is correct
42 Correct 190 ms 7720 KB Output is correct
43 Correct 122 ms 35944 KB Output is correct
44 Correct 125 ms 35192 KB Output is correct
45 Correct 116 ms 35808 KB Output is correct
46 Correct 117 ms 35840 KB Output is correct
47 Correct 113 ms 34880 KB Output is correct
48 Correct 126 ms 35952 KB Output is correct
49 Correct 117 ms 34540 KB Output is correct
50 Correct 114 ms 35392 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 0 ms 340 KB Output is correct
12 Correct 0 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 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 4 ms 2132 KB Output is correct
20 Correct 4 ms 2132 KB Output is correct
21 Correct 5 ms 2132 KB Output is correct
22 Correct 5 ms 2516 KB Output is correct
23 Correct 12 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 446 ms 111436 KB Output is correct
28 Correct 476 ms 111452 KB Output is correct
29 Correct 454 ms 111184 KB Output is correct
30 Correct 464 ms 111440 KB Output is correct
31 Correct 365 ms 63200 KB Output is correct
32 Correct 454 ms 122164 KB Output is correct
33 Correct 434 ms 113972 KB Output is correct
34 Correct 455 ms 116288 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 310 ms 51340 KB Output is correct
37 Correct 1062 ms 177300 KB Output is correct
38 Correct 1130 ms 176520 KB Output is correct
39 Correct 1652 ms 174328 KB Output is correct
40 Correct 525 ms 78856 KB Output is correct
41 Correct 178 ms 37772 KB Output is correct
42 Correct 18 ms 8240 KB Output is correct
43 Correct 1304 ms 179656 KB Output is correct
44 Correct 2506 ms 169528 KB Output is correct
45 Correct 767 ms 168216 KB Output is correct
46 Correct 390 ms 132780 KB Output is correct
47 Correct 1010 ms 118304 KB Output is correct
48 Correct 435 ms 136424 KB Output is correct
49 Correct 405 ms 133812 KB Output is correct
50 Correct 831 ms 112516 KB Output is correct
51 Correct 9 ms 3796 KB Output is correct
52 Correct 9 ms 3868 KB Output is correct
53 Correct 9 ms 3796 KB Output is correct
54 Correct 16 ms 5600 KB Output is correct
55 Correct 11 ms 4820 KB Output is correct
56 Correct 11 ms 4828 KB Output is correct
57 Correct 114 ms 29044 KB Output is correct
58 Correct 117 ms 29036 KB Output is correct
59 Correct 123 ms 28984 KB Output is correct
60 Correct 163 ms 41800 KB Output is correct
61 Correct 181 ms 42356 KB Output is correct
62 Correct 201 ms 44332 KB Output is correct
63 Correct 193 ms 7484 KB Output is correct
64 Correct 187 ms 7488 KB Output is correct
65 Correct 189 ms 7468 KB Output is correct
66 Correct 190 ms 7720 KB Output is correct
67 Correct 122 ms 35944 KB Output is correct
68 Correct 125 ms 35192 KB Output is correct
69 Correct 116 ms 35808 KB Output is correct
70 Correct 117 ms 35840 KB Output is correct
71 Correct 113 ms 34880 KB Output is correct
72 Correct 126 ms 35952 KB Output is correct
73 Correct 117 ms 34540 KB Output is correct
74 Correct 114 ms 35392 KB Output is correct
75 Correct 454 ms 111188 KB Output is correct
76 Correct 441 ms 111440 KB Output is correct
77 Correct 406 ms 111384 KB Output is correct
78 Correct 429 ms 111160 KB Output is correct
79 Correct 517 ms 111924 KB Output is correct
80 Correct 438 ms 111156 KB Output is correct
81 Correct 1002 ms 172088 KB Output is correct
82 Correct 825 ms 162988 KB Output is correct
83 Correct 815 ms 163392 KB Output is correct
84 Correct 1404 ms 187376 KB Output is correct
85 Correct 883 ms 168996 KB Output is correct
86 Correct 755 ms 161092 KB Output is correct
87 Execution timed out 3076 ms 207472 KB Time limit exceeded
88 Halted 0 ms 0 KB -