oj.uz

답안 #252512

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252512 2020-07-25T17:29:31 Z shayan_p 원 고르기 (APIO18_circle_selection) C++14
19 / 100
 3000 ms 180256 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 = 0;
	while(sz(stock) < FX && it != st.begin()){
	    --it;
	    if(pos <= (it->F.S))
		stock.PB(it->S);
	    if(++bad == 3)
		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 w = -1; w <= 1; w++){
	    for(int w2 = -1; w2 <= 1; w2++)
		if(w != 0 || w2 != 0)
		    root->ask(p[I].F.F + w * p[I].S, p[I].F.S + w2 * p[I].S); // kafie?
	}
	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;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 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 1 ms 436 KB Output is correct
14 Correct 1 ms 416 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 640 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 19 ms 2304 KB Output is correct
23 Correct 23 ms 3456 KB Output is correct
24 Correct 12 ms 2048 KB Output is correct
25 Correct 10 ms 1664 KB Output is correct
26 Correct 11 ms 2048 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 382 ms 13260 KB Output is correct
2 Correct 437 ms 13248 KB Output is correct
3 Correct 385 ms 13004 KB Output is correct
4 Correct 372 ms 13256 KB Output is correct
5 Correct 665 ms 17824 KB Output is correct
6 Correct 822 ms 56000 KB Output is correct
7 Correct 727 ms 24244 KB Output is correct
8 Correct 799 ms 34112 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 599 ms 60856 KB Output is correct
3 Correct 2086 ms 178468 KB Output is correct
4 Correct 1768 ms 177612 KB Output is correct
5 Correct 2801 ms 162064 KB Output is correct
6 Correct 1065 ms 65752 KB Output is correct
7 Correct 359 ms 31204 KB Output is correct
8 Correct 40 ms 4724 KB Output is correct
9 Correct 2021 ms 180256 KB Output is correct
10 Execution timed out 3099 ms 138364 KB Time limit exceeded

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1400 ms 164304 KB Output is correct
2 Correct 862 ms 78920 KB Output is correct
3 Execution timed out 3045 ms 33284 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 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 1 ms 436 KB Output is correct
14 Correct 1 ms 416 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 640 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 19 ms 2304 KB Output is correct
23 Correct 23 ms 3456 KB Output is correct
24 Correct 12 ms 2048 KB Output is correct
25 Correct 10 ms 1664 KB Output is correct
26 Correct 11 ms 2048 KB Output is correct
27 Correct 13 ms 896 KB Output is correct
28 Correct 12 ms 896 KB Output is correct
29 Correct 12 ms 1152 KB Output is correct
30 Correct 34 ms 5752 KB Output is correct
31 Correct 24 ms 4096 KB Output is correct
32 Correct 24 ms 4088 KB Output is correct
33 Correct 127 ms 4704 KB Output is correct
34 Correct 128 ms 4704 KB Output is correct
35 Correct 145 ms 4704 KB Output is correct
36 Correct 340 ms 43108 KB Output is correct
37 Correct 350 ms 44200 KB Output is correct
38 Correct 380 ms 48864 KB Output is correct
39 Incorrect 424 ms 8676 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 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 1 ms 436 KB Output is correct
14 Correct 1 ms 416 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 640 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 19 ms 2304 KB Output is correct
23 Correct 23 ms 3456 KB Output is correct
24 Correct 12 ms 2048 KB Output is correct
25 Correct 10 ms 1664 KB Output is correct
26 Correct 11 ms 2048 KB Output is correct
27 Correct 382 ms 13260 KB Output is correct
28 Correct 437 ms 13248 KB Output is correct
29 Correct 385 ms 13004 KB Output is correct
30 Correct 372 ms 13256 KB Output is correct
31 Correct 665 ms 17824 KB Output is correct
32 Correct 822 ms 56000 KB Output is correct
33 Correct 727 ms 24244 KB Output is correct
34 Correct 799 ms 34112 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 599 ms 60856 KB Output is correct
37 Correct 2086 ms 178468 KB Output is correct
38 Correct 1768 ms 177612 KB Output is correct
39 Correct 2801 ms 162064 KB Output is correct
40 Correct 1065 ms 65752 KB Output is correct
41 Correct 359 ms 31204 KB Output is correct
42 Correct 40 ms 4724 KB Output is correct
43 Correct 2021 ms 180256 KB Output is correct
44 Execution timed out 3099 ms 138364 KB Time limit exceeded