oj.uz

Submission #1071001

# Submission time Handle Problem Language Result Execution time Memory
1071001 2024-08-22T23:11:27 Z pawned Circle selection (APIO18_circle_selection) C++17
49 / 100
 3000 ms 90260 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<ll, ll> ii;
typedef vector<ll> vi;

const char nl = '\n';

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

bool intersect(ll x1, ll y1, ll x2, ll y2, ll r1, ll 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, ll>> cr(N);
	// {{x, y}, r}
	multiset<pair<ii, ii>> all;
	// {{r, -id}, {x, y}}
	map<ll, set<pair<ll, ii>>> allx;	// maps x coord to all {y, {r, id}}
	for (int i = 0; i < N; i++) {
		ll 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();
		ll r = (*it).fi.fi;
		int id = -(*it).fi.se;
		ll x = (*it).se.fi;
		ll 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
		auto it2 = allx.lower_bound(x - 2 * r);
		while (it2 != allx.end() && (*it2).fi <= x + 2 * r) {
			// do another search inside
			ll cx = (*it2).fi;
			vector<pair<ll, ii>> toremove;
			auto it3 = allx[cx].lower_bound({y - 2 * r, {-1, -1}});
			while (it3 != allx[cx].end() && (*it3).fi <= y + 2 * r) {
				ll cy = (*it3).fi;
				ll cr = (*it3).se.fi;
				int cid = (*it3).se.se;
				if (intersect(x, y, cx, cy, r, cr)) {
					toremove.pb(*it3);
				}
				it3++;
			}
			for (pair<ll, 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:63:9: warning: unused variable 'cid' [-Wunused-variable]
   63 |     int cid = (*it3).se.se;
      |         ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory 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 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 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 600 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 752 KB Output is correct
19 Correct 7 ms 1884 KB Output is correct
20 Correct 6 ms 1884 KB Output is correct
21 Correct 8 ms 1884 KB Output is correct
22 Correct 8 ms 1884 KB Output is correct
23 Correct 33 ms 1908 KB Output is correct
24 Correct 8 ms 1884 KB Output is correct
25 Correct 7 ms 1884 KB Output is correct
26 Correct 7 ms 1780 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 710 ms 82236 KB Output is correct
2 Correct 758 ms 88836 KB Output is correct
3 Correct 753 ms 88700 KB Output is correct
4 Correct 732 ms 89100 KB Output is correct
5 Correct 652 ms 77392 KB Output is correct
6 Correct 820 ms 86612 KB Output is correct
7 Correct 782 ms 85328 KB Output is correct
8 Correct 754 ms 85840 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 710 ms 30192 KB Output is correct
3 Correct 2767 ms 90196 KB Output is correct
4 Correct 2758 ms 90260 KB Output is correct
5 Execution timed out 3098 ms 86100 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1589 ms 82324 KB Output is correct
2 Correct 601 ms 82000 KB Output is correct
3 Execution timed out 3061 ms 80212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory 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 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 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 600 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 752 KB Output is correct
19 Correct 7 ms 1884 KB Output is correct
20 Correct 6 ms 1884 KB Output is correct
21 Correct 8 ms 1884 KB Output is correct
22 Correct 8 ms 1884 KB Output is correct
23 Correct 33 ms 1908 KB Output is correct
24 Correct 8 ms 1884 KB Output is correct
25 Correct 7 ms 1884 KB Output is correct
26 Correct 7 ms 1780 KB Output is correct
27 Correct 13 ms 3416 KB Output is correct
28 Correct 13 ms 3420 KB Output is correct
29 Correct 13 ms 3420 KB Output is correct
30 Correct 33 ms 3384 KB Output is correct
31 Correct 17 ms 3420 KB Output is correct
32 Correct 18 ms 3416 KB Output is correct
33 Correct 184 ms 30760 KB Output is correct
34 Correct 180 ms 30552 KB Output is correct
35 Correct 230 ms 30408 KB Output is correct
36 Correct 282 ms 30032 KB Output is correct
37 Correct 289 ms 30036 KB Output is correct
38 Correct 354 ms 30288 KB Output is correct
39 Correct 458 ms 19280 KB Output is correct
40 Correct 475 ms 19340 KB Output is correct
41 Correct 485 ms 19288 KB Output is correct
42 Correct 170 ms 19796 KB Output is correct
43 Correct 170 ms 30036 KB Output is correct
44 Correct 182 ms 30036 KB Output is correct
45 Correct 171 ms 30032 KB Output is correct
46 Correct 164 ms 30040 KB Output is correct
47 Correct 171 ms 30036 KB Output is correct
48 Correct 164 ms 30064 KB Output is correct
49 Correct 158 ms 30032 KB Output is correct
50 Correct 189 ms 30104 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory 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 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 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 600 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 752 KB Output is correct
19 Correct 7 ms 1884 KB Output is correct
20 Correct 6 ms 1884 KB Output is correct
21 Correct 8 ms 1884 KB Output is correct
22 Correct 8 ms 1884 KB Output is correct
23 Correct 33 ms 1908 KB Output is correct
24 Correct 8 ms 1884 KB Output is correct
25 Correct 7 ms 1884 KB Output is correct
26 Correct 7 ms 1780 KB Output is correct
27 Correct 710 ms 82236 KB Output is correct
28 Correct 758 ms 88836 KB Output is correct
29 Correct 753 ms 88700 KB Output is correct
30 Correct 732 ms 89100 KB Output is correct
31 Correct 652 ms 77392 KB Output is correct
32 Correct 820 ms 86612 KB Output is correct
33 Correct 782 ms 85328 KB Output is correct
34 Correct 754 ms 85840 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 710 ms 30192 KB Output is correct
37 Correct 2767 ms 90196 KB Output is correct
38 Correct 2758 ms 90260 KB Output is correct
39 Execution timed out 3098 ms 86100 KB Time limit exceeded
40 Halted 0 ms 0 KB -