oj.uz

Submission #262979

# Submission time Handle Problem Language Result Execution time Memory
262979 2020-08-13T11:36:51 Z _7_7_ Circle selection (APIO18_circle_selection) C++14
100 / 100
 2888 ms 51788 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];

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

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);
}


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 5 ms 7424 KB Output is correct
3 Correct 6 ms 7424 KB Output is correct
4 Correct 6 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 6 ms 7424 KB Output is correct
11 Correct 7 ms 7424 KB Output is correct
12 Correct 6 ms 7424 KB Output is correct
13 Correct 5 ms 7424 KB Output is correct
14 Correct 5 ms 7424 KB Output is correct
15 Correct 5 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 9 ms 7936 KB Output is correct
20 Correct 12 ms 7936 KB Output is correct
21 Correct 10 ms 7936 KB Output is correct
22 Correct 22 ms 8064 KB Output is correct
23 Correct 23 ms 8064 KB Output is correct
24 Correct 21 ms 8064 KB Output is correct
25 Correct 26 ms 8112 KB Output is correct
26 Correct 24 ms 8144 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 229 ms 31588 KB Output is correct
2 Correct 255 ms 29368 KB Output is correct
3 Correct 239 ms 28940 KB Output is correct
4 Correct 235 ms 32612 KB Output is correct
5 Correct 344 ms 23760 KB Output is correct
6 Correct 1025 ms 33032 KB Output is correct
7 Correct 413 ms 24424 KB Output is correct
8 Correct 557 ms 26080 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 571 ms 20840 KB Output is correct
3 Correct 2404 ms 44696 KB Output is correct
4 Correct 2284 ms 51532 KB Output is correct
5 Correct 2363 ms 46864 KB Output is correct
6 Correct 827 ms 27244 KB Output is correct
7 Correct 320 ms 18024 KB Output is correct
8 Correct 48 ms 9596 KB Output is correct
9 Correct 2888 ms 50912 KB Output is correct
10 Correct 2151 ms 46236 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1858 ms 44636 KB Output is correct
2 Correct 1521 ms 50512 KB Output is correct
3 Correct 739 ms 35292 KB Output is correct
4 Correct 1569 ms 50872 KB Output is correct
5 Correct 1522 ms 51036 KB Output is correct
6 Correct 400 ms 30812 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 5 ms 7424 KB Output is correct
3 Correct 6 ms 7424 KB Output is correct
4 Correct 6 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 6 ms 7424 KB Output is correct
11 Correct 7 ms 7424 KB Output is correct
12 Correct 6 ms 7424 KB Output is correct
13 Correct 5 ms 7424 KB Output is correct
14 Correct 5 ms 7424 KB Output is correct
15 Correct 5 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 9 ms 7936 KB Output is correct
20 Correct 12 ms 7936 KB Output is correct
21 Correct 10 ms 7936 KB Output is correct
22 Correct 22 ms 8064 KB Output is correct
23 Correct 23 ms 8064 KB Output is correct
24 Correct 21 ms 8064 KB Output is correct
25 Correct 26 ms 8112 KB Output is correct
26 Correct 24 ms 8144 KB Output is correct
27 Correct 14 ms 8464 KB Output is correct
28 Correct 14 ms 8448 KB Output is correct
29 Correct 13 ms 8464 KB Output is correct
30 Correct 41 ms 8832 KB Output is correct
31 Correct 40 ms 8832 KB Output is correct
32 Correct 40 ms 8832 KB Output is correct
33 Correct 92 ms 15724 KB Output is correct
34 Correct 89 ms 15724 KB Output is correct
35 Correct 100 ms 15724 KB Output is correct
36 Correct 506 ms 20972 KB Output is correct
37 Correct 523 ms 20840 KB Output is correct
38 Correct 531 ms 20952 KB Output is correct
39 Correct 519 ms 20588 KB Output is correct
40 Correct 471 ms 20472 KB Output is correct
41 Correct 448 ms 20716 KB Output is correct
42 Correct 401 ms 20972 KB Output is correct
43 Correct 356 ms 20776 KB Output is correct
44 Correct 380 ms 20780 KB Output is correct
45 Correct 356 ms 20716 KB Output is correct
46 Correct 361 ms 20712 KB Output is correct
47 Correct 356 ms 20712 KB Output is correct
48 Correct 362 ms 20696 KB Output is correct
49 Correct 357 ms 20716 KB Output is correct
50 Correct 357 ms 20716 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 5 ms 7424 KB Output is correct
3 Correct 6 ms 7424 KB Output is correct
4 Correct 6 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 6 ms 7424 KB Output is correct
11 Correct 7 ms 7424 KB Output is correct
12 Correct 6 ms 7424 KB Output is correct
13 Correct 5 ms 7424 KB Output is correct
14 Correct 5 ms 7424 KB Output is correct
15 Correct 5 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 9 ms 7936 KB Output is correct
20 Correct 12 ms 7936 KB Output is correct
21 Correct 10 ms 7936 KB Output is correct
22 Correct 22 ms 8064 KB Output is correct
23 Correct 23 ms 8064 KB Output is correct
24 Correct 21 ms 8064 KB Output is correct
25 Correct 26 ms 8112 KB Output is correct
26 Correct 24 ms 8144 KB Output is correct
27 Correct 229 ms 31588 KB Output is correct
28 Correct 255 ms 29368 KB Output is correct
29 Correct 239 ms 28940 KB Output is correct
30 Correct 235 ms 32612 KB Output is correct
31 Correct 344 ms 23760 KB Output is correct
32 Correct 1025 ms 33032 KB Output is correct
33 Correct 413 ms 24424 KB Output is correct
34 Correct 557 ms 26080 KB Output is correct
35 Correct 5 ms 7424 KB Output is correct
36 Correct 571 ms 20840 KB Output is correct
37 Correct 2404 ms 44696 KB Output is correct
38 Correct 2284 ms 51532 KB Output is correct
39 Correct 2363 ms 46864 KB Output is correct
40 Correct 827 ms 27244 KB Output is correct
41 Correct 320 ms 18024 KB Output is correct
42 Correct 48 ms 9596 KB Output is correct
43 Correct 2888 ms 50912 KB Output is correct
44 Correct 2151 ms 46236 KB Output is correct
45 Correct 1858 ms 44636 KB Output is correct
46 Correct 1521 ms 50512 KB Output is correct
47 Correct 739 ms 35292 KB Output is correct
48 Correct 1569 ms 50872 KB Output is correct
49 Correct 1522 ms 51036 KB Output is correct
50 Correct 400 ms 30812 KB Output is correct
51 Correct 14 ms 8464 KB Output is correct
52 Correct 14 ms 8448 KB Output is correct
53 Correct 13 ms 8464 KB Output is correct
54 Correct 41 ms 8832 KB Output is correct
55 Correct 40 ms 8832 KB Output is correct
56 Correct 40 ms 8832 KB Output is correct
57 Correct 92 ms 15724 KB Output is correct
58 Correct 89 ms 15724 KB Output is correct
59 Correct 100 ms 15724 KB Output is correct
60 Correct 506 ms 20972 KB Output is correct
61 Correct 523 ms 20840 KB Output is correct
62 Correct 531 ms 20952 KB Output is correct
63 Correct 519 ms 20588 KB Output is correct
64 Correct 471 ms 20472 KB Output is correct
65 Correct 448 ms 20716 KB Output is correct
66 Correct 401 ms 20972 KB Output is correct
67 Correct 356 ms 20776 KB Output is correct
68 Correct 380 ms 20780 KB Output is correct
69 Correct 356 ms 20716 KB Output is correct
70 Correct 361 ms 20712 KB Output is correct
71 Correct 356 ms 20712 KB Output is correct
72 Correct 362 ms 20696 KB Output is correct
73 Correct 357 ms 20716 KB Output is correct
74 Correct 357 ms 20716 KB Output is correct
75 Correct 304 ms 40028 KB Output is correct
76 Correct 295 ms 36764 KB Output is correct
77 Correct 300 ms 39744 KB Output is correct
78 Correct 270 ms 39648 KB Output is correct
79 Correct 390 ms 31340 KB Output is correct
80 Correct 272 ms 39264 KB Output is correct
81 Correct 2487 ms 51620 KB Output is correct
82 Correct 2171 ms 51304 KB Output is correct
83 Correct 2416 ms 51368 KB Output is correct
84 Correct 2412 ms 51788 KB Output is correct
85 Correct 2661 ms 51312 KB Output is correct
86 Correct 2354 ms 51404 KB Output is correct
87 Correct 2587 ms 51372 KB Output is correct
88 Correct 2017 ms 48108 KB Output is correct
89 Correct 1969 ms 47952 KB Output is correct
90 Correct 1909 ms 46824 KB Output is correct
91 Correct 1909 ms 47672 KB Output is correct
92 Correct 1932 ms 46744 KB Output is correct
93 Correct 1917 ms 50396 KB Output is correct
94 Correct 1970 ms 50604 KB Output is correct
95 Correct 1868 ms 50324 KB Output is correct
96 Correct 1879 ms 50336 KB Output is correct
97 Correct 2713 ms 50264 KB Output is correct
98 Correct 1178 ms 42060 KB Output is correct
99 Correct 1967 ms 50484 KB Output is correct
100 Correct 1859 ms 50276 KB Output is correct
101 Correct 1848 ms 45708 KB Output is correct
102 Correct 1888 ms 50036 KB Output is correct
103 Correct 2566 ms 50080 KB Output is correct
104 Correct 1819 ms 50144 KB Output is correct
105 Correct 1784 ms 48096 KB Output is correct
106 Correct 1631 ms 49628 KB Output is correct
107 Correct 1510 ms 49764 KB Output is correct
108 Correct 1436 ms 49628 KB Output is correct
109 Correct 1427 ms 49644 KB Output is correct
110 Correct 1470 ms 49664 KB Output is correct
111 Correct 1495 ms 49692 KB Output is correct
112 Correct 1664 ms 49796 KB Output is correct
113 Correct 1447 ms 49608 KB Output is correct
114 Correct 1508 ms 49676 KB Output is correct
115 Correct 1502 ms 49624 KB Output is correct
116 Correct 1363 ms 49628 KB Output is correct