oj.uz

답안 #927436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927436 2024-02-14T20:55:57 Z rainboy Cell Automaton (JOI23_cell) C
74 / 100
 871 ms 54504 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N	100000
#define Q	500000
#define INF	0x7fffffff

int abs_(int a) { return a > 0 ? a : -a; }
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }

unsigned int Z = 12345;

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

int xx[N], xx_[N], yy[N], yy_[N], uu[N], vv[N], tt_[N], n;
int tt[Q]; long long ans[Q]; int q;

int *ww;

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 = ww[ii[j]] != ww[i_] ? (ww[ii[j]] < ww[i_] ? -1 : 1) : (xx[ii[j]] != xx[i_] ? (xx[ii[j]] < xx[i_] ? -1 : 1) : 0);

			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;
	}
}

void compress(int *xx, int *xx_, int n) {
	static int ii[N];
	int i, x;

	for (i = 0; i < n; i++)
		ii[i] = i;
	ww = xx, sort(ii, 0, n);
	for (i = 0, x = 0; i < n; i++)
		xx_[ii[i]] = i + 1 == n || xx[ii[i + 1]] != xx[ii[i]] ? x++ : x;
}

int ft[N];

int min_(int i, int j) {
	return j == -1 || i != -1 && (vv[i] < vv[j] || vv[i] == vv[j] && i < j) ? i : j;
}

void update(int i, int n, int x) {
	while (i < n) {
		ft[i] = min_(ft[i], x);
		i |= i + 1;
	}
}

int query(int i) {
	int x = -1;

	while (i >= 0) {
		x = min_(x, ft[i]);
		i &= i + 1, i--;
	}
	return x;
}

int *ej[N], eo[N];

void append(int i, int j) {
	int o = eo[i]++;

	if (o >= 2 && (o & o - 1) == 0)
		ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
	ej[i][o] = j;
}

int aa[Q + 1]; long long bb[Q + 1];

void add(int t, int a, long long b) {
	int lower = -1, upper = q;

	while (upper - lower > 1) {
		int h = (lower + upper) / 2;

		if (tt[h] >= t)
			upper = h;
		else
			lower = h;
	}
	aa[upper] += a, bb[upper] += b;
}

int main() {
	static int ii[N], qu[N * 16], ii_[N * 32], jj_[N * 32];
	int m, cnt, h, i, i_, j, j_, jl, jr, r, o, t, t_, tmp;
	long long u, u_, ul, ur;

	scanf("%d%d", &n, &q);
	for (i = 0; i < n; i++)
		scanf("%d%d", &xx[i], &yy[i]);
	for (h = 0; h < q; h++)
		scanf("%d", &tt[h]);
	for (i = 0; i < n; i++)
		uu[i] = xx[i] - yy[i], vv[i] = xx[i] + yy[i];
	for (i = 0; i < n; i++)
		ej[i] = (int *) malloc(2 * sizeof *ej[i]), eo[i] = 0;
	compress(xx, xx_, n), compress(yy, yy_, n);
	for (r = 0; r < 4; r++) {
		for (i = 0; i < n; i++)
			ii[i] = i;
		ww = uu, sort(ii, 0, n);
		memset(ft, -1, n * sizeof *ft);
		for (i = 0; i < n; i = j) {
			j = i + 1;
			while (j < n && uu[ii[j]] == uu[ii[i]])
				j++;
			for (h = i; h < j; h++) {
				i_ = ii[h], j_ = query(n - 1 - xx_[i_]);
				if (j_ != -1)
					append(i_, j_), append(j_, i_);
				update(n - 1 - xx_[i_], n, i_);
			}
			cnt = 0;
			for (h = i; h < j; h++) {
				i_ = ii[h];
				while (cnt && qu[cnt - 1] > i_)
					cnt--;
				if (cnt) {
					j_ = qu[cnt - 1];
					append(i_, j_), append(j_, i_);
				}
				qu[cnt++] = i_;
			}
		}
		memset(ft, -1, n * sizeof *ft);
		for (j = n; j > 0; j = i) {
			i = j - 1;
			while (i > 0 && uu[ii[i - 1]] == uu[ii[j - 1]])
				i--;
			for (h = i; h < j; h++) {
				i_ = ii[h], j_ = query(n - 1 - yy_[i_]);
				if (j_ != -1)
					append(i_, j_), append(j_, i_);
				update(n - 1 - yy_[i_], n, i_);
			}
		}
		for (i = 0; i < n; i++) {
			tmp = xx[i], xx[i] = -yy[i], yy[i] = tmp;
			tmp = xx_[i], xx_[i] = n - 1 - yy_[i], yy_[i] = tmp;
			tmp = uu[i], uu[i] = -vv[i], vv[i] = tmp;
		}
	}
	for (i = 0; i < n; i++) {
		for (o = 0; o < eo[i]; o++) {
			j = ej[i][o];
			tt_[j] = ((long long) abs_(xx[j] - xx[i]) + abs_(yy[j] - yy[i]) + (i < j ? 2 : 1)) / 2;
		}
		ww = tt_, sort(ej[i], 0, eo[i]);
	}
	m = 0;
	for (r = 0; r < 4; r++) {
		for (i = 0; i < n; i++) {
			u = uu[i], ul = -INF, jl = -1, ur = INF, jr = -1, t_ = -1, cnt = 0;
			for (o = 0; o < eo[i]; o++) {
				j = ej[i][o], t = ((long long) abs_(xx[j] - xx[i]) + abs_(yy[j] - yy[i]) + (i < j ? 2 : 1)) / 2;
				if (vv[j] < vv[i] || vv[j] == vv[i] && j > i) {
					if (vv[j] == vv[i])
						qu[cnt++] = j;
					continue;
				}
				if (ul != -INF && ur != INF && ul + t > ur - t + 1 && t != t_)
					break;
				t_ = t;
				if (uu[j] < u) {
					u_ = uu[j] + (i < j ? 0 : 1);
					if (ul == -INF) {
						ul = u_, jl = j;
						for (h = 0; h < cnt; h++)
							ii_[m] = qu[h], jj_[m] = j, m++;
					} else {
						ul = max(ul, u_);
						if (uu[jl] < uu[j] || uu[jl] == uu[j] && jl > j)
							jl = j;
					}
				} else {
					u_ = uu[j] - (i < j ? 0 : 1);
					if (ur == INF) {
						ur = u_, jr = j;
						for (h = 0; h < cnt; h++)
							ii_[m] = qu[h], jj_[m] = j, m++;
					} else {
						ur = min(ur, u_);
						if (uu[jr] > uu[j] || uu[jr] == uu[j] && jr > j)
							jr = j;
					}
				}
			}
			if (jl != -1 && jr != -1)
				ii_[m] = jl, jj_[m] = jr, m++;
		}
		for (i = 0; i < n; i++) {
			tmp = xx[i], xx[i] = -yy[i], yy[i] = tmp;
			tmp = uu[i], uu[i] = -vv[i], vv[i] = tmp;
		}
	}
	for (h = 0; h < m; h++) {
		i = ii_[h], j = jj_[h];
		append(i, j), append(j, i);
	}
	for (i = 0; i < n; i++) {
		for (o = 0; o < eo[i]; o++) {
			j = ej[i][o];
			tt_[j] = ((long long) abs_(xx[j] - xx[i]) + abs_(yy[j] - yy[i]) + (i < j ? 2 : 1)) / 2;
		}
		ww = tt_, sort(ej[i], 0, eo[i]);
	}
	for (r = 0; r < 4; r++) {
		for (i = 0; i < n; i++) {
			add(0, 1, 0);
			u = uu[i], ul = -INF, ur = INF, t = INF;
			for (o = 0; o <= eo[i]; o++) {
				if (o == eo[i]) {
					t = ul != -INF && ur != INF ? (ur - ul) / 2 + 1 : INF;
					break;
				}
				j = ej[i][o], t = ((long long) abs_(xx[j] - xx[i]) + abs_(yy[j] - yy[i]) + (i < j ? 2 : 1)) / 2;
				if (vv[j] < vv[i] || vv[j] == vv[i] && j > i)
					continue;
				if (ul != -INF && ur != INF && ul + t > ur - t) {
					t = (ur - ul) / 2 + 1;
					break;
				}
				if (uu[j] < u) {
					u_ = uu[j] + (i < j ? 0 : 1);
					if (ul == -INF)
						add(t, -1, (u - u_) / 2), ul = u_;
					else if (ul < u_)
						add(t, 0, (u - u_) / 2 - (u - ul) / 2), ul = u_;
				} else {
					u_ = uu[j] - (i < j ? 0 : 1);
					if (ur == INF)
						add(t, -1, (u_ - u + 2) / 2), ur = u_;
					else if (ur > u_)
						add(t, 0, (u_ - u + 2) / 2 - (ur - u + 2) / 2), ur = u_;
				}
				if (ul != -INF && ur != INF && ul + t > ur - t)
					break;
			}
			if (t != INF)
				add(t, 1, -((u - ul) / 2 + (ur - u + 2) / 2));
		}
		for (i = 0; i < n; i++) {
			tmp = xx[i], xx[i] = -yy[i], yy[i] = tmp;
			tmp = uu[i], uu[i] = -vv[i], vv[i] = tmp;
		}
	}
	for (h = 1; h < q; h++)
		aa[h] += aa[h - 1], bb[h] += bb[h - 1];
	for (h = 0; h < q; h++)
		ans[h] = tt[h] == 0 ? n : (long long) aa[h] * tt[h] + bb[h];
	for (h = 0; h < q; h++)
		printf("%lld\n", ans[h]);
	return 0;
}

Compilation message

cell.c: In function 'min_':
cell.c:60:64: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   60 |  return j == -1 || i != -1 && (vv[i] < vv[j] || vv[i] == vv[j] && i < j) ? i : j;
      |                                                 ~~~~~~~~~~~~~~~^~~~~~~~
cell.c:60:28: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   60 |  return j == -1 || i != -1 && (vv[i] < vv[j] || vv[i] == vv[j] && i < j) ? i : j;
      |                    ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cell.c: In function 'append':
cell.c:85:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   85 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
cell.c: In function 'main':
cell.c:179:41: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  179 |     if (vv[j] < vv[i] || vv[j] == vv[i] && j > i) {
      |                          ~~~~~~~~~~~~~~~^~~~~~~~
cell.c:195:45: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  195 |       if (uu[jl] < uu[j] || uu[jl] == uu[j] && jl > j)
      |                             ~~~~~~~~~~~~~~~~^~~~~~~~~
cell.c:206:45: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  206 |       if (uu[jr] > uu[j] || uu[jr] == uu[j] && jr > j)
      |                             ~~~~~~~~~~~~~~~~^~~~~~~~~
cell.c:240:41: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  240 |     if (vv[j] < vv[i] || vv[j] == vv[i] && j > i)
      |                          ~~~~~~~~~~~~~~~^~~~~~~~
cell.c:111:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  111 |  scanf("%d%d", &n, &q);
      |  ^~~~~~~~~~~~~~~~~~~~~
cell.c:113:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |   scanf("%d%d", &xx[i], &yy[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cell.c:115:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |   scanf("%d", &tt[h]);
      |   ^~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 19032 KB Output is correct
2 Correct 2 ms 18776 KB Output is correct
3 Correct 3 ms 18780 KB Output is correct
4 Correct 2 ms 18780 KB Output is correct
5 Correct 2 ms 18780 KB Output is correct
6 Correct 2 ms 18780 KB Output is correct
7 Correct 2 ms 18780 KB Output is correct
8 Correct 43 ms 20936 KB Output is correct
9 Correct 2 ms 18776 KB Output is correct
10 Correct 2 ms 18780 KB Output is correct
11 Correct 2 ms 18780 KB Output is correct
12 Correct 7 ms 19288 KB Output is correct
13 Correct 8 ms 19036 KB Output is correct
14 Correct 7 ms 19036 KB Output is correct
15 Correct 7 ms 19036 KB Output is correct
16 Correct 2 ms 16732 KB Output is correct
17 Correct 2 ms 16732 KB Output is correct
18 Correct 2 ms 16732 KB Output is correct
19 Correct 2 ms 18780 KB Output is correct
20 Correct 2 ms 18780 KB Output is correct
21 Correct 2 ms 18780 KB Output is correct
22 Correct 2 ms 18780 KB Output is correct
23 Correct 2 ms 18780 KB Output is correct
24 Correct 2 ms 18780 KB Output is correct
25 Correct 2 ms 18780 KB Output is correct
26 Correct 2 ms 18780 KB Output is correct
27 Correct 3 ms 18780 KB Output is correct
28 Correct 2 ms 18864 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 19032 KB Output is correct
2 Correct 2 ms 18776 KB Output is correct
3 Correct 3 ms 18780 KB Output is correct
4 Correct 2 ms 18780 KB Output is correct
5 Correct 2 ms 18780 KB Output is correct
6 Correct 2 ms 18780 KB Output is correct
7 Correct 2 ms 18780 KB Output is correct
8 Correct 43 ms 20936 KB Output is correct
9 Correct 2 ms 18776 KB Output is correct
10 Correct 2 ms 18780 KB Output is correct
11 Correct 2 ms 18780 KB Output is correct
12 Correct 7 ms 19288 KB Output is correct
13 Correct 8 ms 19036 KB Output is correct
14 Correct 7 ms 19036 KB Output is correct
15 Correct 7 ms 19036 KB Output is correct
16 Correct 2 ms 16732 KB Output is correct
17 Correct 2 ms 16732 KB Output is correct
18 Correct 2 ms 16732 KB Output is correct
19 Correct 2 ms 18780 KB Output is correct
20 Correct 2 ms 18780 KB Output is correct
21 Correct 2 ms 18780 KB Output is correct
22 Correct 2 ms 18780 KB Output is correct
23 Correct 2 ms 18780 KB Output is correct
24 Correct 2 ms 18780 KB Output is correct
25 Correct 2 ms 18780 KB Output is correct
26 Correct 2 ms 18780 KB Output is correct
27 Correct 3 ms 18780 KB Output is correct
28 Correct 2 ms 18864 KB Output is correct
29 Correct 2 ms 18776 KB Output is correct
30 Correct 2 ms 18780 KB Output is correct
31 Correct 4 ms 18780 KB Output is correct
32 Correct 773 ms 47700 KB Output is correct
33 Correct 3 ms 18776 KB Output is correct
34 Correct 3 ms 18780 KB Output is correct
35 Correct 5 ms 19036 KB Output is correct
36 Correct 2 ms 16732 KB Output is correct
37 Correct 2 ms 16732 KB Output is correct
38 Correct 8 ms 19036 KB Output is correct
39 Correct 60 ms 21028 KB Output is correct
40 Correct 765 ms 47680 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 362 ms 40396 KB Output is correct
2 Correct 362 ms 40788 KB Output is correct
3 Correct 351 ms 40528 KB Output is correct
4 Correct 383 ms 40708 KB Output is correct
5 Correct 377 ms 40536 KB Output is correct
6 Correct 366 ms 40696 KB Output is correct
7 Correct 363 ms 40432 KB Output is correct
8 Correct 2 ms 16732 KB Output is correct
9 Correct 2 ms 16732 KB Output is correct
10 Correct 5 ms 19036 KB Output is correct
11 Correct 389 ms 40640 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 362 ms 40396 KB Output is correct
2 Correct 362 ms 40788 KB Output is correct
3 Correct 351 ms 40528 KB Output is correct
4 Correct 383 ms 40708 KB Output is correct
5 Correct 377 ms 40536 KB Output is correct
6 Correct 366 ms 40696 KB Output is correct
7 Correct 363 ms 40432 KB Output is correct
8 Correct 2 ms 16732 KB Output is correct
9 Correct 2 ms 16732 KB Output is correct
10 Correct 5 ms 19036 KB Output is correct
11 Correct 389 ms 40640 KB Output is correct
12 Correct 559 ms 49256 KB Output is correct
13 Correct 560 ms 49256 KB Output is correct
14 Correct 536 ms 49236 KB Output is correct
15 Correct 610 ms 49232 KB Output is correct
16 Correct 69 ms 23736 KB Output is correct
17 Correct 76 ms 23704 KB Output is correct
18 Correct 77 ms 27560 KB Output is correct
19 Correct 526 ms 49756 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 19036 KB Output is correct
2 Correct 7 ms 19036 KB Output is correct
3 Correct 11 ms 19292 KB Output is correct
4 Correct 10 ms 19176 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 19036 KB Output is correct
2 Correct 7 ms 19036 KB Output is correct
3 Correct 11 ms 19292 KB Output is correct
4 Correct 10 ms 19176 KB Output is correct
5 Correct 82 ms 27296 KB Output is correct
6 Correct 90 ms 27492 KB Output is correct
7 Correct 86 ms 27732 KB Output is correct
8 Correct 85 ms 27816 KB Output is correct
9 Correct 85 ms 27884 KB Output is correct
10 Correct 88 ms 27832 KB Output is correct
11 Correct 88 ms 28240 KB Output is correct
12 Correct 88 ms 28240 KB Output is correct

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 19032 KB Output is correct
2 Correct 2 ms 18776 KB Output is correct
3 Correct 3 ms 18780 KB Output is correct
4 Correct 2 ms 18780 KB Output is correct
5 Correct 2 ms 18780 KB Output is correct
6 Correct 2 ms 18780 KB Output is correct
7 Correct 2 ms 18780 KB Output is correct
8 Correct 43 ms 20936 KB Output is correct
9 Correct 2 ms 18776 KB Output is correct
10 Correct 2 ms 18780 KB Output is correct
11 Correct 2 ms 18780 KB Output is correct
12 Correct 7 ms 19288 KB Output is correct
13 Correct 8 ms 19036 KB Output is correct
14 Correct 7 ms 19036 KB Output is correct
15 Correct 7 ms 19036 KB Output is correct
16 Correct 2 ms 16732 KB Output is correct
17 Correct 2 ms 16732 KB Output is correct
18 Correct 2 ms 16732 KB Output is correct
19 Correct 2 ms 18780 KB Output is correct
20 Correct 2 ms 18780 KB Output is correct
21 Correct 2 ms 18780 KB Output is correct
22 Correct 2 ms 18780 KB Output is correct
23 Correct 2 ms 18780 KB Output is correct
24 Correct 2 ms 18780 KB Output is correct
25 Correct 2 ms 18780 KB Output is correct
26 Correct 2 ms 18780 KB Output is correct
27 Correct 3 ms 18780 KB Output is correct
28 Correct 2 ms 18864 KB Output is correct
29 Correct 2 ms 18776 KB Output is correct
30 Correct 2 ms 18780 KB Output is correct
31 Correct 4 ms 18780 KB Output is correct
32 Correct 773 ms 47700 KB Output is correct
33 Correct 3 ms 18776 KB Output is correct
34 Correct 3 ms 18780 KB Output is correct
35 Correct 5 ms 19036 KB Output is correct
36 Correct 2 ms 16732 KB Output is correct
37 Correct 2 ms 16732 KB Output is correct
38 Correct 8 ms 19036 KB Output is correct
39 Correct 60 ms 21028 KB Output is correct
40 Correct 765 ms 47680 KB Output is correct
41 Correct 362 ms 40396 KB Output is correct
42 Correct 362 ms 40788 KB Output is correct
43 Correct 351 ms 40528 KB Output is correct
44 Correct 383 ms 40708 KB Output is correct
45 Correct 377 ms 40536 KB Output is correct
46 Correct 366 ms 40696 KB Output is correct
47 Correct 363 ms 40432 KB Output is correct
48 Correct 2 ms 16732 KB Output is correct
49 Correct 2 ms 16732 KB Output is correct
50 Correct 5 ms 19036 KB Output is correct
51 Correct 389 ms 40640 KB Output is correct
52 Correct 559 ms 49256 KB Output is correct
53 Correct 560 ms 49256 KB Output is correct
54 Correct 536 ms 49236 KB Output is correct
55 Correct 610 ms 49232 KB Output is correct
56 Correct 69 ms 23736 KB Output is correct
57 Correct 76 ms 23704 KB Output is correct
58 Correct 77 ms 27560 KB Output is correct
59 Correct 526 ms 49756 KB Output is correct
60 Correct 6 ms 19036 KB Output is correct
61 Correct 7 ms 19036 KB Output is correct
62 Correct 11 ms 19292 KB Output is correct
63 Correct 10 ms 19176 KB Output is correct
64 Correct 82 ms 27296 KB Output is correct
65 Correct 90 ms 27492 KB Output is correct
66 Correct 86 ms 27732 KB Output is correct
67 Correct 85 ms 27816 KB Output is correct
68 Correct 85 ms 27884 KB Output is correct
69 Correct 88 ms 27832 KB Output is correct
70 Correct 88 ms 28240 KB Output is correct
71 Correct 88 ms 28240 KB Output is correct
72 Correct 2 ms 16732 KB Output is correct
73 Correct 2 ms 16732 KB Output is correct
74 Correct 2 ms 18780 KB Output is correct
75 Correct 576 ms 38924 KB Output is correct
76 Correct 550 ms 38316 KB Output is correct
77 Correct 525 ms 38072 KB Output is correct
78 Correct 520 ms 38228 KB Output is correct
79 Incorrect 871 ms 54504 KB Output isn't correct
80 Halted 0 ms 0 KB -