oj.uz

Submission #252531

# Submission time Handle Problem Language Result Execution time Memory
252531 2020-07-25T19:28:40 Z shayan_p Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 188228 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));
}
 
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{
    map<int, int> mp;
    void add(int pos, int x){
	mp[pos] = x;
    }
    void ask(int i){
	int lim = p[i].F.S + p[i].S;
	auto ITL = mp.lower_bound(p[i].F.S - p[i].S);
	if(ITL != mp.begin())
	    stock.PB(prev(ITL)->S);
	while(ITL != mp.end() && (ITL->F) < lim)
	    stock.PB(ITL->S), ITL++;
	if(ITL != mp.end())
	    stock.PB(ITL->S);
    }
};
struct node2{
    node2 *L = 0, *R = 0;
    node* seg = 0;
    void add(int f, int s, int pos, int x, int l = 0, int r = sz(vx)-1){
	if(f <= vx[l] && vx[r] <= s){
	    if(!seg)
		seg = new node();
	    seg->add(pos, 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, pos, x, l, mid);
	}
	if(max(f, vx[mid]) < min(s, vx[r])){
	    if(!R)
		R = new node2();
	    R->add(f, s, pos, 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++){
	    root->ask(p[I].F.F + w * p[I].S, I); // 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, I);
	}
    }
    for(int i = 0; i < n; i++){
	cout << ans[i] << " ";
    }
    return cout << endl, 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory 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 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 1 ms 384 KB Output is correct
14 Correct 1 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 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 5 ms 640 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 6 ms 640 KB Output is correct
22 Correct 10 ms 2048 KB Output is correct
23 Correct 23 ms 3072 KB Output is correct
24 Correct 10 ms 1920 KB Output is correct
25 Correct 10 ms 1536 KB Output is correct
26 Correct 10 ms 1920 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 13260 KB Output is correct
2 Correct 359 ms 13528 KB Output is correct
3 Correct 325 ms 13000 KB Output is correct
4 Correct 328 ms 13260 KB Output is correct
5 Correct 464 ms 17472 KB Output is correct
6 Correct 648 ms 52556 KB Output is correct
7 Correct 542 ms 23372 KB Output is correct
8 Correct 603 ms 32192 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 465 ms 53344 KB Output is correct
3 Correct 1697 ms 156548 KB Output is correct
4 Correct 1635 ms 156056 KB Output is correct
5 Correct 2055 ms 141068 KB Output is correct
6 Correct 760 ms 58064 KB Output is correct
7 Correct 268 ms 28000 KB Output is correct
8 Correct 31 ms 4476 KB Output is correct
9 Correct 1998 ms 157516 KB Output is correct
10 Correct 2690 ms 124968 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1215 ms 145412 KB Output is correct
2 Correct 688 ms 74276 KB Output is correct
3 Correct 1637 ms 31040 KB Output is correct
4 Correct 747 ms 84160 KB Output is correct
5 Correct 681 ms 78760 KB Output is correct
6 Correct 1084 ms 17072 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory 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 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 1 ms 384 KB Output is correct
14 Correct 1 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 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 5 ms 640 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 6 ms 640 KB Output is correct
22 Correct 10 ms 2048 KB Output is correct
23 Correct 23 ms 3072 KB Output is correct
24 Correct 10 ms 1920 KB Output is correct
25 Correct 10 ms 1536 KB Output is correct
26 Correct 10 ms 1920 KB Output is correct
27 Correct 11 ms 896 KB Output is correct
28 Correct 10 ms 928 KB Output is correct
29 Correct 11 ms 896 KB Output is correct
30 Correct 29 ms 5112 KB Output is correct
31 Correct 20 ms 3840 KB Output is correct
32 Correct 21 ms 3712 KB Output is correct
33 Correct 114 ms 4708 KB Output is correct
34 Correct 108 ms 4708 KB Output is correct
35 Correct 116 ms 4708 KB Output is correct
36 Correct 331 ms 39140 KB Output is correct
37 Correct 291 ms 40032 KB Output is correct
38 Correct 350 ms 44092 KB Output is correct
39 Correct 225 ms 7648 KB Output is correct
40 Correct 226 ms 7648 KB Output is correct
41 Correct 252 ms 7652 KB Output is correct
42 Correct 221 ms 7524 KB Output is correct
43 Correct 202 ms 24640 KB Output is correct
44 Correct 207 ms 24548 KB Output is correct
45 Correct 221 ms 24544 KB Output is correct
46 Correct 198 ms 24544 KB Output is correct
47 Correct 202 ms 24544 KB Output is correct
48 Correct 203 ms 24544 KB Output is correct
49 Correct 207 ms 24544 KB Output is correct
50 Correct 198 ms 24544 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory 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 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 1 ms 384 KB Output is correct
14 Correct 1 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 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 5 ms 640 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 6 ms 640 KB Output is correct
22 Correct 10 ms 2048 KB Output is correct
23 Correct 23 ms 3072 KB Output is correct
24 Correct 10 ms 1920 KB Output is correct
25 Correct 10 ms 1536 KB Output is correct
26 Correct 10 ms 1920 KB Output is correct
27 Correct 349 ms 13260 KB Output is correct
28 Correct 359 ms 13528 KB Output is correct
29 Correct 325 ms 13000 KB Output is correct
30 Correct 328 ms 13260 KB Output is correct
31 Correct 464 ms 17472 KB Output is correct
32 Correct 648 ms 52556 KB Output is correct
33 Correct 542 ms 23372 KB Output is correct
34 Correct 603 ms 32192 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 465 ms 53344 KB Output is correct
37 Correct 1697 ms 156548 KB Output is correct
38 Correct 1635 ms 156056 KB Output is correct
39 Correct 2055 ms 141068 KB Output is correct
40 Correct 760 ms 58064 KB Output is correct
41 Correct 268 ms 28000 KB Output is correct
42 Correct 31 ms 4476 KB Output is correct
43 Correct 1998 ms 157516 KB Output is correct
44 Correct 2690 ms 124968 KB Output is correct
45 Correct 1215 ms 145412 KB Output is correct
46 Correct 688 ms 74276 KB Output is correct
47 Correct 1637 ms 31040 KB Output is correct
48 Correct 747 ms 84160 KB Output is correct
49 Correct 681 ms 78760 KB Output is correct
50 Correct 1084 ms 17072 KB Output is correct
51 Correct 11 ms 896 KB Output is correct
52 Correct 10 ms 928 KB Output is correct
53 Correct 11 ms 896 KB Output is correct
54 Correct 29 ms 5112 KB Output is correct
55 Correct 20 ms 3840 KB Output is correct
56 Correct 21 ms 3712 KB Output is correct
57 Correct 114 ms 4708 KB Output is correct
58 Correct 108 ms 4708 KB Output is correct
59 Correct 116 ms 4708 KB Output is correct
60 Correct 331 ms 39140 KB Output is correct
61 Correct 291 ms 40032 KB Output is correct
62 Correct 350 ms 44092 KB Output is correct
63 Correct 225 ms 7648 KB Output is correct
64 Correct 226 ms 7648 KB Output is correct
65 Correct 252 ms 7652 KB Output is correct
66 Correct 221 ms 7524 KB Output is correct
67 Correct 202 ms 24640 KB Output is correct
68 Correct 207 ms 24548 KB Output is correct
69 Correct 221 ms 24544 KB Output is correct
70 Correct 198 ms 24544 KB Output is correct
71 Correct 202 ms 24544 KB Output is correct
72 Correct 203 ms 24544 KB Output is correct
73 Correct 207 ms 24544 KB Output is correct
74 Correct 198 ms 24544 KB Output is correct
75 Correct 377 ms 13004 KB Output is correct
76 Correct 353 ms 13232 KB Output is correct
77 Correct 355 ms 13264 KB Output is correct
78 Correct 353 ms 13004 KB Output is correct
79 Correct 579 ms 14920 KB Output is correct
80 Correct 339 ms 12912 KB Output is correct
81 Correct 1551 ms 150560 KB Output is correct
82 Correct 1226 ms 138440 KB Output is correct
83 Correct 1234 ms 139128 KB Output is correct
84 Correct 1884 ms 168000 KB Output is correct
85 Correct 1373 ms 146812 KB Output is correct
86 Correct 1351 ms 135716 KB Output is correct
87 Execution timed out 3086 ms 188228 KB Time limit exceeded
88 Halted 0 ms 0 KB -