oj.uz

Submission #254310

# Submission time Handle Problem Language Result Execution time Memory
254310 2020-07-29T20:16:35 Z shayan_p Circle selection (APIO18_circle_selection) C++14
19 / 100
 3000 ms 44180 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;
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);

    reSize();
    for(int I = n-1; I >= 0; I--){
	int i = arr[I];
	while(Log > 0 && (1<<(Log-1)) >= p[i].S)
	    Log--, 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);
			}
			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 1 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 2 ms 1536 KB Output is correct
8 Correct 1 ms 1536 KB Output is correct
9 Correct 2 ms 1536 KB Output is correct
10 Correct 1 ms 1536 KB Output is correct
11 Correct 2 ms 1536 KB Output is correct
12 Correct 2 ms 1536 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 2 ms 1536 KB Output is correct
15 Correct 2 ms 1536 KB Output is correct
16 Correct 2 ms 1664 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 5 ms 1920 KB Output is correct
22 Correct 26 ms 2424 KB Output is correct
23 Correct 28 ms 2424 KB Output is correct
24 Correct 29 ms 2432 KB Output is correct
25 Correct 29 ms 2424 KB Output is correct
26 Correct 27 ms 2424 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 15044 KB Output is correct
2 Correct 219 ms 16072 KB Output is correct
3 Correct 218 ms 15492 KB Output is correct
4 Correct 213 ms 15300 KB Output is correct
5 Correct 491 ms 15396 KB Output is correct
6 Correct 1435 ms 25908 KB Output is correct
7 Correct 581 ms 16468 KB Output is correct
8 Correct 742 ms 18692 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1536 KB Output is correct
2 Correct 882 ms 16384 KB Output is correct
3 Execution timed out 3064 ms 44180 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
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 1 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 2 ms 1536 KB Output is correct
8 Correct 1 ms 1536 KB Output is correct
9 Correct 2 ms 1536 KB Output is correct
10 Correct 1 ms 1536 KB Output is correct
11 Correct 2 ms 1536 KB Output is correct
12 Correct 2 ms 1536 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 2 ms 1536 KB Output is correct
15 Correct 2 ms 1536 KB Output is correct
16 Correct 2 ms 1664 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 5 ms 1920 KB Output is correct
22 Correct 26 ms 2424 KB Output is correct
23 Correct 28 ms 2424 KB Output is correct
24 Correct 29 ms 2432 KB Output is correct
25 Correct 29 ms 2424 KB Output is correct
26 Correct 27 ms 2424 KB Output is correct
27 Correct 12 ms 2176 KB Output is correct
28 Correct 8 ms 2048 KB Output is correct
29 Correct 8 ms 2048 KB Output is correct
30 Correct 60 ms 3088 KB Output is correct
31 Correct 54 ms 3064 KB Output is correct
32 Correct 58 ms 3064 KB Output is correct
33 Correct 74 ms 5256 KB Output is correct
34 Correct 75 ms 5356 KB Output is correct
35 Correct 76 ms 6152 KB Output is correct
36 Correct 1291 ms 16336 KB Output is correct
37 Correct 1062 ms 16464 KB Output is correct
38 Correct 1188 ms 16512 KB Output is correct
39 Runtime error 59 ms 11288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
40 Halted 0 ms 0 KB -

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 1 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 2 ms 1536 KB Output is correct
8 Correct 1 ms 1536 KB Output is correct
9 Correct 2 ms 1536 KB Output is correct
10 Correct 1 ms 1536 KB Output is correct
11 Correct 2 ms 1536 KB Output is correct
12 Correct 2 ms 1536 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 2 ms 1536 KB Output is correct
15 Correct 2 ms 1536 KB Output is correct
16 Correct 2 ms 1664 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 5 ms 1920 KB Output is correct
22 Correct 26 ms 2424 KB Output is correct
23 Correct 28 ms 2424 KB Output is correct
24 Correct 29 ms 2432 KB Output is correct
25 Correct 29 ms 2424 KB Output is correct
26 Correct 27 ms 2424 KB Output is correct
27 Correct 209 ms 15044 KB Output is correct
28 Correct 219 ms 16072 KB Output is correct
29 Correct 218 ms 15492 KB Output is correct
30 Correct 213 ms 15300 KB Output is correct
31 Correct 491 ms 15396 KB Output is correct
32 Correct 1435 ms 25908 KB Output is correct
33 Correct 581 ms 16468 KB Output is correct
34 Correct 742 ms 18692 KB Output is correct
35 Correct 1 ms 1536 KB Output is correct
36 Correct 882 ms 16384 KB Output is correct
37 Execution timed out 3064 ms 44180 KB Time limit exceeded
38 Halted 0 ms 0 KB -