oj.uz

Submission #240001

# Submission time Handle Problem Language Result Execution time Memory
240001 2020-06-17T16:52:56 Z alishahali1382 Circle selection (APIO18_circle_selection) C++14
7 / 100
 3000 ms 17064 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=300010, LOG=20;

int n, m, k, u, v, x, y, t, a, b;
int X[MAXN], Y[MAXN], R[MAXN], P[MAXN], L=inf;
int ans[MAXN];
map<pii, vector<int>> mp;

bool check(int i, int j){
	ll dx=X[i]-X[j], dy=Y[i]-Y[j], r=R[i]+R[j];
	return dx*dx+dy*dy<=r*r;
}

void Build(){
	mp.clear();
	for (int i=1; i<=n; i++) if (!ans[i]) mp[{X[i]/L, Y[i]/L}].pb(i);
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n;
	for (int i=1; i<=n; i++) cin>>X[i]>>Y[i]>>R[i], P[i]=i;
	sort(P+1, P+n+1, [](int i, int j){
		return pii(R[i], -i)>pii(R[j], -j);	
	});
	Build();
	for (int i=1; i<=n; i++){
		int id=P[i];
		if (ans[id]) continue ;
		//if (R[id]<.75*L) L=R[id], Build();
		int x=X[i]/L, y=Y[i]/L;
		for (int xx=x-2; xx<=x+2; xx++)
			for (int yy=y-2; yy<=y+2; yy++) if (mp.count({xx, yy})){
				vector<int> vec=mp[{x, y}], v2;
				for (int i:vec){
					if (check(id, i)) ans[i]=id;
					else v2.pb(i);
				}
				mp[{x, y}]=v2;
			}
		
	}
	for (int i=1; i<=n; i++) cout<<ans[i]<<' ';
	
	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

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 8 ms 768 KB Output is correct
20 Correct 8 ms 768 KB Output is correct
21 Correct 8 ms 768 KB Output is correct
22 Correct 75 ms 764 KB Output is correct
23 Correct 75 ms 888 KB Output is correct
24 Correct 72 ms 768 KB Output is correct
25 Correct 74 ms 760 KB Output is correct
26 Correct 75 ms 764 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 9808 KB Output is correct
2 Correct 192 ms 16876 KB Output is correct
3 Correct 184 ms 16340 KB Output is correct
4 Correct 186 ms 16336 KB Output is correct
5 Correct 2563 ms 17064 KB Output is correct
6 Execution timed out 3077 ms 16780 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Execution timed out 3079 ms 7268 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3065 ms 11008 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 8 ms 768 KB Output is correct
20 Correct 8 ms 768 KB Output is correct
21 Correct 8 ms 768 KB Output is correct
22 Correct 75 ms 764 KB Output is correct
23 Correct 75 ms 888 KB Output is correct
24 Correct 72 ms 768 KB Output is correct
25 Correct 74 ms 760 KB Output is correct
26 Correct 75 ms 764 KB Output is correct
27 Correct 11 ms 1024 KB Output is correct
28 Correct 11 ms 1024 KB Output is correct
29 Correct 12 ms 1024 KB Output is correct
30 Correct 254 ms 1144 KB Output is correct
31 Correct 259 ms 1144 KB Output is correct
32 Correct 255 ms 1144 KB Output is correct
33 Correct 72 ms 6636 KB Output is correct
34 Correct 74 ms 6652 KB Output is correct
35 Correct 70 ms 6380 KB Output is correct
36 Execution timed out 3098 ms 6816 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 8 ms 768 KB Output is correct
20 Correct 8 ms 768 KB Output is correct
21 Correct 8 ms 768 KB Output is correct
22 Correct 75 ms 764 KB Output is correct
23 Correct 75 ms 888 KB Output is correct
24 Correct 72 ms 768 KB Output is correct
25 Correct 74 ms 760 KB Output is correct
26 Correct 75 ms 764 KB Output is correct
27 Correct 192 ms 9808 KB Output is correct
28 Correct 192 ms 16876 KB Output is correct
29 Correct 184 ms 16340 KB Output is correct
30 Correct 186 ms 16336 KB Output is correct
31 Correct 2563 ms 17064 KB Output is correct
32 Execution timed out 3077 ms 16780 KB Time limit exceeded
33 Halted 0 ms 0 KB -