oj.uz

Submission #254316

# Submission time Handle Problem Language Result Execution time Memory
254316 2020-07-29T20:38:37 Z shayan_p Circle selection (APIO18_circle_selection) C++14
64 / 100
 3000 ms 88784 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;
typedef pair<ll, ll> pll;

const int maxn = 3e5 + 10, mod = 1e9 + 7, inf = 1e9 + 10;
 
pair<pll, ll> p[maxn];
int arr[maxn], ans[maxn];
 
pll operator - (pll a, pll b){
    return {a.F - b.F, a.S - b.S};
}
pll operator + (pll a, pll b){
    return {a.F + b.F, a.S + b.S};
}
ll operator ^ (pll a, pll 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));
}

map<pii, vector<int> > mp, mp2;
int Log = 31;
int n;

int cnt[maxn];

vector<int> vvv[2][2];

void reSize(){
    --Log;    
    mp2.clear();
    for(auto &it : mp){
	vvv[0][0].clear();
	vvv[0][1].clear();
	vvv[1][0].clear();
	vvv[1][1].clear();
	for(auto x : it.S){
	    if(ans[x] == -1)
		vvv[bit(p[x].F.F, Log)][bit(p[x].F.S, Log)].PB(x);
	}
	if(!vvv[0][0].empty())
	    mp2[{2 * it.F.F, 2 * it.F.S}] = vvv[0][0];
	if(!vvv[0][1].empty())
	    mp2[{2 * it.F.F, 2 * it.F.S + 1}] = vvv[0][1];
	if(!vvv[1][0].empty())
	    mp2[{2 * it.F.F + 1, 2 * it.F.S}] = vvv[1][0];
	if(!vvv[1][1].empty())
	    mp2[{2 * it.F.F + 1, 2 * it.F.S + 1}] = vvv[1][1];	
    }
    mp = mp2;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie();

    memset(ans, -1, sizeof ans);
    
    cin >> n;

    for(int i = 0; i < n; i++){
	cin >> p[i].F.F >> p[i].F.S >> p[i].S;
	p[i].F.F+= inf, p[i].F.S+= inf;
    }
    auto cmp = [](int i, int j){
		   return (p[i].S == p[j].S ? i > j : p[i].S < p[j].S);
	       };
    iota(arr, arr + n, 0);
    sort(arr, arr + n, cmp);

    vector<int> chert;
    for(int i = 0; i < n; i++)
	chert.PB(i);
    mp[{0,0}] = chert;
    
    for(int I = n-1; I >= 0; I--){
	int i = arr[I];
	while(Log > 0 && (1<<(Log-1)) >= p[i].S)
	    reSize();
	if(ans[i] == -1){
	    ans[i] = i;
	    int x = p[i].F.F >> Log, y = p[i].F.S >> Log;
	    for(int X = x-2; X <= x+2; X++){
		for(int Y = y-2; Y <= y+2; Y++){
		    if(mp.count({X, Y})){
			vector<int> vec;
			for(int id : mp[{X, Y}]){
			    if(ans[id] == -1 && ok(id, i))
				ans[id] = i;
			    if(ans[id] == -1)
				vec.PB(id);//, assert(++cnt[id] <= 10);
			}
			if(!vec.empty())
			    mp[{X, Y}] = vec;
		    }
		}
	    }
	}
    }
    for(int i = 0; i < n; i++){
	cout << ans[i] + 1 << " ";
    }
    return cout << endl, 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1536 KB Output is correct
2 Correct 2 ms 1536 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 2 ms 1536 KB Output is correct
5 Correct 1 ms 1536 KB Output is correct
6 Correct 1 ms 1536 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 1 ms 1536 KB Output is correct
10 Correct 1 ms 1536 KB Output is correct
11 Correct 1 ms 1536 KB Output is correct
12 Correct 1 ms 1536 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 3 ms 1536 KB Output is correct
15 Correct 1 ms 1536 KB Output is correct
16 Correct 2 ms 1536 KB Output is correct
17 Correct 1 ms 1536 KB Output is correct
18 Correct 2 ms 1536 KB Output is correct
19 Correct 4 ms 1792 KB Output is correct
20 Correct 4 ms 1792 KB Output is correct
21 Correct 4 ms 1792 KB Output is correct
22 Correct 27 ms 2936 KB Output is correct
23 Correct 28 ms 2944 KB Output is correct
24 Correct 26 ms 2936 KB Output is correct
25 Correct 29 ms 2816 KB Output is correct
26 Correct 27 ms 2936 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 19152 KB Output is correct
2 Correct 219 ms 19280 KB Output is correct
3 Correct 206 ms 17240 KB Output is correct
4 Correct 188 ms 16720 KB Output is correct
5 Correct 456 ms 21048 KB Output is correct
6 Correct 1154 ms 42680 KB Output is correct
7 Correct 531 ms 21956 KB Output is correct
8 Correct 709 ms 26420 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1536 KB Output is correct
2 Correct 715 ms 28008 KB Output is correct
3 Correct 2767 ms 80916 KB Output is correct
4 Correct 2860 ms 88784 KB Output is correct
5 Correct 2250 ms 77776 KB Output is correct
6 Correct 783 ms 39080 KB Output is correct
7 Correct 374 ms 21392 KB Output is correct
8 Correct 63 ms 5752 KB Output is correct
9 Correct 2658 ms 86360 KB Output is correct
10 Correct 1752 ms 71372 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3080 ms 79764 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1536 KB Output is correct
2 Correct 2 ms 1536 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 2 ms 1536 KB Output is correct
5 Correct 1 ms 1536 KB Output is correct
6 Correct 1 ms 1536 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 1 ms 1536 KB Output is correct
10 Correct 1 ms 1536 KB Output is correct
11 Correct 1 ms 1536 KB Output is correct
12 Correct 1 ms 1536 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 3 ms 1536 KB Output is correct
15 Correct 1 ms 1536 KB Output is correct
16 Correct 2 ms 1536 KB Output is correct
17 Correct 1 ms 1536 KB Output is correct
18 Correct 2 ms 1536 KB Output is correct
19 Correct 4 ms 1792 KB Output is correct
20 Correct 4 ms 1792 KB Output is correct
21 Correct 4 ms 1792 KB Output is correct
22 Correct 27 ms 2936 KB Output is correct
23 Correct 28 ms 2944 KB Output is correct
24 Correct 26 ms 2936 KB Output is correct
25 Correct 29 ms 2816 KB Output is correct
26 Correct 27 ms 2936 KB Output is correct
27 Correct 8 ms 2048 KB Output is correct
28 Correct 8 ms 2048 KB Output is correct
29 Correct 8 ms 2048 KB Output is correct
30 Correct 54 ms 4216 KB Output is correct
31 Correct 51 ms 4224 KB Output is correct
32 Correct 59 ms 4332 KB Output is correct
33 Correct 70 ms 6116 KB Output is correct
34 Correct 67 ms 6116 KB Output is correct
35 Correct 69 ms 7532 KB Output is correct
36 Correct 852 ms 28644 KB Output is correct
37 Correct 825 ms 28388 KB Output is correct
38 Correct 749 ms 28260 KB Output is correct
39 Correct 382 ms 25384 KB Output is correct
40 Correct 388 ms 25672 KB Output is correct
41 Correct 423 ms 25572 KB Output is correct
42 Correct 319 ms 20196 KB Output is correct
43 Correct 532 ms 27756 KB Output is correct
44 Correct 533 ms 27884 KB Output is correct
45 Correct 544 ms 27880 KB Output is correct
46 Correct 527 ms 27752 KB Output is correct
47 Correct 543 ms 27820 KB Output is correct
48 Correct 535 ms 27628 KB Output is correct
49 Correct 589 ms 27872 KB Output is correct
50 Correct 577 ms 27668 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1536 KB Output is correct
2 Correct 2 ms 1536 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 2 ms 1536 KB Output is correct
5 Correct 1 ms 1536 KB Output is correct
6 Correct 1 ms 1536 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 1 ms 1536 KB Output is correct
10 Correct 1 ms 1536 KB Output is correct
11 Correct 1 ms 1536 KB Output is correct
12 Correct 1 ms 1536 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 3 ms 1536 KB Output is correct
15 Correct 1 ms 1536 KB Output is correct
16 Correct 2 ms 1536 KB Output is correct
17 Correct 1 ms 1536 KB Output is correct
18 Correct 2 ms 1536 KB Output is correct
19 Correct 4 ms 1792 KB Output is correct
20 Correct 4 ms 1792 KB Output is correct
21 Correct 4 ms 1792 KB Output is correct
22 Correct 27 ms 2936 KB Output is correct
23 Correct 28 ms 2944 KB Output is correct
24 Correct 26 ms 2936 KB Output is correct
25 Correct 29 ms 2816 KB Output is correct
26 Correct 27 ms 2936 KB Output is correct
27 Correct 219 ms 19152 KB Output is correct
28 Correct 219 ms 19280 KB Output is correct
29 Correct 206 ms 17240 KB Output is correct
30 Correct 188 ms 16720 KB Output is correct
31 Correct 456 ms 21048 KB Output is correct
32 Correct 1154 ms 42680 KB Output is correct
33 Correct 531 ms 21956 KB Output is correct
34 Correct 709 ms 26420 KB Output is correct
35 Correct 1 ms 1536 KB Output is correct
36 Correct 715 ms 28008 KB Output is correct
37 Correct 2767 ms 80916 KB Output is correct
38 Correct 2860 ms 88784 KB Output is correct
39 Correct 2250 ms 77776 KB Output is correct
40 Correct 783 ms 39080 KB Output is correct
41 Correct 374 ms 21392 KB Output is correct
42 Correct 63 ms 5752 KB Output is correct
43 Correct 2658 ms 86360 KB Output is correct
44 Correct 1752 ms 71372 KB Output is correct
45 Execution timed out 3080 ms 79764 KB Time limit exceeded
46 Halted 0 ms 0 KB -