Submission #361312

#	Time	Username	Problem	Language	Result	Execution time	Memory
361312		AmShZ	원 고르기 (APIO18_circle_selection)	C++11	7 / 100	3066 ms	1048580 KiB

circle_selection

//khodaya khodet komak kon
# include <bits/stdc++.h>
 
/*
// ordered_set 
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
# define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
*/
 
using namespace std;
 
typedef long long                                        ll;
typedef long double                                      ld;
typedef pair <int, int>                                  pii;
typedef pair <pii, int>                                  ppi;
typedef pair <int, pii>                                  pip;
typedef pair <ll, ll>                                    pll;
typedef pair <pll, pll>                                  ppp;
 
# define A                                               first
# define B                                               second
# define endl                                            '\n'
# define sep                                             ' '
# define all(x)                                          x.begin(), x.end()
# define kill(x)                                         return cout << x << endl, 0
# define SZ(x)                                           int(x.size())
# define lc                                              id << 1
# define rc                                              id << 1 | 1
# define InTheNameOfGod                                  ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
 
ll power(ll a, ll b, ll md) {return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md));}
 
const int xn = 3e5 + 10;
const int xm = - 20 + 10;
const int sq = 320;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
const int mod = 998244353;
const int base = 257;

int n, ans[xn];
ppp a[xn];
vector <int> adj[xn];
bool mark[xn];

int main(){
	InTheNameOfGod;
	
	cin >> n;
	for (int i = 1; i <= n; ++ i){
		cin >> a[i].B.A >> a[i].B.B >> a[i].A.A;
		a[i].A.B = i;
		a[i].A.A *= - 1;
	}
	for (int i = 1; i <= n; ++ i){
		for (int j = 1; j <= n; ++ j){
			ll x = abs(a[i].B.A - a[j].B.A);
			ll y = abs(a[i].B.B - a[j].B.B);
			ll z = - a[i].A.A - a[j].A.A;
			if (x * x + y * y <= z * z)
				adj[i].push_back(j);
		}
	}
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; ++ i){
		if (mark[a[i].A.B])
			continue;
		for (int u : adj[a[i].A.B])
			if (!mark[u])
				mark[u] = true, ans[u] = a[i].A.B;
	}
	for (int i = 1; i <= n; ++ i)
		cout << ans[i] << sep;
	cout << endl;
			
	return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13