oj.uz

Submission #75662

# Submission time Handle Problem Language Result Execution time Memory
75662 2018-09-10T17:07:41 Z tmwilliamlin168 Circle selection (APIO18_circle_selection) C++14
64 / 100
 3000 ms 38320 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define getchar_unlocked getchar
#define putchar_unlocked putchar

inline int in() {
	bool minus = false;
	int result = 0;
	char ch = getchar_unlocked();
	while(true) {
		if(ch == '-')
			break;
		if(ch >= '0' && ch <= '9')
			break;
		ch = getchar_unlocked();
	}
	if(ch == '-')
		minus = true;
	else
		result = ch-'0';
	while(true) {
		ch = getchar_unlocked();
		if (ch < '0' || ch > '9')
			break;
		result = result*10 + (ch - '0');
	}
	return minus?-result:result;
}
inline void out(int x) {
	int rev=x, c=0;
	while(!(rev%10)) {
		++c;
		rev/=10;
	}
	rev=0;
	while(x) {
		rev=rev*10+x%10;
		x/=10;
	}
	while(rev) {
		putchar_unlocked(rev%10+'0');
		rev/=10;
	}
	while(c--)
		putchar_unlocked('0');
}

const int mxN=3e5;
int n, p[mxN], p2[mxN], a[mxN];
ll x[mxN], y[mxN], r[mxN];
unordered_map<int, vector<array<int, 2>>> mp;

void rs(int k) {
	mp.clear();
	for(int i=0; i<n; ++i)
		if(a[p2[i]]==-1)
			mp[x[p2[i]]>>k].push_back({y[p2[i]]>>k, p2[i]});
}

int main() {
	n=in();
	for(int i=0; i<n; ++i) {
		x[i]=in(), y[i]=in(), r[i]=in();
		p[i]=p2[i]=i;
	}
	sort(p, p+n, [&](const int &a, const int &b) {
		return r[a]==r[b]?a<b:r[a]>r[b];
	});
	sort(p2, p2+n, [&](const int &a, const int &b) {
		return y[a]<y[b];
	});
	memset(a, -1, 4*n);
	for(int i=-1, k=30; i+1<n; --i, --k) {
		rs(k);
		while(++i<n&&r[p[i]]>=1<<(k-1)) {
			if(a[p[i]]!=-1)
				continue;
			for(ll b=(x[p[i]]>>k)-2; b<=(x[p[i]]>>k)+2; ++b) {
				auto mf=mp.find(b);
				if(mf==mp.end())
					continue;
				vector<array<int, 2>> &v=mf->second;
				for(int j=lower_bound(v.begin(), v.end(), array<int, 2>{(y[p[i]]>>k)-2, 0})-v.begin(); j<v.size()&&v[j][0]<=(y[p[i]]>>k)+2; ++j) {
					ll dx=x[p[i]]-x[v[j][1]], dy=y[p[i]]-y[v[j][1]], rs=r[p[i]]+r[v[j][1]];
					if(dx*dx+dy*dy<=rs*rs&&a[v[j][1]]==-1)
						a[v[j][1]]=p[i];
				}
			}
		}
	}
	for(int i=0; i<n; ++i) {
		out(a[i]+1);
		putchar_unlocked(' ');
	}
}

Compilation message

circle_selection.cpp: In function 'void rs(int)':
circle_selection.cpp:59:39: warning: narrowing conversion of '(y[p2[i]] >> k)' from 'long long int' to 'int' inside { } [-Wnarrowing]
    mp[x[p2[i]]>>k].push_back({y[p2[i]]>>k, p2[i]});
                               ~~~~~~~~^~~
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:85:73: warning: narrowing conversion of '((y[p[i]] >> k) - 2)' from 'long long int' to 'int' inside { } [-Wnarrowing]
     for(int j=lower_bound(v.begin(), v.end(), array<int, 2>{(y[p[i]]>>k)-2, 0})-v.begin(); j<v.size()&&v[j][0]<=(y[p[i]]>>k)+2; ++j) {
                                                             ~~~~~~~~~~~~^~
circle_selection.cpp:85:93: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=lower_bound(v.begin(), v.end(), array<int, 2>{(y[p[i]]>>k)-2, 0})-v.begin(); j<v.size()&&v[j][0]<=(y[p[i]]>>k)+2; ++j) {
                                                                                            ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 448 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 2 ms 448 KB Output is correct
8 Correct 2 ms 548 KB Output is correct
9 Correct 2 ms 548 KB Output is correct
10 Correct 2 ms 548 KB Output is correct
11 Correct 2 ms 548 KB Output is correct
12 Correct 2 ms 624 KB Output is correct
13 Correct 2 ms 624 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 3 ms 624 KB Output is correct
17 Correct 3 ms 624 KB Output is correct
18 Correct 3 ms 624 KB Output is correct
19 Correct 5 ms 876 KB Output is correct
20 Correct 6 ms 892 KB Output is correct
21 Correct 5 ms 908 KB Output is correct
22 Correct 12 ms 1052 KB Output is correct
23 Correct 9 ms 1052 KB Output is correct
24 Correct 13 ms 1072 KB Output is correct
25 Correct 20 ms 1324 KB Output is correct
26 Correct 13 ms 1324 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 15312 KB Output is correct
2 Correct 222 ms 15856 KB Output is correct
3 Correct 214 ms 15856 KB Output is correct
4 Correct 188 ms 15856 KB Output is correct
5 Correct 447 ms 17792 KB Output is correct
6 Correct 752 ms 25532 KB Output is correct
7 Correct 410 ms 25532 KB Output is correct
8 Correct 526 ms 25532 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 25532 KB Output is correct
2 Correct 224 ms 25532 KB Output is correct
3 Correct 1018 ms 25532 KB Output is correct
4 Correct 1049 ms 25532 KB Output is correct
5 Correct 741 ms 25532 KB Output is correct
6 Correct 297 ms 25532 KB Output is correct
7 Correct 152 ms 25532 KB Output is correct
8 Correct 35 ms 25532 KB Output is correct
9 Correct 864 ms 25532 KB Output is correct
10 Correct 666 ms 25532 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 978 ms 25532 KB Output is correct
2 Execution timed out 3035 ms 38320 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 448 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 2 ms 448 KB Output is correct
8 Correct 2 ms 548 KB Output is correct
9 Correct 2 ms 548 KB Output is correct
10 Correct 2 ms 548 KB Output is correct
11 Correct 2 ms 548 KB Output is correct
12 Correct 2 ms 624 KB Output is correct
13 Correct 2 ms 624 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 3 ms 624 KB Output is correct
17 Correct 3 ms 624 KB Output is correct
18 Correct 3 ms 624 KB Output is correct
19 Correct 5 ms 876 KB Output is correct
20 Correct 6 ms 892 KB Output is correct
21 Correct 5 ms 908 KB Output is correct
22 Correct 12 ms 1052 KB Output is correct
23 Correct 9 ms 1052 KB Output is correct
24 Correct 13 ms 1072 KB Output is correct
25 Correct 20 ms 1324 KB Output is correct
26 Correct 13 ms 1324 KB Output is correct
27 Correct 9 ms 38320 KB Output is correct
28 Correct 10 ms 38320 KB Output is correct
29 Correct 8 ms 38320 KB Output is correct
30 Correct 18 ms 38320 KB Output is correct
31 Correct 23 ms 38320 KB Output is correct
32 Correct 34 ms 38320 KB Output is correct
33 Correct 79 ms 38320 KB Output is correct
34 Correct 86 ms 38320 KB Output is correct
35 Correct 92 ms 38320 KB Output is correct
36 Correct 249 ms 38320 KB Output is correct
37 Correct 254 ms 38320 KB Output is correct
38 Correct 243 ms 38320 KB Output is correct
39 Correct 302 ms 38320 KB Output is correct
40 Correct 308 ms 38320 KB Output is correct
41 Correct 293 ms 38320 KB Output is correct
42 Correct 185 ms 38320 KB Output is correct
43 Correct 373 ms 38320 KB Output is correct
44 Correct 362 ms 38320 KB Output is correct
45 Correct 345 ms 38320 KB Output is correct
46 Correct 349 ms 38320 KB Output is correct
47 Correct 321 ms 38320 KB Output is correct
48 Correct 361 ms 38320 KB Output is correct
49 Correct 374 ms 38320 KB Output is correct
50 Correct 374 ms 38320 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 448 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 2 ms 448 KB Output is correct
8 Correct 2 ms 548 KB Output is correct
9 Correct 2 ms 548 KB Output is correct
10 Correct 2 ms 548 KB Output is correct
11 Correct 2 ms 548 KB Output is correct
12 Correct 2 ms 624 KB Output is correct
13 Correct 2 ms 624 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 3 ms 624 KB Output is correct
17 Correct 3 ms 624 KB Output is correct
18 Correct 3 ms 624 KB Output is correct
19 Correct 5 ms 876 KB Output is correct
20 Correct 6 ms 892 KB Output is correct
21 Correct 5 ms 908 KB Output is correct
22 Correct 12 ms 1052 KB Output is correct
23 Correct 9 ms 1052 KB Output is correct
24 Correct 13 ms 1072 KB Output is correct
25 Correct 20 ms 1324 KB Output is correct
26 Correct 13 ms 1324 KB Output is correct
27 Correct 203 ms 15312 KB Output is correct
28 Correct 222 ms 15856 KB Output is correct
29 Correct 214 ms 15856 KB Output is correct
30 Correct 188 ms 15856 KB Output is correct
31 Correct 447 ms 17792 KB Output is correct
32 Correct 752 ms 25532 KB Output is correct
33 Correct 410 ms 25532 KB Output is correct
34 Correct 526 ms 25532 KB Output is correct
35 Correct 2 ms 25532 KB Output is correct
36 Correct 224 ms 25532 KB Output is correct
37 Correct 1018 ms 25532 KB Output is correct
38 Correct 1049 ms 25532 KB Output is correct
39 Correct 741 ms 25532 KB Output is correct
40 Correct 297 ms 25532 KB Output is correct
41 Correct 152 ms 25532 KB Output is correct
42 Correct 35 ms 25532 KB Output is correct
43 Correct 864 ms 25532 KB Output is correct
44 Correct 666 ms 25532 KB Output is correct
45 Correct 978 ms 25532 KB Output is correct
46 Execution timed out 3035 ms 38320 KB Time limit exceeded
47 Halted 0 ms 0 KB -