oj.uz

답안 #84713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
84713 2018-11-16T22:36:43 Z qkxwsm 원 고르기 (APIO18_circle_selection) C++14
49 / 100
 3000 ms 555104 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;
		}
		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 = 32; i >= 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);
			for (int j = -1; j <= 1; j++)
			{
				for (int k = -1; k <= 1; k++)
				{
					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:237: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:237: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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 2 ms 532 KB Output is correct
9 Correct 2 ms 660 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 2 ms 660 KB Output is correct
12 Correct 2 ms 660 KB Output is correct
13 Correct 3 ms 736 KB Output is correct
14 Correct 2 ms 736 KB Output is correct
15 Correct 2 ms 736 KB Output is correct
16 Correct 3 ms 736 KB Output is correct
17 Correct 3 ms 736 KB Output is correct
18 Correct 3 ms 736 KB Output is correct
19 Correct 5 ms 912 KB Output is correct
20 Correct 5 ms 912 KB Output is correct
21 Correct 5 ms 912 KB Output is correct
22 Correct 31 ms 6024 KB Output is correct
23 Correct 33 ms 6260 KB Output is correct
24 Correct 34 ms 6524 KB Output is correct
25 Correct 34 ms 6524 KB Output is correct
26 Correct 33 ms 6524 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 258 ms 16100 KB Output is correct
2 Correct 270 ms 16100 KB Output is correct
3 Correct 258 ms 16100 KB Output is correct
4 Correct 242 ms 16100 KB Output is correct
5 Correct 533 ms 16100 KB Output is correct
6 Correct 1043 ms 57460 KB Output is correct
7 Correct 549 ms 57460 KB Output is correct
8 Correct 633 ms 57460 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 57460 KB Output is correct
2 Correct 730 ms 91424 KB Output is correct
3 Execution timed out 3053 ms 308848 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 2 ms 532 KB Output is correct
9 Correct 2 ms 660 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 2 ms 660 KB Output is correct
12 Correct 2 ms 660 KB Output is correct
13 Correct 3 ms 736 KB Output is correct
14 Correct 2 ms 736 KB Output is correct
15 Correct 2 ms 736 KB Output is correct
16 Correct 3 ms 736 KB Output is correct
17 Correct 3 ms 736 KB Output is correct
18 Correct 3 ms 736 KB Output is correct
19 Correct 5 ms 912 KB Output is correct
20 Correct 5 ms 912 KB Output is correct
21 Correct 5 ms 912 KB Output is correct
22 Correct 31 ms 6024 KB Output is correct
23 Correct 33 ms 6260 KB Output is correct
24 Correct 34 ms 6524 KB Output is correct
25 Correct 34 ms 6524 KB Output is correct
26 Correct 33 ms 6524 KB Output is correct
27 Correct 12 ms 555104 KB Output is correct
28 Correct 9 ms 555104 KB Output is correct
29 Correct 10 ms 555104 KB Output is correct
30 Correct 57 ms 555104 KB Output is correct
31 Correct 58 ms 555104 KB Output is correct
32 Correct 69 ms 555104 KB Output is correct
33 Correct 81 ms 555104 KB Output is correct
34 Correct 83 ms 555104 KB Output is correct
35 Correct 88 ms 555104 KB Output is correct
36 Correct 865 ms 555104 KB Output is correct
37 Correct 943 ms 555104 KB Output is correct
38 Correct 855 ms 555104 KB Output is correct
39 Correct 312 ms 555104 KB Output is correct
40 Correct 310 ms 555104 KB Output is correct
41 Correct 308 ms 555104 KB Output is correct
42 Correct 207 ms 555104 KB Output is correct
43 Correct 912 ms 555104 KB Output is correct
44 Correct 865 ms 555104 KB Output is correct
45 Correct 881 ms 555104 KB Output is correct
46 Correct 819 ms 555104 KB Output is correct
47 Correct 811 ms 555104 KB Output is correct
48 Correct 834 ms 555104 KB Output is correct
49 Correct 807 ms 555104 KB Output is correct
50 Correct 912 ms 555104 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 2 ms 532 KB Output is correct
9 Correct 2 ms 660 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 2 ms 660 KB Output is correct
12 Correct 2 ms 660 KB Output is correct
13 Correct 3 ms 736 KB Output is correct
14 Correct 2 ms 736 KB Output is correct
15 Correct 2 ms 736 KB Output is correct
16 Correct 3 ms 736 KB Output is correct
17 Correct 3 ms 736 KB Output is correct
18 Correct 3 ms 736 KB Output is correct
19 Correct 5 ms 912 KB Output is correct
20 Correct 5 ms 912 KB Output is correct
21 Correct 5 ms 912 KB Output is correct
22 Correct 31 ms 6024 KB Output is correct
23 Correct 33 ms 6260 KB Output is correct
24 Correct 34 ms 6524 KB Output is correct
25 Correct 34 ms 6524 KB Output is correct
26 Correct 33 ms 6524 KB Output is correct
27 Correct 258 ms 16100 KB Output is correct
28 Correct 270 ms 16100 KB Output is correct
29 Correct 258 ms 16100 KB Output is correct
30 Correct 242 ms 16100 KB Output is correct
31 Correct 533 ms 16100 KB Output is correct
32 Correct 1043 ms 57460 KB Output is correct
33 Correct 549 ms 57460 KB Output is correct
34 Correct 633 ms 57460 KB Output is correct
35 Correct 2 ms 57460 KB Output is correct
36 Correct 730 ms 91424 KB Output is correct
37 Execution timed out 3053 ms 308848 KB Time limit exceeded
38 Halted 0 ms 0 KB -