oj.uz

Submission #741498

# Submission time Handle Problem Language Result Execution time Memory
741498 2023-05-14T09:04:03 Z myrcella Circle selection (APIO18_circle_selection) C++17
7 / 100
 3000 ms 976 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

const int maxn = 5050;

int n;
ll x[maxn],y[maxn],r[maxn];
bool removed[maxn];
int cnt = 0;
int ans[maxn];

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	cin>>n;
	rep(i,0,n) cin>>x[i]>>y[i]>>r[i];
	while (cnt!=n) {
		int cur = -1;
		rep(i,0,n) {
			if (removed[i]) continue;
			if (cur==-1 or r[i]>r[cur]) cur = i;
		}
		rep(i,0,n) {
			if (removed[i]) continue;
			if ((x[i]-x[cur])*(x[i]-x[cur]) + (y[i]-y[cur])*(y[i]-y[cur]) <= (r[i]+r[cur])*(r[i]+r[cur])) {
				removed[i] = 1;
				ans[i] = cur;
				cnt++;
			}
		}
	}
	rep(i,0,n) cout<<ans[i]+1<<" ";
	
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 568 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 576 KB Output is correct
22 Correct 129 ms 588 KB Output is correct
23 Correct 134 ms 596 KB Output is correct
24 Correct 135 ms 596 KB Output is correct
25 Correct 133 ms 576 KB Output is correct
26 Correct 134 ms 588 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 968 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 1 ms 340 KB Output is correct
2 Execution timed out 3064 ms 724 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 568 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 576 KB Output is correct
22 Correct 129 ms 588 KB Output is correct
23 Correct 134 ms 596 KB Output is correct
24 Correct 135 ms 596 KB Output is correct
25 Correct 133 ms 576 KB Output is correct
26 Correct 134 ms 588 KB Output is correct
27 Runtime error 3 ms 960 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 568 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 576 KB Output is correct
22 Correct 129 ms 588 KB Output is correct
23 Correct 134 ms 596 KB Output is correct
24 Correct 135 ms 596 KB Output is correct
25 Correct 133 ms 576 KB Output is correct
26 Correct 134 ms 588 KB Output is correct
27 Runtime error 3 ms 968 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -