oj.uz

Submission #262992

# Submission time Handle Problem Language Result Execution time Memory
262992 2020-08-13T11:43:17 Z _7_7_ Circle selection (APIO18_circle_selection) C++14
100 / 100
 2773 ms 45404 KB 
#include <bits/stdc++.h>                                           
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;  
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;
typedef long long ll;
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 3e5 + 12;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;
 

struct point {
	int x, y, r, id;
	bool operator < (const point &a) const {
		if (r != a.r)
			return r > a.r;
		return id < a.id;
	}
} a[N];

int n, res[N], bl;
set < pii > q;
vpii vals;
pii b[N];
vi m[N];

inline int getId (pii x) {
	return lower_bound(all(vals), x) - vals.begin();
}

inline bool check (int i, int j) {
	return (a[i].x - a[j].x) * 1ll * (a[i].x - a[j].x) + (a[i].y - a[j].y) * 1ll * (a[i].y - a[j].y) <= (a[i].r + a[j].r) * 1ll * (a[i].r + a[j].r);
}


inline void build () {
	vals.clear();
	q.clear();
	for (int i = 1; i <= n; ++i)
		if (!res[a[i].id]) {
			b[i] = mp(a[i].x / bl, a[i].y / bl);
			vals.pb(b[i]);
			q.insert(b[i]);
		}

	sort(all(vals));
	vals.resize(unique(all(vals)) - vals.begin());

	for (int i = 0; i < sz(vals); ++i)
		m[i].clear();

	for (int i = 1; i <= n; ++i)
		if (!res[a[i].id])
			m[getId(b[i])].pb(i);
}

main () {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].r);
		a[i].id = i;
	}

	sort(a + 1, a + 1 + n);
	        	
	bl = a[1].r;
	build();

	for (int i = 1; i <= n; ++i) 
		if (!res[a[i].id]) {
			if (a[i].r + a[i].r <= bl) {
				bl = a[i].r;
				build();
			}

			vector < point > V;
			point Mn;
			Mn.r = -inf;

			for (int c = -2; c <= 2; ++c)
				for (int d = -2; d <= 2; ++d) {
				    pii cur = mp(b[i].f + c, b[i].s + d);
					if (!q.count(cur)) 
						continue;

					int z = getId(cur);	

					for (auto j : m[z])
						if (!res[a[j].id] && check(i, j)) {
							if (a[j] < Mn) 
								Mn = a[j];
							V.pb(a[j]);
						}
				}

			if (Mn < a[i]) {
				res[a[i].id] = Mn.id; 
			    continue;
			}

			res[a[i].id] = a[i].id;
			for (auto j : V)
				res[j.id] = a[i].id;
		}
	
	for (int i = 1; i <= n; ++i)
		printf("%d ", res[i]);
}

Compilation message

circle_selection.cpp:90:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   90 | main () {
      |       ^
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:91:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   91 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
circle_selection.cpp:93:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   93 |   scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
circle_selection.cpp:130:18: warning: 'Mn.point::id' may be used uninitialized in this function [-Wmaybe-uninitialized]
  130 |     res[a[i].id] = Mn.id;
      |     ~~~~~~~~~~~~~^~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 6 ms 7424 KB Output is correct
3 Correct 7 ms 7348 KB Output is correct
4 Correct 6 ms 7424 KB Output is correct
5 Correct 6 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 6 ms 7424 KB Output is correct
8 Correct 6 ms 7424 KB Output is correct
9 Correct 6 ms 7424 KB Output is correct
10 Correct 6 ms 7424 KB Output is correct
11 Correct 5 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 7 ms 7424 KB Output is correct
14 Correct 6 ms 7424 KB Output is correct
15 Correct 8 ms 7424 KB Output is correct
16 Correct 6 ms 7424 KB Output is correct
17 Correct 6 ms 7424 KB Output is correct
18 Correct 6 ms 7424 KB Output is correct
19 Correct 12 ms 7936 KB Output is correct
20 Correct 10 ms 7936 KB Output is correct
21 Correct 10 ms 7808 KB Output is correct
22 Correct 22 ms 8064 KB Output is correct
23 Correct 29 ms 8064 KB Output is correct
24 Correct 21 ms 8064 KB Output is correct
25 Correct 20 ms 8064 KB Output is correct
26 Correct 22 ms 8064 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 30692 KB Output is correct
2 Correct 247 ms 28584 KB Output is correct
3 Correct 238 ms 27996 KB Output is correct
4 Correct 242 ms 31680 KB Output is correct
5 Correct 388 ms 22616 KB Output is correct
6 Correct 1018 ms 32032 KB Output is correct
7 Correct 429 ms 23520 KB Output is correct
8 Correct 536 ms 25180 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 592 ms 19720 KB Output is correct
3 Correct 2411 ms 43940 KB Output is correct
4 Correct 2430 ms 43932 KB Output is correct
5 Correct 2545 ms 39388 KB Output is correct
6 Correct 733 ms 23428 KB Output is correct
7 Correct 297 ms 16236 KB Output is correct
8 Correct 47 ms 9340 KB Output is correct
9 Correct 2740 ms 43244 KB Output is correct
10 Correct 2141 ms 40540 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1978 ms 44172 KB Output is correct
2 Correct 1427 ms 43912 KB Output is correct
3 Correct 690 ms 27480 KB Output is correct
4 Correct 1427 ms 44008 KB Output is correct
5 Correct 1399 ms 44044 KB Output is correct
6 Correct 414 ms 23088 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 6 ms 7424 KB Output is correct
3 Correct 7 ms 7348 KB Output is correct
4 Correct 6 ms 7424 KB Output is correct
5 Correct 6 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 6 ms 7424 KB Output is correct
8 Correct 6 ms 7424 KB Output is correct
9 Correct 6 ms 7424 KB Output is correct
10 Correct 6 ms 7424 KB Output is correct
11 Correct 5 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 7 ms 7424 KB Output is correct
14 Correct 6 ms 7424 KB Output is correct
15 Correct 8 ms 7424 KB Output is correct
16 Correct 6 ms 7424 KB Output is correct
17 Correct 6 ms 7424 KB Output is correct
18 Correct 6 ms 7424 KB Output is correct
19 Correct 12 ms 7936 KB Output is correct
20 Correct 10 ms 7936 KB Output is correct
21 Correct 10 ms 7808 KB Output is correct
22 Correct 22 ms 8064 KB Output is correct
23 Correct 29 ms 8064 KB Output is correct
24 Correct 21 ms 8064 KB Output is correct
25 Correct 20 ms 8064 KB Output is correct
26 Correct 22 ms 8064 KB Output is correct
27 Correct 15 ms 8336 KB Output is correct
28 Correct 15 ms 8352 KB Output is correct
29 Correct 13 ms 8336 KB Output is correct
30 Correct 43 ms 8704 KB Output is correct
31 Correct 39 ms 8744 KB Output is correct
32 Correct 43 ms 8832 KB Output is correct
33 Correct 91 ms 14408 KB Output is correct
34 Correct 91 ms 14572 KB Output is correct
35 Correct 101 ms 14444 KB Output is correct
36 Correct 514 ms 19592 KB Output is correct
37 Correct 525 ms 19688 KB Output is correct
38 Correct 510 ms 19672 KB Output is correct
39 Correct 469 ms 19564 KB Output is correct
40 Correct 472 ms 19564 KB Output is correct
41 Correct 499 ms 19688 KB Output is correct
42 Correct 401 ms 19552 KB Output is correct
43 Correct 360 ms 19560 KB Output is correct
44 Correct 360 ms 19564 KB Output is correct
45 Correct 362 ms 19540 KB Output is correct
46 Correct 353 ms 19436 KB Output is correct
47 Correct 351 ms 19564 KB Output is correct
48 Correct 361 ms 19120 KB Output is correct
49 Correct 373 ms 19180 KB Output is correct
50 Correct 382 ms 19180 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 6 ms 7424 KB Output is correct
3 Correct 7 ms 7348 KB Output is correct
4 Correct 6 ms 7424 KB Output is correct
5 Correct 6 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 6 ms 7424 KB Output is correct
8 Correct 6 ms 7424 KB Output is correct
9 Correct 6 ms 7424 KB Output is correct
10 Correct 6 ms 7424 KB Output is correct
11 Correct 5 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 7 ms 7424 KB Output is correct
14 Correct 6 ms 7424 KB Output is correct
15 Correct 8 ms 7424 KB Output is correct
16 Correct 6 ms 7424 KB Output is correct
17 Correct 6 ms 7424 KB Output is correct
18 Correct 6 ms 7424 KB Output is correct
19 Correct 12 ms 7936 KB Output is correct
20 Correct 10 ms 7936 KB Output is correct
21 Correct 10 ms 7808 KB Output is correct
22 Correct 22 ms 8064 KB Output is correct
23 Correct 29 ms 8064 KB Output is correct
24 Correct 21 ms 8064 KB Output is correct
25 Correct 20 ms 8064 KB Output is correct
26 Correct 22 ms 8064 KB Output is correct
27 Correct 268 ms 30692 KB Output is correct
28 Correct 247 ms 28584 KB Output is correct
29 Correct 238 ms 27996 KB Output is correct
30 Correct 242 ms 31680 KB Output is correct
31 Correct 388 ms 22616 KB Output is correct
32 Correct 1018 ms 32032 KB Output is correct
33 Correct 429 ms 23520 KB Output is correct
34 Correct 536 ms 25180 KB Output is correct
35 Correct 5 ms 7424 KB Output is correct
36 Correct 592 ms 19720 KB Output is correct
37 Correct 2411 ms 43940 KB Output is correct
38 Correct 2430 ms 43932 KB Output is correct
39 Correct 2545 ms 39388 KB Output is correct
40 Correct 733 ms 23428 KB Output is correct
41 Correct 297 ms 16236 KB Output is correct
42 Correct 47 ms 9340 KB Output is correct
43 Correct 2740 ms 43244 KB Output is correct
44 Correct 2141 ms 40540 KB Output is correct
45 Correct 1978 ms 44172 KB Output is correct
46 Correct 1427 ms 43912 KB Output is correct
47 Correct 690 ms 27480 KB Output is correct
48 Correct 1427 ms 44008 KB Output is correct
49 Correct 1399 ms 44044 KB Output is correct
50 Correct 414 ms 23088 KB Output is correct
51 Correct 15 ms 8336 KB Output is correct
52 Correct 15 ms 8352 KB Output is correct
53 Correct 13 ms 8336 KB Output is correct
54 Correct 43 ms 8704 KB Output is correct
55 Correct 39 ms 8744 KB Output is correct
56 Correct 43 ms 8832 KB Output is correct
57 Correct 91 ms 14408 KB Output is correct
58 Correct 91 ms 14572 KB Output is correct
59 Correct 101 ms 14444 KB Output is correct
60 Correct 514 ms 19592 KB Output is correct
61 Correct 525 ms 19688 KB Output is correct
62 Correct 510 ms 19672 KB Output is correct
63 Correct 469 ms 19564 KB Output is correct
64 Correct 472 ms 19564 KB Output is correct
65 Correct 499 ms 19688 KB Output is correct
66 Correct 401 ms 19552 KB Output is correct
67 Correct 360 ms 19560 KB Output is correct
68 Correct 360 ms 19564 KB Output is correct
69 Correct 362 ms 19540 KB Output is correct
70 Correct 353 ms 19436 KB Output is correct
71 Correct 351 ms 19564 KB Output is correct
72 Correct 361 ms 19120 KB Output is correct
73 Correct 373 ms 19180 KB Output is correct
74 Correct 382 ms 19180 KB Output is correct
75 Correct 332 ms 31708 KB Output is correct
76 Correct 282 ms 28876 KB Output is correct
77 Correct 270 ms 31708 KB Output is correct
78 Correct 257 ms 31612 KB Output is correct
79 Correct 367 ms 23648 KB Output is correct
80 Correct 270 ms 31456 KB Output is correct
81 Correct 2287 ms 44564 KB Output is correct
82 Correct 2269 ms 44512 KB Output is correct
83 Correct 2338 ms 44432 KB Output is correct
84 Correct 2591 ms 44384 KB Output is correct
85 Correct 2291 ms 44596 KB Output is correct
86 Correct 2117 ms 44528 KB Output is correct
87 Correct 2542 ms 44276 KB Output is correct
88 Correct 1970 ms 45404 KB Output is correct
89 Correct 2080 ms 45244 KB Output is correct
90 Correct 2011 ms 44116 KB Output is correct
91 Correct 1845 ms 44756 KB Output is correct
92 Correct 1971 ms 43608 KB Output is correct
93 Correct 1761 ms 43772 KB Output is correct
94 Correct 1943 ms 43484 KB Output is correct
95 Correct 1801 ms 43704 KB Output is correct
96 Correct 1988 ms 43668 KB Output is correct
97 Correct 2773 ms 43736 KB Output is correct
98 Correct 1174 ms 35372 KB Output is correct
99 Correct 1816 ms 43908 KB Output is correct
100 Correct 1688 ms 44048 KB Output is correct
101 Correct 1712 ms 38828 KB Output is correct
102 Correct 1867 ms 43512 KB Output is correct
103 Correct 2388 ms 43612 KB Output is correct
104 Correct 1705 ms 43824 KB Output is correct
105 Correct 1677 ms 43492 KB Output is correct
106 Correct 1507 ms 42204 KB Output is correct
107 Correct 1423 ms 42296 KB Output is correct
108 Correct 1343 ms 42272 KB Output is correct
109 Correct 1352 ms 42364 KB Output is correct
110 Correct 1350 ms 42412 KB Output is correct
111 Correct 1350 ms 42332 KB Output is correct
112 Correct 1326 ms 41948 KB Output is correct
113 Correct 1302 ms 41860 KB Output is correct
114 Correct 1374 ms 41948 KB Output is correct
115 Correct 1441 ms 41852 KB Output is correct
116 Correct 1310 ms 42084 KB Output is correct