oj.uz

답안 #258964

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
258964 2020-08-06T22:02:05 Z amoo_safar 원 고르기 (APIO18_circle_selection) C++17
7 / 100
 3000 ms 19300 KB 
// Null
#include <bits/stdc++.h>
 
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll Mod = 1000000007LL;
const int N = 3e5 + 10;
const int Inf = 2e9;

int n, x[N], y[N], r[N];
int mk[N];

vector<pii> V[N];
vector<int> U;

void Build(int L){
	for(int i = 0; i < (int) U.size(); i++) V[i].clear();
	U.clear();

	for(int i = 1; i <= n; i++){
		if(mk[i]) continue;
		U.pb(x[i] / L);
	}
	sort(all(U)); U.resize(unique(all(U)) - U.begin() );
	for(int i = 1; i <= n; i++){
		V[lower_bound(all(U), x[i] / L) - U.begin()].pb({y[i] / L, i});
	}
	for(int i = 0; i < (int) U.size(); i++)
		sort(all(V[i]));
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> x[i] >> y[i] >> r[i];
	}
	vector<int> I(n); iota(all(I), 1);
	sort(all(I), [&](int i, int j){
		return (r[i] == r[j] ? i < j : r[i] > r[j]);
	});
	int L = 1 << 31;
	Build(L);
	for(auto id : I){
		if(mk[id]) continue;
		if(L >= r[id] + r[id]) Build(L = r[id]);
		
		int i = x[id] / L;
		int j = y[id] / L;

		int nei;
		for(int pos = lower_bound(all(U), i - 2) - U.begin(); pos < (int) U.size() && U[pos] <= i + 2; pos ++){

			for(int posj = lower_bound(all(V[pos]), pii(j - 2, -1)) - V[pos].begin(); posj < (int) V[pos].size() && V[pos][posj].F <= j + 2; posj ++){
				nei = V[pos][posj].S;
				if(mk[nei]) continue;
				if(1ll*(x[id] - x[nei])*(x[id] - x[nei]) + 1ll*(y[id] - y[nei])*(y[id] - y[nei]) <= 1ll*(r[id] + r[nei])*(r[id] + r[nei]) ){
					mk[nei] = id;
				}
			}
		}
	}
	
	for(int i = 1; i <= n; i++) cout << mk[i] << ' ';
	cout << '\n';
	return 0;
}
/*
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 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 4 ms 7424 KB Output is correct
10 Correct 4 ms 7424 KB Output is correct
11 Correct 4 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 5 ms 7424 KB Output is correct
14 Correct 4 ms 7424 KB Output is correct
15 Correct 5 ms 7552 KB Output is correct
16 Correct 5 ms 7424 KB Output is correct
17 Correct 6 ms 7424 KB Output is correct
18 Correct 5 ms 7424 KB Output is correct
19 Correct 7 ms 7680 KB Output is correct
20 Correct 7 ms 7680 KB Output is correct
21 Correct 8 ms 7680 KB Output is correct
22 Correct 101 ms 7680 KB Output is correct
23 Correct 104 ms 7680 KB Output is correct
24 Correct 103 ms 7680 KB Output is correct
25 Correct 105 ms 7680 KB Output is correct
26 Correct 102 ms 7680 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 199 ms 19012 KB Output is correct
2 Correct 194 ms 19300 KB Output is correct
3 Correct 187 ms 18752 KB Output is correct
4 Correct 189 ms 19044 KB Output is correct
5 Execution timed out 3065 ms 17516 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Execution timed out 3068 ms 10700 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 4 ms 7424 KB Output is correct
10 Correct 4 ms 7424 KB Output is correct
11 Correct 4 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 5 ms 7424 KB Output is correct
14 Correct 4 ms 7424 KB Output is correct
15 Correct 5 ms 7552 KB Output is correct
16 Correct 5 ms 7424 KB Output is correct
17 Correct 6 ms 7424 KB Output is correct
18 Correct 5 ms 7424 KB Output is correct
19 Correct 7 ms 7680 KB Output is correct
20 Correct 7 ms 7680 KB Output is correct
21 Correct 8 ms 7680 KB Output is correct
22 Correct 101 ms 7680 KB Output is correct
23 Correct 104 ms 7680 KB Output is correct
24 Correct 103 ms 7680 KB Output is correct
25 Correct 105 ms 7680 KB Output is correct
26 Correct 102 ms 7680 KB Output is correct
27 Correct 12 ms 7936 KB Output is correct
28 Correct 16 ms 7936 KB Output is correct
29 Correct 17 ms 7936 KB Output is correct
30 Correct 429 ms 7912 KB Output is correct
31 Correct 435 ms 7928 KB Output is correct
32 Correct 438 ms 7928 KB Output is correct
33 Correct 73 ms 11376 KB Output is correct
34 Correct 89 ms 11248 KB Output is correct
35 Correct 78 ms 11376 KB Output is correct
36 Execution timed out 3016 ms 10736 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 4 ms 7424 KB Output is correct
10 Correct 4 ms 7424 KB Output is correct
11 Correct 4 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 5 ms 7424 KB Output is correct
14 Correct 4 ms 7424 KB Output is correct
15 Correct 5 ms 7552 KB Output is correct
16 Correct 5 ms 7424 KB Output is correct
17 Correct 6 ms 7424 KB Output is correct
18 Correct 5 ms 7424 KB Output is correct
19 Correct 7 ms 7680 KB Output is correct
20 Correct 7 ms 7680 KB Output is correct
21 Correct 8 ms 7680 KB Output is correct
22 Correct 101 ms 7680 KB Output is correct
23 Correct 104 ms 7680 KB Output is correct
24 Correct 103 ms 7680 KB Output is correct
25 Correct 105 ms 7680 KB Output is correct
26 Correct 102 ms 7680 KB Output is correct
27 Correct 199 ms 19012 KB Output is correct
28 Correct 194 ms 19300 KB Output is correct
29 Correct 187 ms 18752 KB Output is correct
30 Correct 189 ms 19044 KB Output is correct
31 Execution timed out 3065 ms 17516 KB Time limit exceeded
32 Halted 0 ms 0 KB -