oj.uz

Submission #252533

# Submission time Handle Problem Language Result Execution time Memory
252533 2020-07-25T19:34:41 Z shayan_p Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 183696 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 pos = p[i].F.S;
	auto it = mp.lower_bound(pos);
	if(it != mp.end())
	    stock.PB(it->S);
	if(it != mp.begin())
	    stock.PB(prev(it)->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 1 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 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 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 1 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 5 ms 640 KB Output is correct
22 Correct 9 ms 2048 KB Output is correct
23 Correct 15 ms 3072 KB Output is correct
24 Correct 9 ms 1920 KB Output is correct
25 Correct 8 ms 1564 KB Output is correct
26 Correct 9 ms 1920 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 328 ms 13248 KB Output is correct
2 Correct 324 ms 13252 KB Output is correct
3 Correct 339 ms 13004 KB Output is correct
4 Correct 322 ms 13272 KB Output is correct
5 Correct 447 ms 17344 KB Output is correct
6 Correct 661 ms 52812 KB Output is correct
7 Correct 621 ms 23476 KB Output is correct
8 Correct 577 ms 32200 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 427 ms 53220 KB Output is correct
3 Correct 1738 ms 156684 KB Output is correct
4 Correct 1429 ms 155980 KB Output is correct
5 Correct 2037 ms 141084 KB Output is correct
6 Correct 845 ms 58068 KB Output is correct
7 Correct 267 ms 28000 KB Output is correct
8 Correct 35 ms 4476 KB Output is correct
9 Correct 1949 ms 157476 KB Output is correct
10 Correct 2758 ms 124780 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1305 ms 145460 KB Output is correct
2 Correct 649 ms 74188 KB Output is correct
3 Correct 1716 ms 30888 KB Output is correct
4 Correct 726 ms 84288 KB Output is correct
5 Correct 675 ms 78764 KB Output is correct
6 Correct 998 ms 17100 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 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 1 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 5 ms 640 KB Output is correct
22 Correct 9 ms 2048 KB Output is correct
23 Correct 15 ms 3072 KB Output is correct
24 Correct 9 ms 1920 KB Output is correct
25 Correct 8 ms 1564 KB Output is correct
26 Correct 9 ms 1920 KB Output is correct
27 Correct 10 ms 896 KB Output is correct
28 Correct 10 ms 896 KB Output is correct
29 Correct 11 ms 896 KB Output is correct
30 Correct 26 ms 5112 KB Output is correct
31 Correct 20 ms 3712 KB Output is correct
32 Correct 22 ms 3712 KB Output is correct
33 Correct 118 ms 4708 KB Output is correct
34 Correct 114 ms 4708 KB Output is correct
35 Correct 120 ms 4704 KB Output is correct
36 Correct 325 ms 39268 KB Output is correct
37 Correct 303 ms 40032 KB Output is correct
38 Correct 322 ms 44128 KB Output is correct
39 Correct 211 ms 7652 KB Output is correct
40 Correct 211 ms 7648 KB Output is correct
41 Correct 213 ms 7652 KB Output is correct
42 Correct 211 ms 7652 KB Output is correct
43 Correct 191 ms 24544 KB Output is correct
44 Correct 193 ms 24672 KB Output is correct
45 Correct 196 ms 24544 KB Output is correct
46 Correct 201 ms 24544 KB Output is correct
47 Correct 195 ms 24616 KB Output is correct
48 Correct 214 ms 24548 KB Output is correct
49 Correct 203 ms 24548 KB Output is correct
50 Correct 193 ms 24548 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 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 1 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 5 ms 640 KB Output is correct
22 Correct 9 ms 2048 KB Output is correct
23 Correct 15 ms 3072 KB Output is correct
24 Correct 9 ms 1920 KB Output is correct
25 Correct 8 ms 1564 KB Output is correct
26 Correct 9 ms 1920 KB Output is correct
27 Correct 328 ms 13248 KB Output is correct
28 Correct 324 ms 13252 KB Output is correct
29 Correct 339 ms 13004 KB Output is correct
30 Correct 322 ms 13272 KB Output is correct
31 Correct 447 ms 17344 KB Output is correct
32 Correct 661 ms 52812 KB Output is correct
33 Correct 621 ms 23476 KB Output is correct
34 Correct 577 ms 32200 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 427 ms 53220 KB Output is correct
37 Correct 1738 ms 156684 KB Output is correct
38 Correct 1429 ms 155980 KB Output is correct
39 Correct 2037 ms 141084 KB Output is correct
40 Correct 845 ms 58068 KB Output is correct
41 Correct 267 ms 28000 KB Output is correct
42 Correct 35 ms 4476 KB Output is correct
43 Correct 1949 ms 157476 KB Output is correct
44 Correct 2758 ms 124780 KB Output is correct
45 Correct 1305 ms 145460 KB Output is correct
46 Correct 649 ms 74188 KB Output is correct
47 Correct 1716 ms 30888 KB Output is correct
48 Correct 726 ms 84288 KB Output is correct
49 Correct 675 ms 78764 KB Output is correct
50 Correct 998 ms 17100 KB Output is correct
51 Correct 10 ms 896 KB Output is correct
52 Correct 10 ms 896 KB Output is correct
53 Correct 11 ms 896 KB Output is correct
54 Correct 26 ms 5112 KB Output is correct
55 Correct 20 ms 3712 KB Output is correct
56 Correct 22 ms 3712 KB Output is correct
57 Correct 118 ms 4708 KB Output is correct
58 Correct 114 ms 4708 KB Output is correct
59 Correct 120 ms 4704 KB Output is correct
60 Correct 325 ms 39268 KB Output is correct
61 Correct 303 ms 40032 KB Output is correct
62 Correct 322 ms 44128 KB Output is correct
63 Correct 211 ms 7652 KB Output is correct
64 Correct 211 ms 7648 KB Output is correct
65 Correct 213 ms 7652 KB Output is correct
66 Correct 211 ms 7652 KB Output is correct
67 Correct 191 ms 24544 KB Output is correct
68 Correct 193 ms 24672 KB Output is correct
69 Correct 196 ms 24544 KB Output is correct
70 Correct 201 ms 24544 KB Output is correct
71 Correct 195 ms 24616 KB Output is correct
72 Correct 214 ms 24548 KB Output is correct
73 Correct 203 ms 24548 KB Output is correct
74 Correct 193 ms 24548 KB Output is correct
75 Correct 351 ms 13000 KB Output is correct
76 Correct 345 ms 13276 KB Output is correct
77 Correct 356 ms 13388 KB Output is correct
78 Correct 363 ms 12992 KB Output is correct
79 Correct 523 ms 14920 KB Output is correct
80 Correct 344 ms 13044 KB Output is correct
81 Correct 1338 ms 150732 KB Output is correct
82 Correct 1150 ms 138448 KB Output is correct
83 Correct 1258 ms 139048 KB Output is correct
84 Correct 1707 ms 167804 KB Output is correct
85 Correct 1296 ms 146688 KB Output is correct
86 Correct 1131 ms 135616 KB Output is correct
87 Execution timed out 3099 ms 183696 KB Time limit exceeded
88 Halted 0 ms 0 KB -