oj.uz

Submission #252529

# Submission time Handle Problem Language Result Execution time Memory
252529 2020-07-25T19:23:32 Z shayan_p Circle selection (APIO18_circle_selection) C++14
72 / 100
 3000 ms 157632 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 pos){
	auto it = mp.lower_bound(pos);
	if(it != mp.end())
	    stock.PB(it->S);
	if(it != mp.begin())
	    stock.PB(prev(it)->S);
    }
    void ask(int i){
	_ask(p[i].F.S + p[i].S), _ask(p[i].F.S), _ask(p[i].F.S - p[i].S);
	return;
	
	auto it = mp.lower_bound(p[i].F.S + p[i].S);
	int lm = p[i].F.S - p[i].S;
	if(it != mp.end())
	    stock.PB(it->S);
	while(it != mp.begin() && (it->F) >= lm)
	    --it, 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 1 ms 384 KB Output is correct
3 Correct 1 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 1 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 6 ms 640 KB Output is correct
21 Correct 7 ms 672 KB Output is correct
22 Correct 10 ms 2048 KB Output is correct
23 Correct 18 ms 3072 KB Output is correct
24 Correct 10 ms 1920 KB Output is correct
25 Correct 9 ms 1664 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 354 ms 13316 KB Output is correct
2 Correct 350 ms 13216 KB Output is correct
3 Correct 598 ms 13004 KB Output is correct
4 Correct 344 ms 13256 KB Output is correct
5 Correct 464 ms 17344 KB Output is correct
6 Correct 658 ms 52552 KB Output is correct
7 Correct 557 ms 23360 KB Output is correct
8 Correct 674 ms 32200 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 532 ms 53476 KB Output is correct
3 Correct 1871 ms 156824 KB Output is correct
4 Correct 1990 ms 156088 KB Output is correct
5 Correct 2652 ms 141072 KB Output is correct
6 Correct 978 ms 58096 KB Output is correct
7 Correct 352 ms 28000 KB Output is correct
8 Correct 33 ms 4468 KB Output is correct
9 Correct 2518 ms 157632 KB Output is correct
10 Execution timed out 3092 ms 116024 KB Time limit exceeded

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1507 ms 145484 KB Output is correct
2 Correct 716 ms 74316 KB Output is correct
3 Correct 2926 ms 30800 KB Output is correct
4 Correct 740 ms 84300 KB Output is correct
5 Correct 759 ms 78924 KB Output is correct
6 Correct 1608 ms 17216 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 1 ms 384 KB Output is correct
3 Correct 1 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 1 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 6 ms 640 KB Output is correct
21 Correct 7 ms 672 KB Output is correct
22 Correct 10 ms 2048 KB Output is correct
23 Correct 18 ms 3072 KB Output is correct
24 Correct 10 ms 1920 KB Output is correct
25 Correct 9 ms 1664 KB Output is correct
26 Correct 9 ms 1920 KB Output is correct
27 Correct 11 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 28 ms 5112 KB Output is correct
31 Correct 21 ms 3832 KB Output is correct
32 Correct 21 ms 3832 KB Output is correct
33 Correct 117 ms 4704 KB Output is correct
34 Correct 116 ms 4708 KB Output is correct
35 Correct 122 ms 4704 KB Output is correct
36 Correct 353 ms 39136 KB Output is correct
37 Correct 347 ms 40036 KB Output is correct
38 Correct 399 ms 44004 KB Output is correct
39 Correct 332 ms 7652 KB Output is correct
40 Correct 367 ms 7776 KB Output is correct
41 Correct 353 ms 7648 KB Output is correct
42 Correct 331 ms 7620 KB Output is correct
43 Correct 212 ms 24552 KB Output is correct
44 Correct 213 ms 24548 KB Output is correct
45 Correct 205 ms 24548 KB Output is correct
46 Correct 201 ms 24548 KB Output is correct
47 Correct 208 ms 24548 KB Output is correct
48 Correct 199 ms 24672 KB Output is correct
49 Correct 196 ms 24544 KB Output is correct
50 Correct 197 ms 24672 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 1 ms 384 KB Output is correct
3 Correct 1 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 1 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 6 ms 640 KB Output is correct
21 Correct 7 ms 672 KB Output is correct
22 Correct 10 ms 2048 KB Output is correct
23 Correct 18 ms 3072 KB Output is correct
24 Correct 10 ms 1920 KB Output is correct
25 Correct 9 ms 1664 KB Output is correct
26 Correct 9 ms 1920 KB Output is correct
27 Correct 354 ms 13316 KB Output is correct
28 Correct 350 ms 13216 KB Output is correct
29 Correct 598 ms 13004 KB Output is correct
30 Correct 344 ms 13256 KB Output is correct
31 Correct 464 ms 17344 KB Output is correct
32 Correct 658 ms 52552 KB Output is correct
33 Correct 557 ms 23360 KB Output is correct
34 Correct 674 ms 32200 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 532 ms 53476 KB Output is correct
37 Correct 1871 ms 156824 KB Output is correct
38 Correct 1990 ms 156088 KB Output is correct
39 Correct 2652 ms 141072 KB Output is correct
40 Correct 978 ms 58096 KB Output is correct
41 Correct 352 ms 28000 KB Output is correct
42 Correct 33 ms 4468 KB Output is correct
43 Correct 2518 ms 157632 KB Output is correct
44 Execution timed out 3092 ms 116024 KB Time limit exceeded