oj.uz

답안 #514852

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
514852 2022-01-18T15:03:07 Z AugustinasJucas 원 고르기 (APIO18_circle_selection) C++14
37 / 100
 3000 ms 891436 KB 
#include <bits/stdc++.h>
using namespace std;
const long long inf = 2.1e9 + 1;
const long long dydis = (3e5+1);
int n, m, v, ind;
long long x, y, kur, R;
int dbInd = 0, mInd = 0;
vector<int> allX;
vector<int> l, r, ml, mr;
vector<long long> treeVals;
vector<vector<long long> > base;
vector<pair<pair<int, int>, pair<int, long long> > > 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]%dydis].push_back({v, i});
	}
}
int vec[4*21*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]/dydis << ", i=" << treeVals[i]%dydis << ")";
		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, long long down, long long up){
	if(L <= l[v] && r[v] <= R) {
		beg = lower_bound(treeVals.begin() + ml[v], treeVals.begin() + mr[v] + 1, 1ll * down * dydis) - treeVals.begin();
		for(int i = beg; i <= mr[v]; i++) {
			if(treeVals[i] / dydis > up) break;
			if(removed[i]) {
				i = rightmost[fP(i)];
				continue;
			}
			if(!selected[treeVals[i]%dydis]) {
				selected[treeVals[i]%dydis] = 1;
				selList[selInd++] = treeVals[i]%dydis;
			}
		}
		
	}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(4 * dydis);
	r.resize(4 * dydis);
	ml.resize(4 * dydis);
	mr.resize(4 * 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;
		y += inf;
		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(1ll*(y-R)*dydis + i);
		base[kur].push_back(1ll*(y+R)*dydis + i);
		
		kur = lower_bound(allX.begin(), allX.end(), x-R) - allX.begin();
		base[kur].push_back(1ll*(y-R)*dydis + i);
		base[kur].push_back(1ll*(y+R)*dydis + i);
	}
	
	for(auto &x : base) sort(x.begin(), x.end());
	
	build(1);
	long long 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;
		find(1, ll, rr, mas[i].second.second - mas[i].first.first, mas[i].second.second + mas[i].first.first);
		for(int j = 0; j < selInd; j++){
			selected[selList[j]] = 0;
			if(!kertasi(i, selList[j])) continue;
			remove(selList[j]);
			by[mas[selList[j]].first.second] = mas[i].first.second;
		}
	}
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 217 ms 519428 KB Output is correct
2 Correct 209 ms 519232 KB Output is correct
3 Correct 218 ms 519304 KB Output is correct
4 Correct 220 ms 519236 KB Output is correct
5 Correct 243 ms 519308 KB Output is correct
6 Correct 233 ms 519328 KB Output is correct
7 Correct 207 ms 519364 KB Output is correct
8 Correct 209 ms 519356 KB Output is correct
9 Correct 205 ms 519364 KB Output is correct
10 Correct 217 ms 519468 KB Output is correct
11 Correct 226 ms 519316 KB Output is correct
12 Correct 216 ms 519324 KB Output is correct
13 Correct 213 ms 519612 KB Output is correct
14 Correct 212 ms 519320 KB Output is correct
15 Correct 215 ms 519308 KB Output is correct
16 Correct 238 ms 520112 KB Output is correct
17 Correct 217 ms 520004 KB Output is correct
18 Correct 221 ms 520072 KB Output is correct
19 Correct 242 ms 523080 KB Output is correct
20 Correct 251 ms 523048 KB Output is correct
21 Correct 259 ms 523084 KB Output is correct
22 Correct 247 ms 522884 KB Output is correct
23 Correct 250 ms 522796 KB Output is correct
24 Correct 232 ms 522828 KB Output is correct
25 Correct 239 ms 522804 KB Output is correct
26 Correct 248 ms 522828 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3089 ms 891436 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 217 ms 519272 KB Output is correct
2 Correct 1271 ms 638504 KB Output is correct
3 Execution timed out 3062 ms 881488 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3134 ms 874424 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 217 ms 519428 KB Output is correct
2 Correct 209 ms 519232 KB Output is correct
3 Correct 218 ms 519304 KB Output is correct
4 Correct 220 ms 519236 KB Output is correct
5 Correct 243 ms 519308 KB Output is correct
6 Correct 233 ms 519328 KB Output is correct
7 Correct 207 ms 519364 KB Output is correct
8 Correct 209 ms 519356 KB Output is correct
9 Correct 205 ms 519364 KB Output is correct
10 Correct 217 ms 519468 KB Output is correct
11 Correct 226 ms 519316 KB Output is correct
12 Correct 216 ms 519324 KB Output is correct
13 Correct 213 ms 519612 KB Output is correct
14 Correct 212 ms 519320 KB Output is correct
15 Correct 215 ms 519308 KB Output is correct
16 Correct 238 ms 520112 KB Output is correct
17 Correct 217 ms 520004 KB Output is correct
18 Correct 221 ms 520072 KB Output is correct
19 Correct 242 ms 523080 KB Output is correct
20 Correct 251 ms 523048 KB Output is correct
21 Correct 259 ms 523084 KB Output is correct
22 Correct 247 ms 522884 KB Output is correct
23 Correct 250 ms 522796 KB Output is correct
24 Correct 232 ms 522828 KB Output is correct
25 Correct 239 ms 522804 KB Output is correct
26 Correct 248 ms 522828 KB Output is correct
27 Correct 301 ms 526820 KB Output is correct
28 Correct 259 ms 526724 KB Output is correct
29 Correct 263 ms 526704 KB Output is correct
30 Correct 273 ms 526448 KB Output is correct
31 Correct 298 ms 526348 KB Output is correct
32 Correct 290 ms 526360 KB Output is correct
33 Correct 1138 ms 647280 KB Output is correct
34 Correct 1203 ms 647088 KB Output is correct
35 Correct 1188 ms 646104 KB Output is correct
36 Correct 1230 ms 640816 KB Output is correct
37 Correct 1194 ms 640884 KB Output is correct
38 Correct 1218 ms 640924 KB Output is correct
39 Correct 878 ms 581596 KB Output is correct
40 Correct 884 ms 581648 KB Output is correct
41 Correct 868 ms 581632 KB Output is correct
42 Correct 952 ms 581648 KB Output is correct
43 Correct 1113 ms 640604 KB Output is correct
44 Correct 1107 ms 640504 KB Output is correct
45 Correct 1135 ms 640504 KB Output is correct
46 Correct 1072 ms 640552 KB Output is correct
47 Correct 1076 ms 640500 KB Output is correct
48 Correct 1086 ms 640680 KB Output is correct
49 Correct 1098 ms 640548 KB Output is correct
50 Correct 1105 ms 640596 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 217 ms 519428 KB Output is correct
2 Correct 209 ms 519232 KB Output is correct
3 Correct 218 ms 519304 KB Output is correct
4 Correct 220 ms 519236 KB Output is correct
5 Correct 243 ms 519308 KB Output is correct
6 Correct 233 ms 519328 KB Output is correct
7 Correct 207 ms 519364 KB Output is correct
8 Correct 209 ms 519356 KB Output is correct
9 Correct 205 ms 519364 KB Output is correct
10 Correct 217 ms 519468 KB Output is correct
11 Correct 226 ms 519316 KB Output is correct
12 Correct 216 ms 519324 KB Output is correct
13 Correct 213 ms 519612 KB Output is correct
14 Correct 212 ms 519320 KB Output is correct
15 Correct 215 ms 519308 KB Output is correct
16 Correct 238 ms 520112 KB Output is correct
17 Correct 217 ms 520004 KB Output is correct
18 Correct 221 ms 520072 KB Output is correct
19 Correct 242 ms 523080 KB Output is correct
20 Correct 251 ms 523048 KB Output is correct
21 Correct 259 ms 523084 KB Output is correct
22 Correct 247 ms 522884 KB Output is correct
23 Correct 250 ms 522796 KB Output is correct
24 Correct 232 ms 522828 KB Output is correct
25 Correct 239 ms 522804 KB Output is correct
26 Correct 248 ms 522828 KB Output is correct
27 Execution timed out 3089 ms 891436 KB Time limit exceeded
28 Halted 0 ms 0 KB -