oj.uz

Submission #415071

# Submission time Handle Problem Language Result Execution time Memory
415071 2021-05-31T13:44:53 Z hhhhaura Circle selection (APIO18_circle_selection) C++14
100 / 100
 2311 ms 93160 KB 
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))

#define INF 1e9
#define MOD 1000000007
#define eps (1e-9)

#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

using namespace std;

#ifdef wiwihorz
#define print(a...) kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif
#define x first
#define y second
namespace solver {
	int n, r, c, w, ii;
	vector<unordered_set<int>> v;
	vector<pii> a;
	vector<int> vis, ord, rad;
	unordered_map<int, int> mp;
	void init_(int _n) {
		n = _n;
		a.assign(n + 1, {0, 0});
		rad.assign(n + 1, 0);
		vis.assign(n + 1, 0);
		ord.clear();
		mp.clear();
		rep(i, 1, n) ord.push_back(i);
	}
	bool cmp(int a, int b) {
		if(rad[a] != rad[b]) 
			return rad[a] > rad[b];
		else return a < b;
	}
	int get_id(pii a) {
		int xx = (a.x + INF)/ w;
		int yy = (a.y + INF)/ w;
		return xx * c + yy;
	}
	void reconstruct(int x) {
		w = x, ii = 0;
		r = ceil(2 * INF, w);
		c = ceil(2 * INF, w);
		v.assign(n + 1, unordered_set<int>());
		mp.clear();
		rep(i, 1, n) if(!vis[i]) {
			pii cur = a[i]; int id = get_id(cur);
			if(mp.find(id) == mp.end()) mp[id] = ++ii;
			v[mp[id]].insert(i);
		}
	}
	int dis2(pii a, pii b) {
		return (a.x - b.x) * (a.x - b.x) + 
			(a.y - b.y) * (a.y - b.y); 
	}
	void operate(int id, int x) {
		rep(xx, -2, 2) rep(yy, -2, 2) {
			int i = xx * c + id + yy;
			if(mp.find(i) == mp.end()) continue;
			int bk = mp[i];
			auto it = v[bk].begin();
			while(it != v[bk].end()) {
				if(dis2(a[*it], a[x]) <= 
					(rad[*it] + rad[x]) * (rad[*it] + rad[x])) {
					vis[*it] = x; 
					auto cur = it;  
					it = next(cur), v[bk].erase(cur);
				}
				else it = next(it);
			}	
		}
		return;
	}
	void solve() {
		sort(all(ord), cmp);
		reconstruct(rad[ord[0]]);
		for(auto i : ord) if(!vis[i]) { 
			if(rad[i] * 2 <= w) reconstruct(rad[i]);
			int id = get_id(a[i]); operate(id, i);
		}
		rep(i, 1, n) cout << vis[i] << " \n"[i == n]; 
	}
};
using namespace solver;
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n; cin >> n;
	init_(n);
	rep(i, 1, n) {
		cin >> a[i].x >> a[i].y;
		cin >> rad[i];
	}
	solve();
	return 0;
}

Compilation message

circle_selection.cpp:4: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    4 | #pragma loop-opt(on)
      | 
circle_selection.cpp:24:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   24 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
      |             ^~~~
circle_selection.cpp:24:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   24 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
      |                     ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 5 ms 972 KB Output is correct
20 Correct 6 ms 960 KB Output is correct
21 Correct 5 ms 972 KB Output is correct
22 Correct 13 ms 1728 KB Output is correct
23 Correct 15 ms 1668 KB Output is correct
24 Correct 15 ms 1708 KB Output is correct
25 Correct 13 ms 1612 KB Output is correct
26 Correct 12 ms 1612 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 42696 KB Output is correct
2 Correct 334 ms 42216 KB Output is correct
3 Correct 335 ms 43280 KB Output is correct
4 Correct 277 ms 41592 KB Output is correct
5 Correct 527 ms 43368 KB Output is correct
6 Correct 1113 ms 61996 KB Output is correct
7 Correct 491 ms 44612 KB Output is correct
8 Correct 583 ms 46680 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 686 ms 28808 KB Output is correct
3 Correct 2170 ms 84876 KB Output is correct
4 Correct 1791 ms 87692 KB Output is correct
5 Correct 1429 ms 78840 KB Output is correct
6 Correct 498 ms 41168 KB Output is correct
7 Correct 336 ms 22884 KB Output is correct
8 Correct 29 ms 5064 KB Output is correct
9 Correct 1940 ms 86620 KB Output is correct
10 Correct 1531 ms 77428 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1664 ms 84892 KB Output is correct
2 Correct 1516 ms 85056 KB Output is correct
3 Correct 543 ms 53072 KB Output is correct
4 Correct 1673 ms 92392 KB Output is correct
5 Correct 1309 ms 92452 KB Output is correct
6 Correct 558 ms 52196 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 5 ms 972 KB Output is correct
20 Correct 6 ms 960 KB Output is correct
21 Correct 5 ms 972 KB Output is correct
22 Correct 13 ms 1728 KB Output is correct
23 Correct 15 ms 1668 KB Output is correct
24 Correct 15 ms 1708 KB Output is correct
25 Correct 13 ms 1612 KB Output is correct
26 Correct 12 ms 1612 KB Output is correct
27 Correct 10 ms 1748 KB Output is correct
28 Correct 8 ms 1760 KB Output is correct
29 Correct 9 ms 1740 KB Output is correct
30 Correct 34 ms 3028 KB Output is correct
31 Correct 24 ms 3020 KB Output is correct
32 Correct 27 ms 3068 KB Output is correct
33 Correct 86 ms 14872 KB Output is correct
34 Correct 94 ms 14392 KB Output is correct
35 Correct 110 ms 14564 KB Output is correct
36 Correct 484 ms 28848 KB Output is correct
37 Correct 510 ms 28824 KB Output is correct
38 Correct 502 ms 28832 KB Output is correct
39 Correct 611 ms 27500 KB Output is correct
40 Correct 522 ms 27496 KB Output is correct
41 Correct 513 ms 27420 KB Output is correct
42 Correct 235 ms 28836 KB Output is correct
43 Correct 345 ms 28524 KB Output is correct
44 Correct 293 ms 28580 KB Output is correct
45 Correct 369 ms 28580 KB Output is correct
46 Correct 401 ms 28516 KB Output is correct
47 Correct 317 ms 28580 KB Output is correct
48 Correct 308 ms 28568 KB Output is correct
49 Correct 440 ms 28544 KB Output is correct
50 Correct 292 ms 28532 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 5 ms 972 KB Output is correct
20 Correct 6 ms 960 KB Output is correct
21 Correct 5 ms 972 KB Output is correct
22 Correct 13 ms 1728 KB Output is correct
23 Correct 15 ms 1668 KB Output is correct
24 Correct 15 ms 1708 KB Output is correct
25 Correct 13 ms 1612 KB Output is correct
26 Correct 12 ms 1612 KB Output is correct
27 Correct 308 ms 42696 KB Output is correct
28 Correct 334 ms 42216 KB Output is correct
29 Correct 335 ms 43280 KB Output is correct
30 Correct 277 ms 41592 KB Output is correct
31 Correct 527 ms 43368 KB Output is correct
32 Correct 1113 ms 61996 KB Output is correct
33 Correct 491 ms 44612 KB Output is correct
34 Correct 583 ms 46680 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 686 ms 28808 KB Output is correct
37 Correct 2170 ms 84876 KB Output is correct
38 Correct 1791 ms 87692 KB Output is correct
39 Correct 1429 ms 78840 KB Output is correct
40 Correct 498 ms 41168 KB Output is correct
41 Correct 336 ms 22884 KB Output is correct
42 Correct 29 ms 5064 KB Output is correct
43 Correct 1940 ms 86620 KB Output is correct
44 Correct 1531 ms 77428 KB Output is correct
45 Correct 1664 ms 84892 KB Output is correct
46 Correct 1516 ms 85056 KB Output is correct
47 Correct 543 ms 53072 KB Output is correct
48 Correct 1673 ms 92392 KB Output is correct
49 Correct 1309 ms 92452 KB Output is correct
50 Correct 558 ms 52196 KB Output is correct
51 Correct 10 ms 1748 KB Output is correct
52 Correct 8 ms 1760 KB Output is correct
53 Correct 9 ms 1740 KB Output is correct
54 Correct 34 ms 3028 KB Output is correct
55 Correct 24 ms 3020 KB Output is correct
56 Correct 27 ms 3068 KB Output is correct
57 Correct 86 ms 14872 KB Output is correct
58 Correct 94 ms 14392 KB Output is correct
59 Correct 110 ms 14564 KB Output is correct
60 Correct 484 ms 28848 KB Output is correct
61 Correct 510 ms 28824 KB Output is correct
62 Correct 502 ms 28832 KB Output is correct
63 Correct 611 ms 27500 KB Output is correct
64 Correct 522 ms 27496 KB Output is correct
65 Correct 513 ms 27420 KB Output is correct
66 Correct 235 ms 28836 KB Output is correct
67 Correct 345 ms 28524 KB Output is correct
68 Correct 293 ms 28580 KB Output is correct
69 Correct 369 ms 28580 KB Output is correct
70 Correct 401 ms 28516 KB Output is correct
71 Correct 317 ms 28580 KB Output is correct
72 Correct 308 ms 28568 KB Output is correct
73 Correct 440 ms 28544 KB Output is correct
74 Correct 292 ms 28532 KB Output is correct
75 Correct 446 ms 51584 KB Output is correct
76 Correct 329 ms 51544 KB Output is correct
77 Correct 260 ms 51568 KB Output is correct
78 Correct 308 ms 51508 KB Output is correct
79 Correct 531 ms 51236 KB Output is correct
80 Correct 378 ms 52768 KB Output is correct
81 Correct 1687 ms 92884 KB Output is correct
82 Correct 1546 ms 92700 KB Output is correct
83 Correct 1828 ms 92656 KB Output is correct
84 Correct 1873 ms 93160 KB Output is correct
85 Correct 1860 ms 92728 KB Output is correct
86 Correct 1610 ms 92884 KB Output is correct
87 Correct 1801 ms 92812 KB Output is correct
88 Correct 2269 ms 81972 KB Output is correct
89 Correct 2201 ms 81984 KB Output is correct
90 Correct 2099 ms 82056 KB Output is correct
91 Correct 2184 ms 82032 KB Output is correct
92 Correct 2311 ms 82100 KB Output is correct
93 Correct 1714 ms 91768 KB Output is correct
94 Correct 1529 ms 92044 KB Output is correct
95 Correct 1652 ms 91740 KB Output is correct
96 Correct 1679 ms 91728 KB Output is correct
97 Correct 1812 ms 91720 KB Output is correct
98 Correct 1159 ms 76512 KB Output is correct
99 Correct 1495 ms 91880 KB Output is correct
100 Correct 1394 ms 91676 KB Output is correct
101 Correct 1308 ms 83248 KB Output is correct
102 Correct 1499 ms 91192 KB Output is correct
103 Correct 1814 ms 91212 KB Output is correct
104 Correct 1661 ms 91692 KB Output is correct
105 Correct 979 ms 89436 KB Output is correct
106 Correct 1324 ms 89828 KB Output is correct
107 Correct 1287 ms 89964 KB Output is correct
108 Correct 1444 ms 89832 KB Output is correct
109 Correct 1464 ms 89828 KB Output is correct
110 Correct 1315 ms 89836 KB Output is correct
111 Correct 1385 ms 89740 KB Output is correct
112 Correct 1096 ms 89824 KB Output is correct
113 Correct 1313 ms 89972 KB Output is correct
114 Correct 1292 ms 89872 KB Output is correct
115 Correct 1425 ms 89872 KB Output is correct
116 Correct 1509 ms 89788 KB Output is correct