oj.uz

Submission #334385

# Submission time Handle Problem Language Result Execution time Memory
334385 2020-12-09T05:45:16 Z Seanliu Circle selection (APIO18_circle_selection) C++17
100 / 100
 1432 ms 49664 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <unordered_map>
#include <numeric>
#include <algorithm>
#include <vector>
#define int long long int
#define ericxiao ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;

const int maxN = 3e5 + 326, maxC = 1e9 + 326;
int ans[maxN], x[maxN], y[maxN], r[maxN], N, ord[maxN], curSz;

unordered_map<int, vector<int> > mp;

inline char readchar(){
	const int S = 1<<16;
	static char buf[S], *p = buf, *q = buf;
	return p == q and (q = (p = buf) + fread(buf, 1, S, stdin)) == buf ? EOF : *p++;
}

inline void Read(int &a){
	static char c;
	while(((c = readchar()) < '0' or c > '9') and c != '-' and c != EOF);
	if(c == '-'){
		a = 0;
		while((c = readchar()) >= '0' and c <= '9') a *= 10, a -= c ^ '0';
	} else {
		a = c ^ '0';
		while((c = readchar()) >= '0' and c <= '9') a *= 10, a += c ^ '0';
	}
}

char outbuf[1 << 16]; int outp;
inline void W(int n){
	static char buf[12], p;
	if(n == 0) outbuf[outp++] = '0';
	p = 0;
	if(n < 0){
		outbuf[outp++] = '-';
		while(n) buf[p++] = '0' - (n % 10), n /= 10;
	} else {
		while(n) buf[p++] = '0' + (n % 10), n /= 10;
	}
	for(--p; p >= 0; --p) outbuf[outp++] = buf[p];
	outbuf[outp++] = ' ';
	if(outp > (1 << 16)-12) fwrite(outbuf, 1, outp, stdout), outp = 0;
}

inline void assign(){
	mp = unordered_map<int, vector<int> >();
	for(int i = 1; i <= N; i++){
		if(ans[i]) continue;
		int k = maxC * (x[i] / curSz) + (y[i] / curSz);
		if(!mp.count(k)) mp[k] = vector<int>();
		mp[k].push_back(i);
	}
}

inline bool intersect(int i, int j){
	return (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]) <= r[i] * r[i] + 2 * r[i] * r[j] + r[j] * r[j];
}

inline void kill(int sel){
	int X = x[sel] / curSz, Y = y[sel] / curSz;
	for(int i = (X - 2) * maxC; i <= (X + 2) * maxC; i += maxC){
		for(int j = Y - 2; j <= Y + 2; j++){
			if(!mp.count(i + j)) continue;
			for(int ind : mp[i + j]){
				if(ans[ind]) continue;
				if(intersect(ind, sel)){
					ans[ind] = sel;
				}
			}
		}
	}
}

signed main(){
	Read(N);
	mp.reserve(N);
	for(int i = 1; i <= N; i++){
		Read(x[i]);
		Read(y[i]);
		Read(r[i]);
	}
	iota(ord, ord + N + 1, 0);
	sort(ord + 1, ord + N + 1, [](int a, int b){
		return (r[a] == r[b] ? a < b : r[a] > r[b]);
	});
	curSz = 1LL << 32;
	for(int i = 1; i <= N; i++){
		if(ans[ord[i]]) continue;
		bool f = true;
		while(curSz >= 2 * r[ord[i]]){
			curSz /= 2;	
			f = false;
		}
		if(!f) assign();
		kill(ord[i]);
	}
	for(int i = 1; i <= N; i++) W(ans[i]);
	fwrite(outbuf, 1, outp, stdout);
	puts("");
}

Compilation message

circle_selection.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("Ofast")
      | 
circle_selection.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      | 
circle_selection.cpp: In function 'void W(long long int)':
circle_selection.cpp:42:17: warning: array subscript has type 'char' [-Wchar-subscripts]
   42 |   while(n) buf[p++] = '0' - (n % 10), n /= 10;
      |                ~^~
circle_selection.cpp:44:17: warning: array subscript has type 'char' [-Wchar-subscripts]
   44 |   while(n) buf[p++] = '0' + (n % 10), n /= 10;
      |                ~^~
circle_selection.cpp:46:45: warning: array subscript has type 'char' [-Wchar-subscripts]
   46 |  for(--p; p >= 0; --p) outbuf[outp++] = buf[p];
      |                                             ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 380 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 2 ms 876 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 2 ms 876 KB Output is correct
22 Correct 9 ms 1260 KB Output is correct
23 Correct 10 ms 1260 KB Output is correct
24 Correct 12 ms 1260 KB Output is correct
25 Correct 10 ms 1260 KB Output is correct
26 Correct 9 ms 1260 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 25368 KB Output is correct
2 Correct 110 ms 25344 KB Output is correct
3 Correct 101 ms 24704 KB Output is correct
4 Correct 99 ms 25348 KB Output is correct
5 Correct 148 ms 22840 KB Output is correct
6 Correct 507 ms 30464 KB Output is correct
7 Correct 189 ms 24192 KB Output is correct
8 Correct 237 ms 25856 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 336 ms 15940 KB Output is correct
3 Correct 1310 ms 47744 KB Output is correct
4 Correct 1290 ms 47796 KB Output is correct
5 Correct 1232 ms 43584 KB Output is correct
6 Correct 453 ms 22280 KB Output is correct
7 Correct 164 ms 12240 KB Output is correct
8 Correct 24 ms 2912 KB Output is correct
9 Correct 1418 ms 49172 KB Output is correct
10 Correct 1035 ms 41984 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1059 ms 49664 KB Output is correct
2 Correct 1068 ms 48936 KB Output is correct
3 Correct 286 ms 30464 KB Output is correct
4 Correct 1051 ms 49408 KB Output is correct
5 Correct 1045 ms 49456 KB Output is correct
6 Correct 146 ms 27136 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 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 380 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 2 ms 876 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 2 ms 876 KB Output is correct
22 Correct 9 ms 1260 KB Output is correct
23 Correct 10 ms 1260 KB Output is correct
24 Correct 12 ms 1260 KB Output is correct
25 Correct 10 ms 1260 KB Output is correct
26 Correct 9 ms 1260 KB Output is correct
27 Correct 4 ms 1312 KB Output is correct
28 Correct 3 ms 1388 KB Output is correct
29 Correct 4 ms 1388 KB Output is correct
30 Correct 18 ms 2028 KB Output is correct
31 Correct 20 ms 2028 KB Output is correct
32 Correct 19 ms 2028 KB Output is correct
33 Correct 34 ms 9888 KB Output is correct
34 Correct 35 ms 9888 KB Output is correct
35 Correct 38 ms 9376 KB Output is correct
36 Correct 314 ms 16452 KB Output is correct
37 Correct 308 ms 15904 KB Output is correct
38 Correct 315 ms 15812 KB Output is correct
39 Correct 252 ms 13792 KB Output is correct
40 Correct 248 ms 13792 KB Output is correct
41 Correct 253 ms 13940 KB Output is correct
42 Correct 137 ms 11936 KB Output is correct
43 Correct 251 ms 16288 KB Output is correct
44 Correct 253 ms 16160 KB Output is correct
45 Correct 254 ms 16160 KB Output is correct
46 Correct 261 ms 16160 KB Output is correct
47 Correct 271 ms 16468 KB Output is correct
48 Correct 263 ms 16288 KB Output is correct
49 Correct 263 ms 16160 KB Output is correct
50 Correct 271 ms 16160 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 380 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 2 ms 876 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 2 ms 876 KB Output is correct
22 Correct 9 ms 1260 KB Output is correct
23 Correct 10 ms 1260 KB Output is correct
24 Correct 12 ms 1260 KB Output is correct
25 Correct 10 ms 1260 KB Output is correct
26 Correct 9 ms 1260 KB Output is correct
27 Correct 102 ms 25368 KB Output is correct
28 Correct 110 ms 25344 KB Output is correct
29 Correct 101 ms 24704 KB Output is correct
30 Correct 99 ms 25348 KB Output is correct
31 Correct 148 ms 22840 KB Output is correct
32 Correct 507 ms 30464 KB Output is correct
33 Correct 189 ms 24192 KB Output is correct
34 Correct 237 ms 25856 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 336 ms 15940 KB Output is correct
37 Correct 1310 ms 47744 KB Output is correct
38 Correct 1290 ms 47796 KB Output is correct
39 Correct 1232 ms 43584 KB Output is correct
40 Correct 453 ms 22280 KB Output is correct
41 Correct 164 ms 12240 KB Output is correct
42 Correct 24 ms 2912 KB Output is correct
43 Correct 1418 ms 49172 KB Output is correct
44 Correct 1035 ms 41984 KB Output is correct
45 Correct 1059 ms 49664 KB Output is correct
46 Correct 1068 ms 48936 KB Output is correct
47 Correct 286 ms 30464 KB Output is correct
48 Correct 1051 ms 49408 KB Output is correct
49 Correct 1045 ms 49456 KB Output is correct
50 Correct 146 ms 27136 KB Output is correct
51 Correct 4 ms 1312 KB Output is correct
52 Correct 3 ms 1388 KB Output is correct
53 Correct 4 ms 1388 KB Output is correct
54 Correct 18 ms 2028 KB Output is correct
55 Correct 20 ms 2028 KB Output is correct
56 Correct 19 ms 2028 KB Output is correct
57 Correct 34 ms 9888 KB Output is correct
58 Correct 35 ms 9888 KB Output is correct
59 Correct 38 ms 9376 KB Output is correct
60 Correct 314 ms 16452 KB Output is correct
61 Correct 308 ms 15904 KB Output is correct
62 Correct 315 ms 15812 KB Output is correct
63 Correct 252 ms 13792 KB Output is correct
64 Correct 248 ms 13792 KB Output is correct
65 Correct 253 ms 13940 KB Output is correct
66 Correct 137 ms 11936 KB Output is correct
67 Correct 251 ms 16288 KB Output is correct
68 Correct 253 ms 16160 KB Output is correct
69 Correct 254 ms 16160 KB Output is correct
70 Correct 261 ms 16160 KB Output is correct
71 Correct 271 ms 16468 KB Output is correct
72 Correct 263 ms 16288 KB Output is correct
73 Correct 263 ms 16160 KB Output is correct
74 Correct 271 ms 16160 KB Output is correct
75 Correct 136 ms 25732 KB Output is correct
76 Correct 110 ms 26880 KB Output is correct
77 Correct 109 ms 29588 KB Output is correct
78 Correct 105 ms 29452 KB Output is correct
79 Correct 190 ms 24836 KB Output is correct
80 Correct 102 ms 29440 KB Output is correct
81 Correct 1419 ms 47892 KB Output is correct
82 Correct 1269 ms 47616 KB Output is correct
83 Correct 1365 ms 47488 KB Output is correct
84 Correct 1324 ms 48000 KB Output is correct
85 Correct 1304 ms 47616 KB Output is correct
86 Correct 1243 ms 47872 KB Output is correct
87 Correct 1375 ms 47488 KB Output is correct
88 Correct 970 ms 43732 KB Output is correct
89 Correct 983 ms 43616 KB Output is correct
90 Correct 972 ms 43616 KB Output is correct
91 Correct 961 ms 43800 KB Output is correct
92 Correct 959 ms 43884 KB Output is correct
93 Correct 1333 ms 46648 KB Output is correct
94 Correct 1212 ms 46848 KB Output is correct
95 Correct 1432 ms 46732 KB Output is correct
96 Correct 1255 ms 46720 KB Output is correct
97 Correct 1374 ms 46592 KB Output is correct
98 Correct 668 ms 35748 KB Output is correct
99 Correct 1351 ms 46708 KB Output is correct
100 Correct 1173 ms 46592 KB Output is correct
101 Correct 901 ms 39184 KB Output is correct
102 Correct 1211 ms 46080 KB Output is correct
103 Correct 1340 ms 47892 KB Output is correct
104 Correct 1247 ms 46612 KB Output is correct
105 Correct 585 ms 35520 KB Output is correct
106 Correct 874 ms 48128 KB Output is correct
107 Correct 862 ms 48128 KB Output is correct
108 Correct 860 ms 48128 KB Output is correct
109 Correct 892 ms 48128 KB Output is correct
110 Correct 865 ms 48128 KB Output is correct
111 Correct 887 ms 48136 KB Output is correct
112 Correct 879 ms 48128 KB Output is correct
113 Correct 878 ms 48152 KB Output is correct
114 Correct 900 ms 48048 KB Output is correct
115 Correct 851 ms 48092 KB Output is correct
116 Correct 852 ms 48028 KB Output is correct