oj.uz

답안 #1071003

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071003 2024-08-22T23:17:30 Z pawned 원 고르기 (APIO18_circle_selection) C++17
49 / 100
 3000 ms 72964 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;

const char nl = '\n';

void fastIO() {
	ios::sync_with_stdio(false);
	cin.tie(0);
}

bool intersect(int x1, int y1, int x2, int y2, int r1, int r2) {
	ll dx = abs(x1 - x2);
	ll dy = abs(y1 - y2);
	ll dt = r1 + r2;
	if (dt * dt >= dx * dx + dy * dy)
		return true;
	return false;
}

int main() {
	fastIO();
	int N;
	cin>>N;
	vector<pair<ii, int>> cr(N);
	// {{x, y}, r}
	set<pair<ii, ii>> all;
	// {{r, -id}, {x, y}}
	map<int, set<pair<int, ii>>> allx;	// maps x coord to all {y, {r, id}}
	for (int i = 0; i < N; i++) {
		int x, y, r;
		cin>>x>>y>>r;
		all.insert({{r, -i}, {x, y}});
		allx[x].insert({y, {r, i}});
	}
	vi par(N, -1);
	int rem = N;
	while (rem > 0) {
		auto it = --all.end();
		int r = (*it).fi.fi;
		int id = -(*it).fi.se;
		int x = (*it).se.fi;
		int y = (*it).se.se;
//		cout<<"at "<<id<<endl;
		// consider all from x in x-2r to x+2r, y in y-2r to r+2r
		int xl = max((ll)(x) - 2 * (ll)(r), (ll)(-2e9));
		int xh = min((ll)(x) + 2 * (ll)(r), (ll)(2e9));
		auto it2 = allx.lower_bound(xl);
		while (it2 != allx.end() && (*it2).fi <= xh) {
			// do another search inside
			int cx = (*it2).fi;
			vector<pair<ll, ii>> toremove;
			int yl = max((ll)(y) - 2 * (ll)(r), (ll)(-2e9));
			int yh = min((ll)(y) + 2 * (ll)(r), (ll)(2e9));
			auto it3 = allx[cx].lower_bound({yl, {-1, -1}});
			while (it3 != allx[cx].end() && (*it3).fi <= yh) {
				int cy = (*it3).fi;
				int cr = (*it3).se.fi;
				int cid = (*it3).se.se;
				if (intersect(x, y, cx, cy, r, cr)) {
					toremove.pb(*it3);
				}
				it3++;
			}
			for (pair<int, ii> p : toremove) {
				par[p.se.se] = id;
//				cout<<"erased "<<p.se.se<<endl;
				allx[cx].erase(p);
				all.erase({{p.se.fi, -p.se.se}, {cx, p.fi}});
				rem--;
			}
			it2++;
		}
	}
//	cout<<"ANSWER: ";
	for (int x : par)
		cout<<(x + 1)<<" ";
	cout<<endl;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:67:9: warning: unused variable 'cid' [-Wunused-variable]
   67 |     int cid = (*it3).se.se;
      |         ^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 5 ms 1628 KB Output is correct
20 Correct 5 ms 1628 KB Output is correct
21 Correct 7 ms 1628 KB Output is correct
22 Correct 8 ms 1636 KB Output is correct
23 Correct 32 ms 1624 KB Output is correct
24 Correct 7 ms 1628 KB Output is correct
25 Correct 6 ms 1628 KB Output is correct
26 Correct 7 ms 1628 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 657 ms 72964 KB Output is correct
2 Correct 689 ms 72936 KB Output is correct
3 Correct 700 ms 72560 KB Output is correct
4 Correct 645 ms 72788 KB Output is correct
5 Correct 644 ms 63568 KB Output is correct
6 Correct 737 ms 72440 KB Output is correct
7 Correct 738 ms 70996 KB Output is correct
8 Correct 752 ms 71764 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 691 ms 24440 KB Output is correct
3 Correct 2654 ms 72684 KB Output is correct
4 Correct 2544 ms 72784 KB Output is correct
5 Execution timed out 3037 ms 68944 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1572 ms 72788 KB Output is correct
2 Correct 596 ms 72788 KB Output is correct
3 Execution timed out 3054 ms 70736 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 5 ms 1628 KB Output is correct
20 Correct 5 ms 1628 KB Output is correct
21 Correct 7 ms 1628 KB Output is correct
22 Correct 8 ms 1636 KB Output is correct
23 Correct 32 ms 1624 KB Output is correct
24 Correct 7 ms 1628 KB Output is correct
25 Correct 6 ms 1628 KB Output is correct
26 Correct 7 ms 1628 KB Output is correct
27 Correct 13 ms 2652 KB Output is correct
28 Correct 11 ms 2724 KB Output is correct
29 Correct 11 ms 2808 KB Output is correct
30 Correct 32 ms 2648 KB Output is correct
31 Correct 17 ms 2648 KB Output is correct
32 Correct 16 ms 2652 KB Output is correct
33 Correct 161 ms 24464 KB Output is correct
34 Correct 163 ms 24404 KB Output is correct
35 Correct 212 ms 24532 KB Output is correct
36 Correct 285 ms 24400 KB Output is correct
37 Correct 276 ms 24400 KB Output is correct
38 Correct 340 ms 24400 KB Output is correct
39 Correct 451 ms 14932 KB Output is correct
40 Correct 458 ms 15184 KB Output is correct
41 Correct 458 ms 14932 KB Output is correct
42 Correct 163 ms 15340 KB Output is correct
43 Correct 161 ms 24440 KB Output is correct
44 Correct 167 ms 24400 KB Output is correct
45 Correct 155 ms 24404 KB Output is correct
46 Correct 161 ms 24404 KB Output is correct
47 Correct 158 ms 24524 KB Output is correct
48 Correct 164 ms 24404 KB Output is correct
49 Correct 174 ms 24528 KB Output is correct
50 Correct 160 ms 24404 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 5 ms 1628 KB Output is correct
20 Correct 5 ms 1628 KB Output is correct
21 Correct 7 ms 1628 KB Output is correct
22 Correct 8 ms 1636 KB Output is correct
23 Correct 32 ms 1624 KB Output is correct
24 Correct 7 ms 1628 KB Output is correct
25 Correct 6 ms 1628 KB Output is correct
26 Correct 7 ms 1628 KB Output is correct
27 Correct 657 ms 72964 KB Output is correct
28 Correct 689 ms 72936 KB Output is correct
29 Correct 700 ms 72560 KB Output is correct
30 Correct 645 ms 72788 KB Output is correct
31 Correct 644 ms 63568 KB Output is correct
32 Correct 737 ms 72440 KB Output is correct
33 Correct 738 ms 70996 KB Output is correct
34 Correct 752 ms 71764 KB Output is correct
35 Correct 0 ms 600 KB Output is correct
36 Correct 691 ms 24440 KB Output is correct
37 Correct 2654 ms 72684 KB Output is correct
38 Correct 2544 ms 72784 KB Output is correct
39 Execution timed out 3037 ms 68944 KB Time limit exceeded
40 Halted 0 ms 0 KB -