oj.uz

답안 #252487

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252487 2020-07-25T17:06:09 Z shayan_p 원 고르기 (APIO18_circle_selection) C++14
87 / 100
 3000 ms 218324 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 = 50; ////////

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 = 3;
	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();
	//	cout << "IN " << I+1 << endl;
	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){
	    //	    cout << "STOCK " << id+1 << endl;
	    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;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 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 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 8 ms 640 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 6 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 11 ms 1956 KB Output is correct
25 Correct 9 ms 1664 KB Output is correct
26 Correct 10 ms 2048 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 343 ms 13256 KB Output is correct
2 Correct 363 ms 13256 KB Output is correct
3 Correct 372 ms 13148 KB Output is correct
4 Correct 352 ms 13228 KB Output is correct
5 Correct 528 ms 17956 KB Output is correct
6 Correct 736 ms 55884 KB Output is correct
7 Correct 670 ms 24356 KB Output is correct
8 Correct 674 ms 33736 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 482 ms 60728 KB Output is correct
3 Correct 1618 ms 178396 KB Output is correct
4 Correct 1582 ms 177636 KB Output is correct
5 Correct 2068 ms 162068 KB Output is correct
6 Correct 837 ms 65616 KB Output is correct
7 Correct 312 ms 31128 KB Output is correct
8 Correct 39 ms 4724 KB Output is correct
9 Correct 1979 ms 180324 KB Output is correct
10 Correct 2575 ms 144380 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1248 ms 164108 KB Output is correct
2 Correct 729 ms 78912 KB Output is correct
3 Correct 1964 ms 33268 KB Output is correct
4 Correct 791 ms 90440 KB Output is correct
5 Correct 754 ms 84168 KB Output is correct
6 Correct 1354 ms 17772 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 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 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 8 ms 640 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 6 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 11 ms 1956 KB Output is correct
25 Correct 9 ms 1664 KB Output is correct
26 Correct 10 ms 2048 KB Output is correct
27 Correct 12 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 31 ms 5752 KB Output is correct
31 Correct 23 ms 4096 KB Output is correct
32 Correct 23 ms 4096 KB Output is correct
33 Correct 137 ms 4668 KB Output is correct
34 Correct 118 ms 4708 KB Output is correct
35 Correct 117 ms 4704 KB Output is correct
36 Correct 318 ms 43108 KB Output is correct
37 Correct 325 ms 44128 KB Output is correct
38 Correct 369 ms 48868 KB Output is correct
39 Correct 340 ms 8672 KB Output is correct
40 Correct 313 ms 8676 KB Output is correct
41 Correct 307 ms 8672 KB Output is correct
42 Correct 305 ms 8548 KB Output is correct
43 Correct 218 ms 26152 KB Output is correct
44 Correct 223 ms 26208 KB Output is correct
45 Correct 215 ms 26084 KB Output is correct
46 Correct 215 ms 26080 KB Output is correct
47 Correct 225 ms 26340 KB Output is correct
48 Correct 217 ms 26084 KB Output is correct
49 Correct 217 ms 26208 KB Output is correct
50 Correct 219 ms 26200 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 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 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 8 ms 640 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 6 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 11 ms 1956 KB Output is correct
25 Correct 9 ms 1664 KB Output is correct
26 Correct 10 ms 2048 KB Output is correct
27 Correct 343 ms 13256 KB Output is correct
28 Correct 363 ms 13256 KB Output is correct
29 Correct 372 ms 13148 KB Output is correct
30 Correct 352 ms 13228 KB Output is correct
31 Correct 528 ms 17956 KB Output is correct
32 Correct 736 ms 55884 KB Output is correct
33 Correct 670 ms 24356 KB Output is correct
34 Correct 674 ms 33736 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 482 ms 60728 KB Output is correct
37 Correct 1618 ms 178396 KB Output is correct
38 Correct 1582 ms 177636 KB Output is correct
39 Correct 2068 ms 162068 KB Output is correct
40 Correct 837 ms 65616 KB Output is correct
41 Correct 312 ms 31128 KB Output is correct
42 Correct 39 ms 4724 KB Output is correct
43 Correct 1979 ms 180324 KB Output is correct
44 Correct 2575 ms 144380 KB Output is correct
45 Correct 1248 ms 164108 KB Output is correct
46 Correct 729 ms 78912 KB Output is correct
47 Correct 1964 ms 33268 KB Output is correct
48 Correct 791 ms 90440 KB Output is correct
49 Correct 754 ms 84168 KB Output is correct
50 Correct 1354 ms 17772 KB Output is correct
51 Correct 12 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 31 ms 5752 KB Output is correct
55 Correct 23 ms 4096 KB Output is correct
56 Correct 23 ms 4096 KB Output is correct
57 Correct 137 ms 4668 KB Output is correct
58 Correct 118 ms 4708 KB Output is correct
59 Correct 117 ms 4704 KB Output is correct
60 Correct 318 ms 43108 KB Output is correct
61 Correct 325 ms 44128 KB Output is correct
62 Correct 369 ms 48868 KB Output is correct
63 Correct 340 ms 8672 KB Output is correct
64 Correct 313 ms 8676 KB Output is correct
65 Correct 307 ms 8672 KB Output is correct
66 Correct 305 ms 8548 KB Output is correct
67 Correct 218 ms 26152 KB Output is correct
68 Correct 223 ms 26208 KB Output is correct
69 Correct 215 ms 26084 KB Output is correct
70 Correct 215 ms 26080 KB Output is correct
71 Correct 225 ms 26340 KB Output is correct
72 Correct 217 ms 26084 KB Output is correct
73 Correct 217 ms 26208 KB Output is correct
74 Correct 219 ms 26200 KB Output is correct
75 Correct 377 ms 13000 KB Output is correct
76 Correct 366 ms 13652 KB Output is correct
77 Correct 356 ms 13248 KB Output is correct
78 Correct 365 ms 13004 KB Output is correct
79 Correct 583 ms 15168 KB Output is correct
80 Correct 355 ms 12912 KB Output is correct
81 Correct 1457 ms 170852 KB Output is correct
82 Correct 1264 ms 155200 KB Output is correct
83 Correct 1253 ms 156104 KB Output is correct
84 Correct 1846 ms 193216 KB Output is correct
85 Correct 1365 ms 165580 KB Output is correct
86 Correct 1277 ms 151744 KB Output is correct
87 Execution timed out 3101 ms 218324 KB Time limit exceeded
88 Halted 0 ms 0 KB -