oj.uz

Submission #514784

# Submission time Handle Problem Language Result Execution time Memory
514784 2022-01-18T13:20:47 Z AugustinasJucas Circle selection (APIO18_circle_selection) C++14
37 / 100
 1913 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int dydis = (4e5+1);
int n, m, v, ind;
int x, y, kur, R;
int dbInd = 0, mInd = 0;
vector<int> allX;
vector<int> l, r, ml, mr;
vector<pair<int, int> > treeVals;
vector<vector<pair<int, int> > > base;
vector<pair<pair<int, int>, pair<int, int> > > mas;
bitset<dydis> circleRemoved;
bitset<(4 * 21 * dydis)> removed;
vector<pair<int, int> > kurYra[dydis];
vector<int> rightmost;
vector<int> sz;
vector<int> tevas;
int by[dydis];
vector<int> unique(vector<int> &a) {
	vector<int> ret;
	sort(a.begin(), a.end());
	for(auto &x : a){
		if(ret.size() == 0 || ret.back() != x) ret.push_back(x); 
	}
	return ret;
}
int m1, m2;
void build(int v) {
	if(v >= m){
		l[v] = r[v] = dbInd++;
		ml[v] = mInd;
		for(auto x : base[l[v]]) {
			treeVals[mInd++] = x;
		}
		mr[v] = mInd-1;
	}else {
		build(v*2);
		build(v*2+1);
		
		l[v] = l[v*2];
		r[v] = r[v*2+1];
		ml[v] = mInd;
		
		m1 = ml[v*2];
		m2 = ml[v*2+1];
		while(true) {
			if(m1 == mr[v*2]+1 && m2 == mr[v*2+1]+1) break;
			if(m1 == mr[v*2]+1) {
				treeVals[mInd++] = treeVals[m2++];
			}else if(m2 == mr[v*2+1]+1){
				treeVals[mInd++] = treeVals[m1++];
			}else if(treeVals[m1] <= treeVals[m2]){
				treeVals[mInd++] = treeVals[m1++];
			}else {
				treeVals[mInd++] = treeVals[m2++];
			}
		}
		mr[v] = mInd-1;
	}
	for(int i = ml[v]; i <= mr[v]; i++) {
		kurYra[treeVals[i].second].push_back({v, i});
	}
}
int vec[dydis]; 
int id = 0, ret;
int fP(int v) {
	id = 0;
	while(true) {
		vec[id++] = v;
		ret = v;
		if(tevas[v] == v) break;
		v = tevas[v];
	}
	for(int i = 0; i < id; i++) tevas[vec[i]] = ret;
	return ret;
}
void conn(int a, int b) {
	a = fP(a);
	b = fP(b);
	if(sz[a] < sz[b]) swap(a, b); 
	tevas[b] = a;
	sz[a] += sz[b];
	rightmost[a] = max(rightmost[a], rightmost[b]);
}
void remove(int ind){
	if(circleRemoved[ind]) return ;
	circleRemoved[ind] = 1;
	int i;
	for(auto &x : kurYra[ind]) {
		v = x.first;
		i = x.second;
		removed[i] = 1;
		if(i-1 >= ml[v] && removed[i-1]) {
			conn(i-1, i);
		}
		if(i+1 <= mr[v] && removed[i+1]) {
			conn(i+1, i);
		}
	}
}

void print(int v) {
	if(v < m){
		print(v*2);
		print(v*2+1);
	}
	cout << "v = " << v << ", [" << l[v] << "; " << r[v] << "], atitinkamas masyvas: ["; 
	for(int i = ml[v]; i <= mr[v]; i++) {
		if(removed[i]) continue;
		cout << "(y=" << treeVals[i].first << ", i=" << treeVals[i].second << ")";
		if(i != mr[v]) cout << ", ";
	}
	cout << "]\n";
}
long long X1, Y1, R1, X2, Y2, R2;
bool kertasi (int i, int j) {
	X1 = mas[i].second.first; Y1 = mas[i].second.second; R1 = mas[i].first.first;
	X2 = mas[j].second.first; Y2 = mas[j].second.second; R2 = mas[j].first.first;
	return (X1 - X2) * (X1 - X2) + (Y1 - Y2) * (Y1 - Y2) <= (R1 + R2) * (R1 + R2);
}
int beg;
bitset<dydis> selected;
int selList[dydis];
int selInd = 0;
void find(int v, int L, int R, int down, int up){
	if(L <= l[v] && r[v] <= R) {
		beg = lower_bound(treeVals.begin() + ml[v], treeVals.begin() + mr[v] + 1, make_pair(down, -inf)) - treeVals.begin();
		for(int i = beg; i <= mr[v]; i++) {
			if(treeVals[i].first > up) break;
			if(removed[i]) {
				i = rightmost[fP(i)];
				continue;
			}
			if(!selected[treeVals[i].second]) {
				selected[treeVals[i].second] = 1;
				selList[selInd++] = treeVals[i].second;
			}
		}
		
	}else if(r[v] < L || R < l[v]) {
		
	}else{
		find(v*2, L, R, down, up);
		find(v*2+1, L, R, down, up);
	}
}
int main(){
	cin.tie(NULL);
	ios_base::sync_with_stdio(false);
	treeVals.resize(4 * 21 * dydis);
	l.resize(2 * dydis);
	r.resize(2 * dydis);
	ml.resize(2 * dydis);
	mr.resize(2 * dydis);
	rightmost.resize(4 * 21 * dydis);
	sz.resize(4 * 21 * dydis);
	tevas.resize(4 * 21 * dydis);
	for(int i = 0; i < (int) tevas.size(); i++) {
		tevas[i] = i;
		sz[i] = 1;
		rightmost[i] = i;
	}
	cin >> n;
	for(int i = 0; i < n; i++) {
		cin >> x >> y >> R;
		mas.push_back({{R, -i}, {x, y}});
	}
		
	sort(mas.begin(), mas.end());
	reverse(mas.begin(), mas.end());
	for(auto &x : mas) x.first.second *= -1;
	
	for(int i = 0; i < n; i++) {
		allX.push_back(mas[i].second.first-mas[i].first.first);
		allX.push_back(mas[i].second.first+mas[i].first.first);
	}
	allX = unique(allX);
	base.resize(allX.size());
	m = allX.size();
	
	for(int i = 0; i < n; i++) {
		x = mas[i].second.first;
		y = mas[i].second.second;
		R = mas[i].first.first;
		
		kur = lower_bound(allX.begin(), allX.end(), x+R) - allX.begin();
		base[kur].push_back({y-R, i});
		base[kur].push_back({y+R, i});
		
		kur = lower_bound(allX.begin(), allX.end(), x-R) - allX.begin();
		base[kur].push_back({y-R, i});
		base[kur].push_back({y+R, i});
	}
	
	for(auto &x : base) sort(x.begin(), x.end());
	
	build(1);
	//cout << "po buildo" << endl;
	//cout << "mas:\n";
	//for(int i = 0; i < n; i++) {
	//	auto &x = mas[i];
	//	cout <<i << ". "  << "(" << x.second.first << ", " << x.second.second << "), r = " << x.first.first << endl;
	//}
	//cout << endl;
	
	//cout << "x-ai:\n";
	//for(int i = 0; i < m; i++) {
	//	cout << i << ". " << allX[i] << endl;
	//}
	//cout << endl;
	
	//print(1);
	
	//cout << endl;
	
	int L, R, ll, rr;
	for(int i = 0; i < n; i++) {
		if(circleRemoved[i]) continue;
		L = mas[i].second.first - mas[i].first.first;
		R = mas[i].second.first + mas[i].first.first;
		ll = lower_bound(allX.begin(), allX.end(), L) - allX.begin();
		rr = lower_bound(allX.begin(), allX.end(), R) - allX.begin();
		selInd = 0;
		//cout << "Ieskau kvadratu, kurie kertasi su " << mas[i].first.second << "-uoju. ";
		find(1, ll, rr, mas[i].second.second - mas[i].first.first, mas[i].second.second + mas[i].first.first);
		//cout << "radau ";
		for(int j = 0; j < selInd; j++){
			selected[selList[j]] = 0;
			if(!kertasi(i, selList[j])) continue;
			//cout << mas[selList[j]].first.second << " ";
			remove(selList[j]);
			by[mas[selList[j]].first.second] = mas[i].first.second;
		}
		//cout << endl;
	}
	
	//cout << endl << endl << "ats: \n";
	for(int i = 0; i < n; i++) {
		cout << by[i] + 1 << " ";
	}
	
	
	return 0;
}
/*
5
0 0 3
5 -2 2
5 0 1
1 1 1
1 -3 1

 11
9 9 2
13 2 1
11 8 2
3 3 2
3 12 1
12 14 1
9 8 5
2 8 2
5 2 1
14 4 2
14 14 1 
 
 

*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 336 ms 679804 KB Output is correct
2 Correct 316 ms 679704 KB Output is correct
3 Correct 366 ms 679736 KB Output is correct
4 Correct 359 ms 679748 KB Output is correct
5 Correct 358 ms 679780 KB Output is correct
6 Correct 343 ms 679800 KB Output is correct
7 Correct 381 ms 679796 KB Output is correct
8 Correct 376 ms 679828 KB Output is correct
9 Correct 371 ms 679792 KB Output is correct
10 Correct 379 ms 679800 KB Output is correct
11 Correct 357 ms 679788 KB Output is correct
12 Correct 343 ms 679800 KB Output is correct
13 Correct 336 ms 679796 KB Output is correct
14 Correct 327 ms 679792 KB Output is correct
15 Correct 366 ms 679864 KB Output is correct
16 Correct 333 ms 680576 KB Output is correct
17 Correct 318 ms 680536 KB Output is correct
18 Correct 323 ms 680456 KB Output is correct
19 Correct 367 ms 683480 KB Output is correct
20 Correct 327 ms 683560 KB Output is correct
21 Correct 357 ms 683532 KB Output is correct
22 Correct 348 ms 683260 KB Output is correct
23 Correct 342 ms 683328 KB Output is correct
24 Correct 334 ms 683332 KB Output is correct
25 Correct 331 ms 683348 KB Output is correct
26 Correct 344 ms 683220 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 1821 ms 1048576 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 345 ms 679760 KB Output is correct
2 Correct 1394 ms 800916 KB Output is correct
3 Runtime error 1674 ms 1048576 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 1633 ms 1048576 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 401 ms 687260 KB Output is correct
2 Correct 382 ms 687196 KB Output is correct
3 Correct 399 ms 687188 KB Output is correct
4 Correct 396 ms 686768 KB Output is correct
5 Correct 425 ms 686772 KB Output is correct
6 Correct 453 ms 686696 KB Output is correct
7 Correct 1233 ms 806608 KB Output is correct
8 Correct 1277 ms 806456 KB Output is correct
9 Correct 1365 ms 805596 KB Output is correct
10 Correct 1306 ms 800468 KB Output is correct
11 Correct 1301 ms 800592 KB Output is correct
12 Correct 1333 ms 800620 KB Output is correct
13 Correct 999 ms 741308 KB Output is correct
14 Correct 1055 ms 741308 KB Output is correct
15 Correct 969 ms 741296 KB Output is correct
16 Correct 1018 ms 741340 KB Output is correct
17 Correct 1191 ms 800264 KB Output is correct
18 Correct 1207 ms 800164 KB Output is correct
19 Correct 1201 ms 800172 KB Output is correct
20 Correct 1226 ms 800408 KB Output is correct
21 Correct 1266 ms 800228 KB Output is correct
22 Correct 1337 ms 800124 KB Output is correct
23 Correct 1297 ms 799884 KB Output is correct
24 Correct 1356 ms 799984 KB Output is correct
25 Correct 336 ms 679804 KB Output is correct
26 Correct 316 ms 679704 KB Output is correct
27 Correct 366 ms 679736 KB Output is correct
28 Correct 359 ms 679748 KB Output is correct
29 Correct 358 ms 679780 KB Output is correct
30 Correct 343 ms 679800 KB Output is correct
31 Correct 381 ms 679796 KB Output is correct
32 Correct 376 ms 679828 KB Output is correct
33 Correct 371 ms 679792 KB Output is correct
34 Correct 379 ms 679800 KB Output is correct
35 Correct 357 ms 679788 KB Output is correct
36 Correct 343 ms 679800 KB Output is correct
37 Correct 336 ms 679796 KB Output is correct
38 Correct 327 ms 679792 KB Output is correct
39 Correct 366 ms 679864 KB Output is correct
40 Correct 333 ms 680576 KB Output is correct
41 Correct 318 ms 680536 KB Output is correct
42 Correct 323 ms 680456 KB Output is correct
43 Correct 367 ms 683480 KB Output is correct
44 Correct 327 ms 683560 KB Output is correct
45 Correct 357 ms 683532 KB Output is correct
46 Correct 348 ms 683260 KB Output is correct
47 Correct 342 ms 683328 KB Output is correct
48 Correct 334 ms 683332 KB Output is correct
49 Correct 331 ms 683348 KB Output is correct
50 Correct 344 ms 683220 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1913 ms 1048576 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -