oj.uz

Submission #254320

# Submission time Handle Problem Language Result Execution time Memory
254320 2020-07-29T20:49:59 Z shayan_p Circle selection (APIO18_circle_selection) C++14
60 / 100
 3000 ms 43784 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));
}

struct Hash{
    int operator() (const pii &p)const{
	return hash<ll>()( (ll(p.F) << 32) | ll(p.S) );
    }
};

unordered_map<pii, vector<int>, Hash> mp;
int Log = 31;
int n;

int cnt[maxn];

void reSize(){
    mp.clear();
    for(int i = 0; i < n; i++){
	if(ans[i] == -1)
	    mp[{p[i].F.F >> Log, p[i].F.S >> Log}].PB(i);
    }
}

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);
    
    for(int I = n-1; I >= 0; I--){
	int i = arr[I];
	bool done = 0;
	while(Log > 0 && (1<<(Log-1)) >= p[i].S)
	    Log--, done = 1;
	if(done)
	    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 1 ms 1536 KB Output is correct
2 Correct 1 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 1 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 1 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 2 ms 1536 KB Output is correct
18 Correct 2 ms 1536 KB Output is correct
19 Correct 4 ms 1920 KB Output is correct
20 Correct 4 ms 1920 KB Output is correct
21 Correct 4 ms 1920 KB Output is correct
22 Correct 7 ms 2304 KB Output is correct
23 Correct 8 ms 2280 KB Output is correct
24 Correct 8 ms 2304 KB Output is correct
25 Correct 8 ms 2304 KB Output is correct
26 Correct 8 ms 2304 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 12100 KB Output is correct
2 Correct 210 ms 13176 KB Output is correct
3 Correct 208 ms 12796 KB Output is correct
4 Correct 208 ms 12604 KB Output is correct
5 Execution timed out 3096 ms 11912 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1536 KB Output is correct
2 Correct 789 ms 15496 KB Output is correct
3 Execution timed out 3085 ms 41736 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1273 ms 43428 KB Output is correct
2 Correct 575 ms 43656 KB Output is correct
3 Correct 2973 ms 19572 KB Output is correct
4 Correct 577 ms 43784 KB Output is correct
5 Correct 577 ms 43656 KB Output is correct
6 Correct 382 ms 14456 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1536 KB Output is correct
2 Correct 1 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 1 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 1 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 2 ms 1536 KB Output is correct
18 Correct 2 ms 1536 KB Output is correct
19 Correct 4 ms 1920 KB Output is correct
20 Correct 4 ms 1920 KB Output is correct
21 Correct 4 ms 1920 KB Output is correct
22 Correct 7 ms 2304 KB Output is correct
23 Correct 8 ms 2280 KB Output is correct
24 Correct 8 ms 2304 KB Output is correct
25 Correct 8 ms 2304 KB Output is correct
26 Correct 8 ms 2304 KB Output is correct
27 Correct 8 ms 2176 KB Output is correct
28 Correct 8 ms 2176 KB Output is correct
29 Correct 9 ms 2200 KB Output is correct
30 Correct 15 ms 3072 KB Output is correct
31 Correct 16 ms 3200 KB Output is correct
32 Correct 16 ms 3072 KB Output is correct
33 Correct 73 ms 5484 KB Output is correct
34 Correct 74 ms 5484 KB Output is correct
35 Correct 74 ms 5472 KB Output is correct
36 Correct 328 ms 15628 KB Output is correct
37 Correct 220 ms 15624 KB Output is correct
38 Correct 365 ms 15624 KB Output is correct
39 Correct 2513 ms 14284 KB Output is correct
40 Correct 2663 ms 14192 KB Output is correct
41 Correct 2566 ms 14232 KB Output is correct
42 Correct 1846 ms 12040 KB Output is correct
43 Correct 159 ms 15364 KB Output is correct
44 Correct 156 ms 15368 KB Output is correct
45 Correct 154 ms 15368 KB Output is correct
46 Correct 155 ms 15364 KB Output is correct
47 Correct 182 ms 15364 KB Output is correct
48 Correct 163 ms 15368 KB Output is correct
49 Correct 182 ms 15368 KB Output is correct
50 Correct 158 ms 15364 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1536 KB Output is correct
2 Correct 1 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 1 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 1 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 2 ms 1536 KB Output is correct
18 Correct 2 ms 1536 KB Output is correct
19 Correct 4 ms 1920 KB Output is correct
20 Correct 4 ms 1920 KB Output is correct
21 Correct 4 ms 1920 KB Output is correct
22 Correct 7 ms 2304 KB Output is correct
23 Correct 8 ms 2280 KB Output is correct
24 Correct 8 ms 2304 KB Output is correct
25 Correct 8 ms 2304 KB Output is correct
26 Correct 8 ms 2304 KB Output is correct
27 Correct 222 ms 12100 KB Output is correct
28 Correct 210 ms 13176 KB Output is correct
29 Correct 208 ms 12796 KB Output is correct
30 Correct 208 ms 12604 KB Output is correct
31 Execution timed out 3096 ms 11912 KB Time limit exceeded
32 Halted 0 ms 0 KB -