oj.uz

답안 #262986

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
262986 2020-08-13T11:39:50 Z _7_7_ 원 고르기 (APIO18_circle_selection) C++14
100 / 100
 2674 ms 49836 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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 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 5 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 5 ms 7424 KB Output is correct
14 Correct 6 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 9 ms 7936 KB Output is correct
21 Correct 9 ms 7936 KB Output is correct
22 Correct 21 ms 8064 KB Output is correct
23 Correct 22 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

# 결과 실행 시간 메모리 Grader output
1 Correct 236 ms 36452 KB Output is correct
2 Correct 248 ms 34344 KB Output is correct
3 Correct 244 ms 33764 KB Output is correct
4 Correct 241 ms 37600 KB Output is correct
5 Correct 356 ms 26720 KB Output is correct
6 Correct 965 ms 36188 KB Output is correct
7 Correct 469 ms 27852 KB Output is correct
8 Correct 498 ms 29180 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 531 ms 22124 KB Output is correct
3 Correct 2370 ms 49732 KB Output is correct
4 Correct 2335 ms 49100 KB Output is correct
5 Correct 2349 ms 44544 KB Output is correct
6 Correct 741 ms 27260 KB Output is correct
7 Correct 327 ms 18072 KB Output is correct
8 Correct 48 ms 9596 KB Output is correct
9 Correct 2660 ms 48580 KB Output is correct
10 Correct 2029 ms 43484 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1869 ms 49836 KB Output is correct
2 Correct 1527 ms 49268 KB Output is correct
3 Correct 705 ms 32488 KB Output is correct
4 Correct 1468 ms 49256 KB Output is correct
5 Correct 1373 ms 49364 KB Output is correct
6 Correct 415 ms 27740 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 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 5 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 5 ms 7424 KB Output is correct
14 Correct 6 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 9 ms 7936 KB Output is correct
21 Correct 9 ms 7936 KB Output is correct
22 Correct 21 ms 8064 KB Output is correct
23 Correct 22 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 14 ms 8464 KB Output is correct
28 Correct 13 ms 8448 KB Output is correct
29 Correct 13 ms 8464 KB Output is correct
30 Correct 43 ms 8832 KB Output is correct
31 Correct 40 ms 8832 KB Output is correct
32 Correct 39 ms 8832 KB Output is correct
33 Correct 94 ms 17132 KB Output is correct
34 Correct 108 ms 17260 KB Output is correct
35 Correct 99 ms 17132 KB Output is correct
36 Correct 485 ms 21952 KB Output is correct
37 Correct 577 ms 21992 KB Output is correct
38 Correct 560 ms 21996 KB Output is correct
39 Correct 496 ms 20532 KB Output is correct
40 Correct 490 ms 20588 KB Output is correct
41 Correct 486 ms 20588 KB Output is correct
42 Correct 401 ms 20972 KB Output is correct
43 Correct 354 ms 21740 KB Output is correct
44 Correct 368 ms 21748 KB Output is correct
45 Correct 372 ms 21736 KB Output is correct
46 Correct 359 ms 21868 KB Output is correct
47 Correct 350 ms 21740 KB Output is correct
48 Correct 361 ms 21736 KB Output is correct
49 Correct 397 ms 21752 KB Output is correct
50 Correct 349 ms 21740 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 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 5 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 5 ms 7424 KB Output is correct
14 Correct 6 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 9 ms 7936 KB Output is correct
21 Correct 9 ms 7936 KB Output is correct
22 Correct 21 ms 8064 KB Output is correct
23 Correct 22 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 236 ms 36452 KB Output is correct
28 Correct 248 ms 34344 KB Output is correct
29 Correct 244 ms 33764 KB Output is correct
30 Correct 241 ms 37600 KB Output is correct
31 Correct 356 ms 26720 KB Output is correct
32 Correct 965 ms 36188 KB Output is correct
33 Correct 469 ms 27852 KB Output is correct
34 Correct 498 ms 29180 KB Output is correct
35 Correct 5 ms 7424 KB Output is correct
36 Correct 531 ms 22124 KB Output is correct
37 Correct 2370 ms 49732 KB Output is correct
38 Correct 2335 ms 49100 KB Output is correct
39 Correct 2349 ms 44544 KB Output is correct
40 Correct 741 ms 27260 KB Output is correct
41 Correct 327 ms 18072 KB Output is correct
42 Correct 48 ms 9596 KB Output is correct
43 Correct 2660 ms 48580 KB Output is correct
44 Correct 2029 ms 43484 KB Output is correct
45 Correct 1869 ms 49836 KB Output is correct
46 Correct 1527 ms 49268 KB Output is correct
47 Correct 705 ms 32488 KB Output is correct
48 Correct 1468 ms 49256 KB Output is correct
49 Correct 1373 ms 49364 KB Output is correct
50 Correct 415 ms 27740 KB Output is correct
51 Correct 14 ms 8464 KB Output is correct
52 Correct 13 ms 8448 KB Output is correct
53 Correct 13 ms 8464 KB Output is correct
54 Correct 43 ms 8832 KB Output is correct
55 Correct 40 ms 8832 KB Output is correct
56 Correct 39 ms 8832 KB Output is correct
57 Correct 94 ms 17132 KB Output is correct
58 Correct 108 ms 17260 KB Output is correct
59 Correct 99 ms 17132 KB Output is correct
60 Correct 485 ms 21952 KB Output is correct
61 Correct 577 ms 21992 KB Output is correct
62 Correct 560 ms 21996 KB Output is correct
63 Correct 496 ms 20532 KB Output is correct
64 Correct 490 ms 20588 KB Output is correct
65 Correct 486 ms 20588 KB Output is correct
66 Correct 401 ms 20972 KB Output is correct
67 Correct 354 ms 21740 KB Output is correct
68 Correct 368 ms 21748 KB Output is correct
69 Correct 372 ms 21736 KB Output is correct
70 Correct 359 ms 21868 KB Output is correct
71 Correct 350 ms 21740 KB Output is correct
72 Correct 361 ms 21736 KB Output is correct
73 Correct 397 ms 21752 KB Output is correct
74 Correct 349 ms 21740 KB Output is correct
75 Correct 304 ms 35036 KB Output is correct
76 Correct 272 ms 31804 KB Output is correct
77 Correct 268 ms 34276 KB Output is correct
78 Correct 253 ms 34012 KB Output is correct
79 Correct 368 ms 26204 KB Output is correct
80 Correct 251 ms 33764 KB Output is correct
81 Correct 2280 ms 47512 KB Output is correct
82 Correct 2108 ms 47456 KB Output is correct
83 Correct 2116 ms 47452 KB Output is correct
84 Correct 2514 ms 47324 KB Output is correct
85 Correct 2219 ms 47480 KB Output is correct
86 Correct 2170 ms 47220 KB Output is correct
87 Correct 2493 ms 46880 KB Output is correct
88 Correct 1849 ms 47592 KB Output is correct
89 Correct 1920 ms 47448 KB Output is correct
90 Correct 1888 ms 46172 KB Output is correct
91 Correct 1913 ms 46812 KB Output is correct
92 Correct 1830 ms 46076 KB Output is correct
93 Correct 1716 ms 45916 KB Output is correct
94 Correct 1992 ms 45576 KB Output is correct
95 Correct 1678 ms 45776 KB Output is correct
96 Correct 1782 ms 45656 KB Output is correct
97 Correct 2670 ms 45240 KB Output is correct
98 Correct 1351 ms 37196 KB Output is correct
99 Correct 1861 ms 45636 KB Output is correct
100 Correct 1927 ms 45684 KB Output is correct
101 Correct 1798 ms 40712 KB Output is correct
102 Correct 1872 ms 45340 KB Output is correct
103 Correct 2674 ms 45320 KB Output is correct
104 Correct 1981 ms 45660 KB Output is correct
105 Correct 1849 ms 45432 KB Output is correct
106 Correct 1451 ms 44136 KB Output is correct
107 Correct 1372 ms 44144 KB Output is correct
108 Correct 1505 ms 44180 KB Output is correct
109 Correct 1488 ms 44244 KB Output is correct
110 Correct 1542 ms 44116 KB Output is correct
111 Correct 1366 ms 43948 KB Output is correct
112 Correct 1346 ms 43628 KB Output is correct
113 Correct 1310 ms 43612 KB Output is correct
114 Correct 1518 ms 43624 KB Output is correct
115 Correct 1370 ms 43616 KB Output is correct
116 Correct 1495 ms 43624 KB Output is correct