oj.uz

Submission #84712

# Submission time Handle Problem Language Result Execution time Memory
84712 2018-11-16T22:30:01 Z qkxwsm Circle selection (APIO18_circle_selection) C++14
64 / 100
 3000 ms 312328 KB 
/*
:>
*/
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM; x += 11400714819323198485ull;
		x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}
template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;
#define SZ(x) ((int) (x.size()))

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 300013

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef pair<pll, pll> ppp;

int N;
ppp arr[MAXN];
int ans[MAXN];

struct cmp
{
	bool operator() (const ppp &a, const ppp &b) const
	{
		if (a.fi.fi != b.fi.fi)
		{
			return a.fi.fi > b.fi.fi;
		}
		return a.fi.se < b.fi.se;
	}
};

bool cmp(ppp a, ppp b)
{
	if (a.fi.fi != b.fi.fi)
	{
		return a.fi.fi > b.fi.fi;
	}
	return a.fi.se < b.fi.se;
}

ll dist(pll a, pll b)
{
	return (a.fi - b.fi) * (a.fi - b.fi) + (a.se - b.se) * (a.se - b.se);
}
bool intersect(ppp a, ppp b)
{
	return dist(a.se, b.se) <= (a.fi.fi + b.fi.fi) * (a.fi.fi + b.fi.fi);
}
hash_table<ll, vi> stor;

void clean(vi &x, ppp c)
{
	int cid = c.fi.se;
	vi res;
	for (int idx : x)
	{
		ppp p = arr[idx];
		if (intersect(p, c))
		{
			ans[p.fi.se] = c.fi.se;
			// cerr << c.fi.se << " kills " << p.fi.se << endl;
		}
		else
		{
			res.PB(idx);
		}
	}
	x = res;
	return;
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// freopen ("file.in", "r", stdin);
	// freopen ("file.out", "w", stdout);
	readi(N);
	for (int i = 0; i < N; i++)
	{
		readi(arr[i].se.fi); readi(arr[i].se.se); readi(arr[i].fi.fi); arr[i].fi.se = i;
		arr[i].se.fi += INF; arr[i].se.se += INF;
		ans[i] = -1;
	}
	sort(arr, arr + N, cmp);
	int iter = 0;
	for (int i = 35; i >= 2; i--)
	{
		//all circles of radius [2^i - 1...2^i)
		ll block = (1ll << i);
		stor.clear();
		for (int j = 0; j < N; j++)
		{
			if (ans[arr[j].fi.se] != -1) continue;
			ll x = arr[j].se.fi, y = arr[j].se.se;
			stor[(((x / block) * block) << 31) + ((y / block) * block)].PB(j);
		}
		while(iter < N && arr[iter].fi.fi >= (block / 4))
		{
			if (ans[arr[iter].fi.se] != -1)
			{
				iter++;
				continue;
			}
			ppp cur = arr[iter]; ll bx = cur.se.fi / block, by = cur.se.se / block, cx = (bx * block) + (block / 2), cy = (by * block) + (block / 2);
			// cerr << "dye " 	<< cur.fi.se << endl;
			for (int j = -1; j <= 1; j++)
			{
				if (cur.se.fi - cur.fi.fi - (block / 2) >= (bx + j + 1) * block) continue;
				if (cur.se.fi + cur.fi.fi + (block / 2) < (bx + j) * block) continue;
				for (int k = -1; k <= 1; k++)
				{
					if (cur.se.se - cur.fi.fi - (block / 2) >= (by + k + 1) * block) continue;
					if (cur.se.se + cur.fi.fi + (block / 2) < (by + k) * block) continue;
					clean(stor[(((bx + j) * block) << 31) + ((by + k) * block)], cur);
				}
			}
			iter++;
		}
	}
	for (int i = 0; i < N; i++)
	{
		ans[i]++;
		if (i) putchar(' ');
		printi(ans[i]);
	}
	putchar('\n');
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/*
3
43731976 204781684 256609825
24705554 727971615 76690539
190036976 276041388 165781486
*/

Compilation message

circle_selection.cpp: In function 'void clean(vi&, ppp)':
circle_selection.cpp:186:6: warning: unused variable 'cid' [-Wunused-variable]
  int cid = c.fi.se;
      ^~~
circle_selection.cpp: In function 'int32_t main()':
circle_selection.cpp:239:76: warning: unused variable 'cx' [-Wunused-variable]
    ppp cur = arr[iter]; ll bx = cur.se.fi / block, by = cur.se.se / block, cx = (bx * block) + (block / 2), cy = (by * block) + (block / 2);
                                                                            ^~
circle_selection.cpp:239:109: warning: unused variable 'cy' [-Wunused-variable]
    ppp cur = arr[iter]; ll bx = cur.se.fi / block, by = cur.se.se / block, cx = (bx * block) + (block / 2), cy = (by * block) + (block / 2);
                                                                                                             ^~

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 440 KB Output is correct
3 Correct 2 ms 544 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 3 ms 544 KB Output is correct
8 Correct 2 ms 544 KB Output is correct
9 Correct 2 ms 544 KB Output is correct
10 Correct 2 ms 556 KB Output is correct
11 Correct 3 ms 708 KB Output is correct
12 Correct 2 ms 708 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 3 ms 748 KB Output is correct
17 Correct 3 ms 748 KB Output is correct
18 Correct 3 ms 748 KB Output is correct
19 Correct 6 ms 1052 KB Output is correct
20 Correct 6 ms 1204 KB Output is correct
21 Correct 6 ms 1372 KB Output is correct
22 Correct 32 ms 6752 KB Output is correct
23 Correct 32 ms 6752 KB Output is correct
24 Correct 28 ms 6752 KB Output is correct
25 Correct 35 ms 7256 KB Output is correct
26 Correct 33 ms 7408 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 17136 KB Output is correct
2 Correct 312 ms 17260 KB Output is correct
3 Correct 297 ms 17260 KB Output is correct
4 Correct 268 ms 17260 KB Output is correct
5 Correct 561 ms 17708 KB Output is correct
6 Correct 990 ms 55964 KB Output is correct
7 Correct 598 ms 55964 KB Output is correct
8 Correct 641 ms 55964 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 55964 KB Output is correct
2 Correct 658 ms 92828 KB Output is correct
3 Correct 2643 ms 187188 KB Output is correct
4 Correct 2719 ms 187656 KB Output is correct
5 Correct 1821 ms 188788 KB Output is correct
6 Correct 903 ms 188788 KB Output is correct
7 Correct 359 ms 188788 KB Output is correct
8 Correct 76 ms 188788 KB Output is correct
9 Correct 2302 ms 188944 KB Output is correct
10 Correct 1533 ms 188944 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2820 ms 312328 KB Output is correct
2 Execution timed out 3057 ms 312328 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 440 KB Output is correct
3 Correct 2 ms 544 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 3 ms 544 KB Output is correct
8 Correct 2 ms 544 KB Output is correct
9 Correct 2 ms 544 KB Output is correct
10 Correct 2 ms 556 KB Output is correct
11 Correct 3 ms 708 KB Output is correct
12 Correct 2 ms 708 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 3 ms 748 KB Output is correct
17 Correct 3 ms 748 KB Output is correct
18 Correct 3 ms 748 KB Output is correct
19 Correct 6 ms 1052 KB Output is correct
20 Correct 6 ms 1204 KB Output is correct
21 Correct 6 ms 1372 KB Output is correct
22 Correct 32 ms 6752 KB Output is correct
23 Correct 32 ms 6752 KB Output is correct
24 Correct 28 ms 6752 KB Output is correct
25 Correct 35 ms 7256 KB Output is correct
26 Correct 33 ms 7408 KB Output is correct
27 Correct 10 ms 312328 KB Output is correct
28 Correct 11 ms 312328 KB Output is correct
29 Correct 10 ms 312328 KB Output is correct
30 Correct 58 ms 312328 KB Output is correct
31 Correct 63 ms 312328 KB Output is correct
32 Correct 56 ms 312328 KB Output is correct
33 Correct 98 ms 312328 KB Output is correct
34 Correct 97 ms 312328 KB Output is correct
35 Correct 100 ms 312328 KB Output is correct
36 Correct 835 ms 312328 KB Output is correct
37 Correct 830 ms 312328 KB Output is correct
38 Correct 764 ms 312328 KB Output is correct
39 Correct 301 ms 312328 KB Output is correct
40 Correct 309 ms 312328 KB Output is correct
41 Correct 296 ms 312328 KB Output is correct
42 Correct 190 ms 312328 KB Output is correct
43 Correct 851 ms 312328 KB Output is correct
44 Correct 830 ms 312328 KB Output is correct
45 Correct 877 ms 312328 KB Output is correct
46 Correct 816 ms 312328 KB Output is correct
47 Correct 844 ms 312328 KB Output is correct
48 Correct 846 ms 312328 KB Output is correct
49 Correct 831 ms 312328 KB Output is correct
50 Correct 816 ms 312328 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 440 KB Output is correct
3 Correct 2 ms 544 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 3 ms 544 KB Output is correct
8 Correct 2 ms 544 KB Output is correct
9 Correct 2 ms 544 KB Output is correct
10 Correct 2 ms 556 KB Output is correct
11 Correct 3 ms 708 KB Output is correct
12 Correct 2 ms 708 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 3 ms 748 KB Output is correct
17 Correct 3 ms 748 KB Output is correct
18 Correct 3 ms 748 KB Output is correct
19 Correct 6 ms 1052 KB Output is correct
20 Correct 6 ms 1204 KB Output is correct
21 Correct 6 ms 1372 KB Output is correct
22 Correct 32 ms 6752 KB Output is correct
23 Correct 32 ms 6752 KB Output is correct
24 Correct 28 ms 6752 KB Output is correct
25 Correct 35 ms 7256 KB Output is correct
26 Correct 33 ms 7408 KB Output is correct
27 Correct 286 ms 17136 KB Output is correct
28 Correct 312 ms 17260 KB Output is correct
29 Correct 297 ms 17260 KB Output is correct
30 Correct 268 ms 17260 KB Output is correct
31 Correct 561 ms 17708 KB Output is correct
32 Correct 990 ms 55964 KB Output is correct
33 Correct 598 ms 55964 KB Output is correct
34 Correct 641 ms 55964 KB Output is correct
35 Correct 2 ms 55964 KB Output is correct
36 Correct 658 ms 92828 KB Output is correct
37 Correct 2643 ms 187188 KB Output is correct
38 Correct 2719 ms 187656 KB Output is correct
39 Correct 1821 ms 188788 KB Output is correct
40 Correct 903 ms 188788 KB Output is correct
41 Correct 359 ms 188788 KB Output is correct
42 Correct 76 ms 188788 KB Output is correct
43 Correct 2302 ms 188944 KB Output is correct
44 Correct 1533 ms 188944 KB Output is correct
45 Correct 2820 ms 312328 KB Output is correct
46 Execution timed out 3057 ms 312328 KB Time limit exceeded
47 Halted 0 ms 0 KB -