oj.uz

답안 #252483

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252483 2020-07-25T16:39:11 Z shayan_p 원 고르기 (APIO18_circle_selection) C++14
7 / 100
 1964 ms 1048580 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 = 60; ////////

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{
    node *L = 0, *R = 0;
    int lst = -1;
    void add(int f, int s, int x, int l = -inf, int r = inf){
	if(f <= l && r <= s){
	    push(lst, x);
	    return;
	}
	if(r-l == 1)
	    return;
	int mid = (l+r) / 2;	
	if(max(f, l) < min(s, mid)){
	    if(!L)
		L = new node();
	    L->add(f, s, x, l, mid);
	}
	if(max(f, mid) < min(s, r)){
	    if(!R)
		R = new node();
	    R->add(f, s, x, mid, r);
	}
    }
    void ask(int pos, int l = -inf, int r = inf){
	if(sz(stock) == FX)
	    return;
	int pt = lst;
	while(sz(stock) < FX && pt != -1){
	    stock.PB(val[pt]);
	    pt = fs[pt];
	}
	if(r-l == 1)
	    return;
	int mid = (l+r) / 2;
	if(pos < mid && L)
	    L->ask(pos, l, mid);
	if(mid <= pos && R)
	    R->ask(pos, mid, r);	    
    }
};
struct node2{
    node2 *L = 0, *R = 0;
    node* seg = 0;
    void add(int f, int s, int f2, int s2, int x, int l = -inf, int r = inf){
	if(f <= l && r <= s){
	    if(!seg)
		seg = new node();
	    seg->add(f2, s2, x);
	    return;
	}
	if(r-l == 1)
	    return;
	int mid = (l+r) / 2;	
	if(max(f, l) < min(s, mid)){
	    if(!L)
		L = new node2();
	    L->add(f, s, f2, s2, x, l, mid);
	}
	if(max(f, mid) < min(s, r)){
	    if(!R)
		R = new node2();
	    R->add(f, s, f2, s2, x, mid, r);
	}
    }
    void ask(int pos, int pos2, int l = -inf, int r = inf){
	if(seg)
	    seg->ask(pos2);
	if(r-l == 1)
	    return;
	int mid = (l+r) / 2;
	if(pos < mid && L)
	    L->ask(pos, pos2, l, mid);
	if(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);
	vy.PB(p[i].F.S);
	
	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 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 5 ms 3456 KB Output is correct
12 Correct 4 ms 3072 KB Output is correct
13 Correct 4 ms 3200 KB Output is correct
14 Correct 5 ms 3456 KB Output is correct
15 Correct 8 ms 3328 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 5 ms 768 KB Output is correct
20 Correct 7 ms 680 KB Output is correct
21 Correct 10 ms 1024 KB Output is correct
22 Correct 205 ms 131928 KB Output is correct
23 Correct 182 ms 105156 KB Output is correct
24 Correct 211 ms 142924 KB Output is correct
25 Correct 169 ms 117688 KB Output is correct
26 Correct 215 ms 139716 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 278 ms 12508 KB Output is correct
2 Correct 286 ms 11920 KB Output is correct
3 Correct 297 ms 11476 KB Output is correct
4 Correct 271 ms 11736 KB Output is correct
5 Correct 904 ms 69788 KB Output is correct
6 Runtime error 1964 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1536 KB Output is correct
2 Runtime error 1599 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1715 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 5 ms 3456 KB Output is correct
12 Correct 4 ms 3072 KB Output is correct
13 Correct 4 ms 3200 KB Output is correct
14 Correct 5 ms 3456 KB Output is correct
15 Correct 8 ms 3328 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 5 ms 768 KB Output is correct
20 Correct 7 ms 680 KB Output is correct
21 Correct 10 ms 1024 KB Output is correct
22 Correct 205 ms 131928 KB Output is correct
23 Correct 182 ms 105156 KB Output is correct
24 Correct 211 ms 142924 KB Output is correct
25 Correct 169 ms 117688 KB Output is correct
26 Correct 215 ms 139716 KB Output is correct
27 Correct 11 ms 1280 KB Output is correct
28 Correct 15 ms 768 KB Output is correct
29 Correct 10 ms 768 KB Output is correct
30 Correct 416 ms 262760 KB Output is correct
31 Correct 415 ms 271376 KB Output is correct
32 Correct 397 ms 256564 KB Output is correct
33 Correct 103 ms 3948 KB Output is correct
34 Correct 92 ms 3880 KB Output is correct
35 Correct 126 ms 8300 KB Output is correct
36 Runtime error 1613 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 5 ms 3456 KB Output is correct
12 Correct 4 ms 3072 KB Output is correct
13 Correct 4 ms 3200 KB Output is correct
14 Correct 5 ms 3456 KB Output is correct
15 Correct 8 ms 3328 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 5 ms 768 KB Output is correct
20 Correct 7 ms 680 KB Output is correct
21 Correct 10 ms 1024 KB Output is correct
22 Correct 205 ms 131928 KB Output is correct
23 Correct 182 ms 105156 KB Output is correct
24 Correct 211 ms 142924 KB Output is correct
25 Correct 169 ms 117688 KB Output is correct
26 Correct 215 ms 139716 KB Output is correct
27 Correct 278 ms 12508 KB Output is correct
28 Correct 286 ms 11920 KB Output is correct
29 Correct 297 ms 11476 KB Output is correct
30 Correct 271 ms 11736 KB Output is correct
31 Correct 904 ms 69788 KB Output is correct
32 Runtime error 1964 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
33 Halted 0 ms 0 KB -