제출 #381684

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381684		rainboy	원 고르기 (APIO18_circle_selection)	C11	49 / 100	3075 ms	46060 KiB

circle_selection

#include <stdio.h>
#include <string.h>

#define N	300000
#define X	1000000000
#define C	25

unsigned int Z = 12345;

int rand_() {
	return (Z *= 3) >> 1;
}

int xx[N], yy[N], rr_[N], yy_[N * 2];

int intersect(int i, int j) {
	long long x = xx[i] - xx[j], y = yy[i] - yy[j], r = rr_[i] + rr_[j];

	return x * x + y * y <= r * r;
}

int compare_r(int i, int j) {
	return rr_[i] != rr_[j] ? rr_[j] - rr_[i] : i - j;
}

int compare_y(int i, int j) {
	return yy_[i] == yy_[j] ? (i & 1) - (j & 1) : (yy_[i] < yy_[j] ? -1 : 1);
}

int (*compare)(int, int);

void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;

		while (j < k) {
			int c = compare(ii[j], i_);

			if (c == 0)
				j++;
			else if (c < 0) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		}
		sort(ii, l, i);
		l = k;
	}
}

int zz[1 + N], ll[1 + N], rr[1 + N], ii1[1 + N], u_, l_, r_;

int node(int i) {
	static int _ = 1;

	zz[_] = rand_();
	ii1[_] = i;
	return _++;
}

void split(int u, int i) {
	int c;

	if (u == 0) {
		u_ = l_ = r_ = 0;
		return;
	}
	c = xx[ii1[u]] != xx[i] ? xx[ii1[u]] - xx[i] : ii1[u] - i;
	if (c < 0) {
		split(rr[u], i);
		rr[u] = l_, l_ = u;
	} else if (c > 0) {
		split(ll[u], i);
		ll[u] = r_, r_ = u;
	} else {
		u_ = u, l_ = ll[u], r_ = rr[u];
		ll[u] = rr[u] = 0;
	}
}

int merge(int u, int v) {
	if (u == 0)
		return v;
	if (v == 0)
		return u;
	if (zz[u] < zz[v]) {
		rr[u] = merge(rr[u], v);
		return u;
	} else {
		ll[v] = merge(u, ll[v]);
		return v;
	}
}

int first(int u) {
	return ll[u] == 0 ? u : first(ll[u]);
}

int last(int u) {
	return rr[u] == 0 ? u : last(rr[u]);
}

int remove_first(int u) {
	if (ll[u] == 0)
		return rr[u];
	ll[u] = remove_first(ll[u]);
	return u;
}

int remove_last(int u) {
	if (rr[u] == 0)
		return ll[u];
	rr[u] = remove_last(rr[u]);
	return u;
}

int cmp(int x1, int y1, int x2, int y2) {
	return x1 != x2 ? x1 - x2 : y1 - y2;
}

int main() {
	static char type[N];
	static int xx_[N], yy_[N], ii[N * 2], ii_[N], tmp[N], ggg[N][C], gg[C], iii[N][4], kk[N], pp[N];
	int n, lg, g, h, h_, i, j, k, c, segs, same, cnt;

	scanf("%d", &n);
	segs = 1, same = 1;
	for (i = 0; i < n; i++) {
		scanf("%d%d%d", &xx[i], &yy[i], &rr_[i]);
		if (yy[i] != 0)
			segs = 0;
		if (rr_[i] != rr_[0])
			same = 0;
	}
	if (n <= 100000 || same) {
		for (i = 0; i < n; i++) {
			xx[i] += X, yy[i] += X;
			ii[i] = ii_[i] = i;
		}
		compare = compare_r, sort(ii, 0, n);
		for (lg = 30, h = 0; lg >= 0; lg--) {
			int x, y;

			memset(gg, 0, C * sizeof *gg);
			for (i = 0; i < n; i++)
				xx_[i] = xx[i] >> lg + 1, yy_[i] = yy[i] >> lg + 1;
			for (h_ = 0; h_ < n; h_++) {
				i = ii_[h_], x = xx_[i], y = yy_[i];
				for (c = 0; c < C; c++) {
					int dx = c / 5 - 2, dy = c % 5 - 2;

					while (gg[c] < n && cmp(xx_[ii_[gg[c]]], yy_[ii_[gg[c]]], x + dx, y + dy) < 0)
						gg[c]++;
					ggg[i][c] = gg[c] < n && cmp(xx_[ii_[gg[c]]], yy_[ii_[gg[c]]], x + dx, y + dy) == 0 ? gg[c] : -1;
				}
			}
			memset(kk, 0, n * sizeof *kk);
			for (h_ = h; h_ < n; h_++) {
				int p;

				i = ii[h_], x = xx_[i], y = yy_[i], p = -1;
				if (type[i] == -1)
					continue;
				for (c = 0; c < C; c++) {
					g = ggg[i][c];
					if (g == -1)
						continue;
					for (k = 0; k < kk[g]; k++) {
						j = iii[g][k];
						if (intersect(i, j)) {
							if (p == -1 || rr_[p] < rr_[j] || rr_[p] == rr_[j] && p > j)
								p = j;
							break;
						}
					}
				}
				if (p != -1)
					pp[i] = p, type[i] = -1;
				else {
					pp[i] = i, type[i] = 1;
					if (rr_[i] >= 1 << lg) {
						g = ggg[i][(0 + 2) * 5 + (0 + 2)];
						iii[g][kk[g]++] = i;
					}
				}
			}
			while (h < n && rr_[ii[h]] >= 1 << lg)
				h++;
			for (i = 0; i < n; i = j) {
				int x = xx_[ii_[i]];

				j = i + 1;
				while (j < n && xx_[ii_[j]] == x)
					j++;
				cnt = 0;
				for (h_ = i; h_ < j; h_++)
					if ((xx[ii_[h_]] >> lg & 1) == 0)
						ii_[i++] = ii_[h_];
					else
						tmp[cnt++] = ii_[h_];
				memcpy(ii_ + i, tmp, cnt * sizeof *tmp);
			}
			for (i = 0; i < n; i = j) {
				int x = xx[ii_[i]] >> lg, y = yy_[ii_[i]];

				j = i + 1;
				while (j < n && (xx[ii_[j]] >> lg) == x && yy_[ii_[j]] == y)
					j++;
				cnt = 0;
				for (h_ = i; h_ < j; h_++)
					if ((yy[ii_[h_]] >> lg & 1) == 0)
						ii_[i++] = ii_[h_];
					else
						tmp[cnt++] = ii_[h_];
				memcpy(ii_ + i, tmp, cnt * sizeof *tmp);
			}
		}
	} else if (segs) {
		for (i = 0; i < n; i++)
			ii[i] = i;
		compare = compare_r, sort(ii, 0, n);
		for (h = 0; h < n; h++) {
			int i = ii[h], p, q;

			split(u_, i);
			p = l_ ? ii1[last(l_)] : -1, q = r_ ? ii1[first(r_)] : -1;
			if (p != -1 && xx[p] + rr_[p] < xx[i] - rr_[i])
				p = -1;
			if (q != -1 && xx[q] - rr_[q] > xx[i] + rr_[i])
				q = -1;
			if (p == -1 && q == -1)
				pp[i] = i, u_ = node(i);
			else
				pp[i] = q == -1 || p != -1 && (rr_[p] > rr_[q] || rr_[p] == rr_[q] && p < q) ? p : q;
			u_ = merge(merge(l_, u_), r_);
		}
	} else {
		for (i = 0; i < n; i++)
			yy_[i << 1 | 0] = yy[i] - rr_[i], yy_[i << 1 | 1] = yy[i] + rr_[i];
		for (i = 0; i < n * 2; i++)
			ii[i] = i;
		compare = compare_y, sort(ii, 0, n * 2);
		for (i = 0; i < n; i++)
			pp[i] = i;
		for (h = 0; h < n * 2; h++) {
			int i_ = ii[h], p, q;

			i = i_ >> 1;
			if ((i_ & 1) == 0) {
				split(u_, i);
				p = l_ ? ii1[last(l_)] : -1, q = r_ ? ii1[first(r_)] : -1;
				if (p != -1 && intersect(p, i))
					l_ = remove_last(l_), pp[i] = pp[p] = p == -1 || i != -1 && (rr_[i] > rr_[p] || rr_[i] == rr_[p] && i < p) ? i : p;
				else if (q != -1 && intersect(q, i))
					r_ = remove_first(r_), pp[i] = pp[q] = q == -1 || i != -1 && (rr_[i] > rr_[q] || rr_[i] == rr_[q] && i < q) ? i : q;
				else
					u_ = node(i);
				u_ = merge(merge(l_, u_), r_);
			} else {
				split(u_, i);
				p = l_ ? ii1[last(l_)] : -1, q = r_ ? ii1[first(r_)] : -1;
				if (p != -1 && q != -1 && intersect(p, q))
					l_ = remove_last(l_), r_ = remove_first(r_), pp[p] = pp[q] = q == -1 || p != -1 && (rr_[p] > rr_[q] || rr_[p] == rr_[q] && p < q) ? p : q;
				u_ = merge(l_, r_);
			}
		}
	}
	for (i = 0; i < n; i++)
		printf("%d ", pp[i] + 1);
	printf("\n");
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

circle_selection.c: In function 'main':
circle_selection.c:149:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  149 |     xx_[i] = xx[i] >> lg + 1, yy_[i] = yy[i] >> lg + 1;
      |                       ~~~^~~
circle_selection.c:149:52: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  149 |     xx_[i] = xx[i] >> lg + 1, yy_[i] = yy[i] >> lg + 1;
      |                                                 ~~~^~~
circle_selection.c:174:59: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  174 |        if (p == -1 || rr_[p] < rr_[j] || rr_[p] == rr_[j] && p > j)
      |                                          ~~~~~~~~~~~~~~~~~^~~~~~~~
circle_selection.c:237:72: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  237 |     pp[i] = q == -1 || p != -1 && (rr_[p] > rr_[q] || rr_[p] == rr_[q] && p < q) ? p : q;
      |                                                       ~~~~~~~~~~~~~~~~~^~~~~~~~
circle_selection.c:237:32: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  237 |     pp[i] = q == -1 || p != -1 && (rr_[p] > rr_[q] || rr_[p] == rr_[q] && p < q) ? p : q;
      |                        ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
circle_selection.c:256:103: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  256 |      l_ = remove_last(l_), pp[i] = pp[p] = p == -1 || i != -1 && (rr_[i] > rr_[p] || rr_[i] == rr_[p] && i < p) ? i : p;
      |                                                                                      ~~~~~~~~~~~~~~~~~^~~~~~~~
circle_selection.c:256:63: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  256 |      l_ = remove_last(l_), pp[i] = pp[p] = p == -1 || i != -1 && (rr_[i] > rr_[p] || rr_[i] == rr_[p] && i < p) ? i : p;
      |                                                       ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
circle_selection.c:258:104: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  258 |      r_ = remove_first(r_), pp[i] = pp[q] = q == -1 || i != -1 && (rr_[i] > rr_[q] || rr_[i] == rr_[q] && i < q) ? i : q;
      |                                                                                       ~~~~~~~~~~~~~~~~~^~~~~~~~
circle_selection.c:258:64: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  258 |      r_ = remove_first(r_), pp[i] = pp[q] = q == -1 || i != -1 && (rr_[i] > rr_[q] || rr_[i] == rr_[q] && i < q) ? i : q;
      |                                                        ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
circle_selection.c:266:126: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  266 |      l_ = remove_last(l_), r_ = remove_first(r_), pp[p] = pp[q] = q == -1 || p != -1 && (rr_[p] > rr_[q] || rr_[p] == rr_[q] && p < q) ? p : q;
      |                                                                                                             ~~~~~~~~~~~~~~~~~^~~~~~~~
circle_selection.c:266:86: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  266 |      l_ = remove_last(l_), r_ = remove_first(r_), pp[p] = pp[q] = q == -1 || p != -1 && (rr_[p] > rr_[q] || rr_[p] == rr_[q] && p < q) ? p : q;
      |                                                                              ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
circle_selection.c:129:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
  129 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
circle_selection.c:132:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
  132 |   scanf("%d%d%d", &xx[i], &yy[i], &rr_[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 30 / 30
• Subtask 6: 0 / 13