답안 #252493

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252493 2020-07-25T17:13:51 Z shayan_p 원 고르기 (APIO18_circle_selection) C++14
87 / 100
3000 ms 205236 KB
// And you curse yourself for things you never done

#include<bits/stdc++.h>

#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

const int maxn = 3e5 + 10, mod = 1e9 + 7, inf = 1e9 + 10;
const ll INF = 1e18;

pair<pii, int> p[maxn];
int arr[maxn], ans[maxn];

pii operator - (pii a, pii b){
    return {a.F - b.F, a.S - b.S};
}
pii operator + (pii a, pii b){
    return {a.F + b.F, a.S + b.S};
}
ll operator ^ (pii a, pii b){
    return 1ll * a.F * b.F + 1ll * a.S * b.S;
}
bool ok(int i, int j){
    return 1ll * (p[j].S + p[i].S) * (p[j].S + p[i].S) >= ((p[i].F - p[j].F) ^ (p[i].F - p[j].F));
}

const int FX = 13; ////////

vector<int> vx, vy;    

vector<int> val, fs;
vector<int> stock;

void push(int &lst, int x){
    fs.PB(lst);
    lst = sz(val);
    val.PB(x);
}

struct node{
    set<pair<pii, int> > st;
    void add(int f, int s, int x){
	st.insert({{f, s}, x});
    }
    void ask(int pos){
	auto it = st.lower_bound( (pair<pii, int>){ {pos + 1, -1}, -1} );
	int bad = 2;
	while(sz(stock) < FX && it != st.begin()){
	    --it;
	    if(pos <= (it->F.S))
		stock.PB(it->S);
	    else{
		if(--bad == 0)
		    break;
	    }
	}
    }
};
struct node2{
    node2 *L = 0, *R = 0;
    node* seg = 0;
    void add(int f, int s, int f2, int s2, int x, int l = 0, int r = sz(vx)-1){
	if(f <= vx[l] && vx[r] <= s){
	    if(!seg)
		seg = new node();
	    seg->add(f2, s2, x);
	    return;
	}
	if(r-l == 1)
	    return;
	int mid = (l+r) >> 1;	
	if(max(f, vx[l]) < min(s, vx[mid])){
	    if(!L)
		L = new node2();
	    L->add(f, s, f2, s2, x, l, mid);
	}
	if(max(f, vx[mid]) < min(s, vx[r])){
	    if(!R)
		R = new node2();
	    R->add(f, s, f2, s2, x, mid, r);
	}
    }
    void ask(int pos, int pos2, int l = 0, int r = sz(vx)-1){
	if(seg)
	    seg->ask(pos2);
	if(r-l == 1)
	    return;
	int mid = (l+r) >> 1;
	if(pos < vx[mid] && L)
	    L->ask(pos, pos2, l, mid);
	if(vx[mid] <= pos && R)
	    R->ask(pos, pos2, mid, r);	    
    }
};


int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie();

    node2* root = new node2();
    
    int n;
    cin >> n;

    for(int i = 0; i < n; i++){
	cin >> p[i].F.F >> p[i].F.S >> p[i].S;
	
	vx.PB(p[i].F.F - p[i].S);
	vx.PB(p[i].F.F + p[i].S + 1);
	
	vy.PB(p[i].F.S - p[i].S);
	vy.PB(p[i].F.S + p[i].S + 1);
	
	arr[i] = i;
    }
    auto cmp = [](int i, int j){
		   return (p[i].S == p[j].S ? i > j : p[i].S < p[j].S);
	       };
    sort(arr, arr + n, cmp);

    sort(vx.begin(), vx.end());
    vx.resize( unique(vx.begin(), vx.end()) - vx.begin() );

    sort(vy.begin(), vy.end());
    vy.resize( unique(vy.begin(), vy.end()) - vy.begin() );

    for(int i = n-1; i >= 0; i--){
	int I = arr[i];
	stock.clear();
	for(int msk = 0; msk < 4; msk++)
	    root->ask(p[I].F.F + (bit(msk, 0) ? 1 : -1) * p[I].S, p[I].F.S + (bit(msk, 1) ? 1 : -1) * p[I].S);
	for(int id : stock){
	    if(ok(I, id)){
		if(ans[I] == 0 || cmp(ans[I] - 1, id))
		    ans[I] = id + 1;
	    }
	}
	if(ans[I] == 0){
	    ans[I] = I + 1;
	    root->add(p[I].F.F - p[I].S, p[I].F.F + p[I].S + 1, p[I].F.S - p[I].S, p[I].F.S + p[I].S + 1, I);
	}
    }
    for(int i = 0; i < n; i++){
	cout << ans[i] << " ";
    }
    return cout << endl, 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 6 ms 688 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 10 ms 2304 KB Output is correct
23 Correct 17 ms 3456 KB Output is correct
24 Correct 10 ms 2048 KB Output is correct
25 Correct 9 ms 1664 KB Output is correct
26 Correct 10 ms 2048 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 330 ms 13256 KB Output is correct
2 Correct 356 ms 13248 KB Output is correct
3 Correct 369 ms 13000 KB Output is correct
4 Correct 344 ms 13256 KB Output is correct
5 Correct 509 ms 17868 KB Output is correct
6 Correct 702 ms 55752 KB Output is correct
7 Correct 645 ms 24392 KB Output is correct
8 Correct 658 ms 33732 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 473 ms 60716 KB Output is correct
3 Correct 1510 ms 178484 KB Output is correct
4 Correct 1490 ms 177740 KB Output is correct
5 Correct 1842 ms 162480 KB Output is correct
6 Correct 753 ms 65688 KB Output is correct
7 Correct 289 ms 31200 KB Output is correct
8 Correct 38 ms 4724 KB Output is correct
9 Correct 1682 ms 180180 KB Output is correct
10 Correct 2540 ms 144428 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1182 ms 164224 KB Output is correct
2 Correct 707 ms 78920 KB Output is correct
3 Correct 1961 ms 33348 KB Output is correct
4 Correct 773 ms 90432 KB Output is correct
5 Correct 783 ms 84172 KB Output is correct
6 Correct 1207 ms 17600 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 6 ms 688 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 10 ms 2304 KB Output is correct
23 Correct 17 ms 3456 KB Output is correct
24 Correct 10 ms 2048 KB Output is correct
25 Correct 9 ms 1664 KB Output is correct
26 Correct 10 ms 2048 KB Output is correct
27 Correct 11 ms 896 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 11 ms 896 KB Output is correct
30 Correct 27 ms 5752 KB Output is correct
31 Correct 21 ms 4096 KB Output is correct
32 Correct 22 ms 4088 KB Output is correct
33 Correct 116 ms 4708 KB Output is correct
34 Correct 121 ms 4704 KB Output is correct
35 Correct 123 ms 4704 KB Output is correct
36 Correct 305 ms 43104 KB Output is correct
37 Correct 351 ms 44304 KB Output is correct
38 Correct 346 ms 48868 KB Output is correct
39 Correct 287 ms 8748 KB Output is correct
40 Correct 285 ms 8740 KB Output is correct
41 Correct 327 ms 8832 KB Output is correct
42 Correct 278 ms 8548 KB Output is correct
43 Correct 214 ms 26080 KB Output is correct
44 Correct 210 ms 26084 KB Output is correct
45 Correct 218 ms 26084 KB Output is correct
46 Correct 224 ms 26084 KB Output is correct
47 Correct 230 ms 26208 KB Output is correct
48 Correct 209 ms 26212 KB Output is correct
49 Correct 224 ms 26208 KB Output is correct
50 Correct 223 ms 26212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 6 ms 688 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 10 ms 2304 KB Output is correct
23 Correct 17 ms 3456 KB Output is correct
24 Correct 10 ms 2048 KB Output is correct
25 Correct 9 ms 1664 KB Output is correct
26 Correct 10 ms 2048 KB Output is correct
27 Correct 330 ms 13256 KB Output is correct
28 Correct 356 ms 13248 KB Output is correct
29 Correct 369 ms 13000 KB Output is correct
30 Correct 344 ms 13256 KB Output is correct
31 Correct 509 ms 17868 KB Output is correct
32 Correct 702 ms 55752 KB Output is correct
33 Correct 645 ms 24392 KB Output is correct
34 Correct 658 ms 33732 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 473 ms 60716 KB Output is correct
37 Correct 1510 ms 178484 KB Output is correct
38 Correct 1490 ms 177740 KB Output is correct
39 Correct 1842 ms 162480 KB Output is correct
40 Correct 753 ms 65688 KB Output is correct
41 Correct 289 ms 31200 KB Output is correct
42 Correct 38 ms 4724 KB Output is correct
43 Correct 1682 ms 180180 KB Output is correct
44 Correct 2540 ms 144428 KB Output is correct
45 Correct 1182 ms 164224 KB Output is correct
46 Correct 707 ms 78920 KB Output is correct
47 Correct 1961 ms 33348 KB Output is correct
48 Correct 773 ms 90432 KB Output is correct
49 Correct 783 ms 84172 KB Output is correct
50 Correct 1207 ms 17600 KB Output is correct
51 Correct 11 ms 896 KB Output is correct
52 Correct 11 ms 896 KB Output is correct
53 Correct 11 ms 896 KB Output is correct
54 Correct 27 ms 5752 KB Output is correct
55 Correct 21 ms 4096 KB Output is correct
56 Correct 22 ms 4088 KB Output is correct
57 Correct 116 ms 4708 KB Output is correct
58 Correct 121 ms 4704 KB Output is correct
59 Correct 123 ms 4704 KB Output is correct
60 Correct 305 ms 43104 KB Output is correct
61 Correct 351 ms 44304 KB Output is correct
62 Correct 346 ms 48868 KB Output is correct
63 Correct 287 ms 8748 KB Output is correct
64 Correct 285 ms 8740 KB Output is correct
65 Correct 327 ms 8832 KB Output is correct
66 Correct 278 ms 8548 KB Output is correct
67 Correct 214 ms 26080 KB Output is correct
68 Correct 210 ms 26084 KB Output is correct
69 Correct 218 ms 26084 KB Output is correct
70 Correct 224 ms 26084 KB Output is correct
71 Correct 230 ms 26208 KB Output is correct
72 Correct 209 ms 26212 KB Output is correct
73 Correct 224 ms 26208 KB Output is correct
74 Correct 223 ms 26212 KB Output is correct
75 Correct 389 ms 13004 KB Output is correct
76 Correct 368 ms 13220 KB Output is correct
77 Correct 372 ms 13428 KB Output is correct
78 Correct 361 ms 13000 KB Output is correct
79 Correct 584 ms 15208 KB Output is correct
80 Correct 366 ms 13004 KB Output is correct
81 Correct 1407 ms 170608 KB Output is correct
82 Correct 1287 ms 155364 KB Output is correct
83 Correct 1236 ms 155976 KB Output is correct
84 Correct 1883 ms 193224 KB Output is correct
85 Correct 1348 ms 165728 KB Output is correct
86 Correct 1210 ms 151872 KB Output is correct
87 Execution timed out 3088 ms 205236 KB Time limit exceeded
88 Halted 0 ms 0 KB -