oj.uz

답안 #84527

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
84527 2018-11-16T00:50:11 Z qkxwsm 원 고르기 (APIO18_circle_selection) C++14
7 / 100
 3000 ms 539700 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, hash_table<ll, vector<ppp> > > stor;

void clean(vector<ppp> &x, ppp c)
{
	int cid = c.fi.se;
	vector<ppp> res;
	for (ppp p : x)
	{
		if (intersect(p, c))
		{
			ans[p.fi.se] = c.fi.se;
			// cerr << c.fi.se << " kills " << p.fi.se << endl;
		}
		else
		{
			res.PB(p);
		}
	}
	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 = 32; i >= 0; 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][(y / block) * block].PB(arr[j]);
		}
		while(iter < N && arr[iter].fi.fi >= (block / 2))
		{
			if (ans[arr[iter].fi.se] != -1)
			{
				iter++;
				continue;
			}
			ppp cur = arr[iter]; ll bx = cur.se.fi / block, by = cur.se.se / block;
			// cerr << "dye " << cur.fi.se << endl;
			for (int j = -2; j <= 2; j++)
			{
				for (int k = -2; k <= 2; k++)
				{
					clean(stor[(bx + j) * block][(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;
}
/*
11
9 9 2
13 2 1
11 8 2
3 3 2
3 12 1
12 14 1
9 8 5
2 8 2
5 2 1
14 4 2
14 14 1
*/

Compilation message

circle_selection.cpp: In function 'void clean(std::vector<std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> > >&, ppp)':
circle_selection.cpp:186:6: warning: unused variable 'cid' [-Wunused-variable]
  int cid = c.fi.se;
      ^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 580 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 616 KB Output is correct
11 Correct 4 ms 892 KB Output is correct
12 Correct 4 ms 892 KB Output is correct
13 Correct 4 ms 1144 KB Output is correct
14 Correct 4 ms 1172 KB Output is correct
15 Correct 4 ms 1176 KB Output is correct
16 Correct 3 ms 1176 KB Output is correct
17 Correct 3 ms 1176 KB Output is correct
18 Correct 3 ms 1176 KB Output is correct
19 Correct 6 ms 1520 KB Output is correct
20 Correct 7 ms 1672 KB Output is correct
21 Correct 6 ms 1840 KB Output is correct
22 Correct 85 ms 10720 KB Output is correct
23 Correct 68 ms 10720 KB Output is correct
24 Correct 102 ms 13880 KB Output is correct
25 Correct 151 ms 17676 KB Output is correct
26 Correct 102 ms 17676 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 336 ms 42432 KB Output is correct
2 Correct 365 ms 42432 KB Output is correct
3 Correct 375 ms 49036 KB Output is correct
4 Correct 288 ms 55604 KB Output is correct
5 Correct 934 ms 60376 KB Output is correct
6 Execution timed out 3048 ms 174464 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 174464 KB Output is correct
2 Correct 1764 ms 180120 KB Output is correct
3 Execution timed out 3076 ms 377732 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3082 ms 377732 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 580 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 616 KB Output is correct
11 Correct 4 ms 892 KB Output is correct
12 Correct 4 ms 892 KB Output is correct
13 Correct 4 ms 1144 KB Output is correct
14 Correct 4 ms 1172 KB Output is correct
15 Correct 4 ms 1176 KB Output is correct
16 Correct 3 ms 1176 KB Output is correct
17 Correct 3 ms 1176 KB Output is correct
18 Correct 3 ms 1176 KB Output is correct
19 Correct 6 ms 1520 KB Output is correct
20 Correct 7 ms 1672 KB Output is correct
21 Correct 6 ms 1840 KB Output is correct
22 Correct 85 ms 10720 KB Output is correct
23 Correct 68 ms 10720 KB Output is correct
24 Correct 102 ms 13880 KB Output is correct
25 Correct 151 ms 17676 KB Output is correct
26 Correct 102 ms 17676 KB Output is correct
27 Correct 11 ms 377732 KB Output is correct
28 Correct 11 ms 377732 KB Output is correct
29 Correct 11 ms 377732 KB Output is correct
30 Correct 135 ms 377732 KB Output is correct
31 Correct 199 ms 377732 KB Output is correct
32 Correct 198 ms 377732 KB Output is correct
33 Correct 99 ms 377732 KB Output is correct
34 Correct 98 ms 377732 KB Output is correct
35 Correct 117 ms 377732 KB Output is correct
36 Correct 2544 ms 377732 KB Output is correct
37 Correct 2506 ms 377732 KB Output is correct
38 Correct 2156 ms 377732 KB Output is correct
39 Correct 714 ms 377732 KB Output is correct
40 Correct 677 ms 377732 KB Output is correct
41 Correct 704 ms 377732 KB Output is correct
42 Correct 342 ms 377732 KB Output is correct
43 Execution timed out 3080 ms 539700 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 580 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 616 KB Output is correct
11 Correct 4 ms 892 KB Output is correct
12 Correct 4 ms 892 KB Output is correct
13 Correct 4 ms 1144 KB Output is correct
14 Correct 4 ms 1172 KB Output is correct
15 Correct 4 ms 1176 KB Output is correct
16 Correct 3 ms 1176 KB Output is correct
17 Correct 3 ms 1176 KB Output is correct
18 Correct 3 ms 1176 KB Output is correct
19 Correct 6 ms 1520 KB Output is correct
20 Correct 7 ms 1672 KB Output is correct
21 Correct 6 ms 1840 KB Output is correct
22 Correct 85 ms 10720 KB Output is correct
23 Correct 68 ms 10720 KB Output is correct
24 Correct 102 ms 13880 KB Output is correct
25 Correct 151 ms 17676 KB Output is correct
26 Correct 102 ms 17676 KB Output is correct
27 Correct 336 ms 42432 KB Output is correct
28 Correct 365 ms 42432 KB Output is correct
29 Correct 375 ms 49036 KB Output is correct
30 Correct 288 ms 55604 KB Output is correct
31 Correct 934 ms 60376 KB Output is correct
32 Execution timed out 3048 ms 174464 KB Time limit exceeded
33 Halted 0 ms 0 KB -