oj.uz

Submission #84998

# Submission time Handle Problem Language Result Execution time Memory
84998 2018-11-18T02:16:05 Z qkxwsm Circle selection (APIO18_circle_selection) C++14
64 / 100
 3000 ms 557412 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;

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 = 32; 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;
			}
			ll bx = arr[iter].se.fi / block, by = arr[iter].se.se / block;
			for (int j = -1; j <= 1; j++)
			{
				for (int k = -1; k <= 1; k++)
				{
					vi v = stor[(((bx + j) * block) << 31) + ((by + k) * block)]; vi res;
					for (int idx : v)
					{
						if (intersect(arr[idx], arr[iter]))
						{
							ans[arr[idx].fi.se] = arr[iter].fi.se;
						}
						else
						{
							res.PB(idx);
						}
					}
					stor[(((bx + j) * block) << 31) + ((by + k) * block)] = res;
				}
			}
			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
*/

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 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 624 KB Output is correct
5 Correct 2 ms 624 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 2 ms 624 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 776 KB Output is correct
10 Correct 2 ms 776 KB Output is correct
11 Correct 3 ms 776 KB Output is correct
12 Correct 2 ms 776 KB Output is correct
13 Correct 2 ms 776 KB Output is correct
14 Correct 2 ms 776 KB Output is correct
15 Correct 2 ms 776 KB Output is correct
16 Correct 2 ms 776 KB Output is correct
17 Correct 2 ms 776 KB Output is correct
18 Correct 2 ms 844 KB Output is correct
19 Correct 5 ms 1148 KB Output is correct
20 Correct 5 ms 1300 KB Output is correct
21 Correct 5 ms 1468 KB Output is correct
22 Correct 30 ms 6736 KB Output is correct
23 Correct 33 ms 6880 KB Output is correct
24 Correct 33 ms 7144 KB Output is correct
25 Correct 35 ms 7144 KB Output is correct
26 Correct 33 ms 7144 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 16544 KB Output is correct
2 Correct 260 ms 17272 KB Output is correct
3 Correct 251 ms 17272 KB Output is correct
4 Correct 236 ms 17272 KB Output is correct
5 Correct 534 ms 17456 KB Output is correct
6 Correct 956 ms 58716 KB Output is correct
7 Correct 528 ms 58716 KB Output is correct
8 Correct 606 ms 58716 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 58716 KB Output is correct
2 Correct 673 ms 92736 KB Output is correct
3 Correct 2894 ms 310796 KB Output is correct
4 Correct 2917 ms 310796 KB Output is correct
5 Correct 1934 ms 310796 KB Output is correct
6 Correct 809 ms 310796 KB Output is correct
7 Correct 451 ms 310796 KB Output is correct
8 Correct 71 ms 310796 KB Output is correct
9 Correct 2472 ms 310796 KB Output is correct
10 Correct 1724 ms 310796 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3075 ms 557412 KB Time limit exceeded
2 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 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 624 KB Output is correct
5 Correct 2 ms 624 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 2 ms 624 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 776 KB Output is correct
10 Correct 2 ms 776 KB Output is correct
11 Correct 3 ms 776 KB Output is correct
12 Correct 2 ms 776 KB Output is correct
13 Correct 2 ms 776 KB Output is correct
14 Correct 2 ms 776 KB Output is correct
15 Correct 2 ms 776 KB Output is correct
16 Correct 2 ms 776 KB Output is correct
17 Correct 2 ms 776 KB Output is correct
18 Correct 2 ms 844 KB Output is correct
19 Correct 5 ms 1148 KB Output is correct
20 Correct 5 ms 1300 KB Output is correct
21 Correct 5 ms 1468 KB Output is correct
22 Correct 30 ms 6736 KB Output is correct
23 Correct 33 ms 6880 KB Output is correct
24 Correct 33 ms 7144 KB Output is correct
25 Correct 35 ms 7144 KB Output is correct
26 Correct 33 ms 7144 KB Output is correct
27 Correct 9 ms 557412 KB Output is correct
28 Correct 9 ms 557412 KB Output is correct
29 Correct 8 ms 557412 KB Output is correct
30 Correct 62 ms 557412 KB Output is correct
31 Correct 56 ms 557412 KB Output is correct
32 Correct 66 ms 557412 KB Output is correct
33 Correct 79 ms 557412 KB Output is correct
34 Correct 83 ms 557412 KB Output is correct
35 Correct 87 ms 557412 KB Output is correct
36 Correct 762 ms 557412 KB Output is correct
37 Correct 855 ms 557412 KB Output is correct
38 Correct 832 ms 557412 KB Output is correct
39 Correct 323 ms 557412 KB Output is correct
40 Correct 326 ms 557412 KB Output is correct
41 Correct 319 ms 557412 KB Output is correct
42 Correct 199 ms 557412 KB Output is correct
43 Correct 804 ms 557412 KB Output is correct
44 Correct 832 ms 557412 KB Output is correct
45 Correct 802 ms 557412 KB Output is correct
46 Correct 810 ms 557412 KB Output is correct
47 Correct 851 ms 557412 KB Output is correct
48 Correct 857 ms 557412 KB Output is correct
49 Correct 830 ms 557412 KB Output is correct
50 Correct 839 ms 557412 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 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 624 KB Output is correct
5 Correct 2 ms 624 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 2 ms 624 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 776 KB Output is correct
10 Correct 2 ms 776 KB Output is correct
11 Correct 3 ms 776 KB Output is correct
12 Correct 2 ms 776 KB Output is correct
13 Correct 2 ms 776 KB Output is correct
14 Correct 2 ms 776 KB Output is correct
15 Correct 2 ms 776 KB Output is correct
16 Correct 2 ms 776 KB Output is correct
17 Correct 2 ms 776 KB Output is correct
18 Correct 2 ms 844 KB Output is correct
19 Correct 5 ms 1148 KB Output is correct
20 Correct 5 ms 1300 KB Output is correct
21 Correct 5 ms 1468 KB Output is correct
22 Correct 30 ms 6736 KB Output is correct
23 Correct 33 ms 6880 KB Output is correct
24 Correct 33 ms 7144 KB Output is correct
25 Correct 35 ms 7144 KB Output is correct
26 Correct 33 ms 7144 KB Output is correct
27 Correct 252 ms 16544 KB Output is correct
28 Correct 260 ms 17272 KB Output is correct
29 Correct 251 ms 17272 KB Output is correct
30 Correct 236 ms 17272 KB Output is correct
31 Correct 534 ms 17456 KB Output is correct
32 Correct 956 ms 58716 KB Output is correct
33 Correct 528 ms 58716 KB Output is correct
34 Correct 606 ms 58716 KB Output is correct
35 Correct 2 ms 58716 KB Output is correct
36 Correct 673 ms 92736 KB Output is correct
37 Correct 2894 ms 310796 KB Output is correct
38 Correct 2917 ms 310796 KB Output is correct
39 Correct 1934 ms 310796 KB Output is correct
40 Correct 809 ms 310796 KB Output is correct
41 Correct 451 ms 310796 KB Output is correct
42 Correct 71 ms 310796 KB Output is correct
43 Correct 2472 ms 310796 KB Output is correct
44 Correct 1724 ms 310796 KB Output is correct
45 Execution timed out 3075 ms 557412 KB Time limit exceeded
46 Halted 0 ms 0 KB -