oj.uz

답안 #361315

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
361315 2021-01-29T09:13:44 Z AmShZ 원 고르기 (APIO18_circle_selection) C++11
7 / 100
 3000 ms 1048576 KB 
//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];
set <pii> st[2];
bool mark[xn];

void solve(){
	for (int i = 1; i <= n; ++ i){
		int id = a[i].A.B;
		int x = a[i].B.A, y = a[i].B.B;
		int l = x + a[i].A.A, r = x - a[i].A.A;
		if (st[0].find({l, id}) == st[0].end())
			continue;
		ans[id] = id;
		st[0].erase({l, id}), st[1].erase({- r, id});
		while (st[0].lower_bound({l, id}) != st[0].end()){
			pii x = *st[0].lower_bound({l, id});
			if (x.A > r)
				break;
			ans[x.B] = id;
			st[0].erase(x);
			st[1].erase({a[x.B].A.A - a[x.B].B.A, x.B});
		}
		while (st[1].lower_bound({- r, id}) != st[1].end()){
			pii x = *st[1].lower_bound({- r, id});
			if (- x.A < l)
				break;
			ans[x.B] = id;
			st[1].erase(x);
			st[0].erase({a[x.B].B.A + a[x.B].A.A, x.B});
		}
	}
	for (int i = 1; i <= n; ++ i)
		cout << ans[i] << sep;
	cout << endl;
}

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;
		st[0].insert({a[i].B.A - a[i].A.A, i});
		st[1].insert({a[i].A.A - a[i].B.A, 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);
	if (n > 5e3){
		solve();
		return 0;
	}
	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;
}

Compilation message

circle_selection.cpp: In function 'void solve()':
circle_selection.cpp:52:21: warning: unused variable 'y' [-Wunused-variable]
   52 |   int x = a[i].B.A, y = a[i].B.B;
      |                     ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7360 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 5 ms 7404 KB Output is correct
6 Correct 5 ms 7404 KB Output is correct
7 Correct 6 ms 7404 KB Output is correct
8 Correct 5 ms 7404 KB Output is correct
9 Correct 5 ms 7404 KB Output is correct
10 Correct 6 ms 7404 KB Output is correct
11 Correct 6 ms 7404 KB Output is correct
12 Correct 5 ms 7404 KB Output is correct
13 Correct 5 ms 7404 KB Output is correct
14 Correct 5 ms 7424 KB Output is correct
15 Correct 5 ms 7404 KB Output is correct
16 Correct 16 ms 11244 KB Output is correct
17 Correct 16 ms 11116 KB Output is correct
18 Correct 15 ms 11628 KB Output is correct
19 Correct 213 ms 123116 KB Output is correct
20 Correct 190 ms 126188 KB Output is correct
21 Correct 263 ms 82412 KB Output is correct
22 Correct 93 ms 8428 KB Output is correct
23 Correct 92 ms 8320 KB Output is correct
24 Correct 93 ms 8428 KB Output is correct
25 Correct 93 ms 8300 KB Output is correct
26 Correct 95 ms 8320 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2790 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7404 KB Output is correct
2 Execution timed out 3095 ms 21612 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7360 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 5 ms 7404 KB Output is correct
6 Correct 5 ms 7404 KB Output is correct
7 Correct 6 ms 7404 KB Output is correct
8 Correct 5 ms 7404 KB Output is correct
9 Correct 5 ms 7404 KB Output is correct
10 Correct 6 ms 7404 KB Output is correct
11 Correct 6 ms 7404 KB Output is correct
12 Correct 5 ms 7404 KB Output is correct
13 Correct 5 ms 7404 KB Output is correct
14 Correct 5 ms 7424 KB Output is correct
15 Correct 5 ms 7404 KB Output is correct
16 Correct 16 ms 11244 KB Output is correct
17 Correct 16 ms 11116 KB Output is correct
18 Correct 15 ms 11628 KB Output is correct
19 Correct 213 ms 123116 KB Output is correct
20 Correct 190 ms 126188 KB Output is correct
21 Correct 263 ms 82412 KB Output is correct
22 Correct 93 ms 8428 KB Output is correct
23 Correct 92 ms 8320 KB Output is correct
24 Correct 93 ms 8428 KB Output is correct
25 Correct 93 ms 8300 KB Output is correct
26 Correct 95 ms 8320 KB Output is correct
27 Incorrect 946 ms 339624 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7360 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 5 ms 7404 KB Output is correct
6 Correct 5 ms 7404 KB Output is correct
7 Correct 6 ms 7404 KB Output is correct
8 Correct 5 ms 7404 KB Output is correct
9 Correct 5 ms 7404 KB Output is correct
10 Correct 6 ms 7404 KB Output is correct
11 Correct 6 ms 7404 KB Output is correct
12 Correct 5 ms 7404 KB Output is correct
13 Correct 5 ms 7404 KB Output is correct
14 Correct 5 ms 7424 KB Output is correct
15 Correct 5 ms 7404 KB Output is correct
16 Correct 16 ms 11244 KB Output is correct
17 Correct 16 ms 11116 KB Output is correct
18 Correct 15 ms 11628 KB Output is correct
19 Correct 213 ms 123116 KB Output is correct
20 Correct 190 ms 126188 KB Output is correct
21 Correct 263 ms 82412 KB Output is correct
22 Correct 93 ms 8428 KB Output is correct
23 Correct 92 ms 8320 KB Output is correct
24 Correct 93 ms 8428 KB Output is correct
25 Correct 93 ms 8300 KB Output is correct
26 Correct 95 ms 8320 KB Output is correct
27 Runtime error 2790 ms 1048576 KB Execution killed with signal 9
28 Halted 0 ms 0 KB -