oj.uz

Submission #680450

# Submission time Handle Problem Language Result Execution time Memory
680450 2023-01-10T21:31:40 Z rainboy Wild Boar (JOI18_wild_boar) C
100 / 100
 9260 ms 540664 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
#define N	2000
#define M	2000
#define M2	(M * 2)
#define MM	(M * M)
#define K	6
#define L	100000
#define N_	(1 << 17)	/* N_ = pow2(ceil(log2(L))) */
#define INF	0x3f3f3f3f3f3f3f3fLL
 
long long min(long long a, long long b) { return a < b ? a : b; }
 
unsigned int Z = 12345;
 
int rand_() {
	return (Z *= 3) >> 1;
}
 
int ij[M2], cc[M], m;
int *eh[N], eo[N], n;
 
void append(int i, int h) {
	int o = eo[i]++;
 
	if (o >= 2 && (o & o - 1) == 0)
		eh[i] = (int *) realloc(eh[i], o * 2 * sizeof *eh[i]);
	eh[i][o] = h;
}
 
long long *dd_; int iq[M2 + 1], pq[M2], cnt;
 
int lt(int i, int j) { return dd_[i] < dd_[j]; }
 
int p2(int p) {
	return (p *= 2) > cnt ? 0 : (p < cnt && lt(iq[p + 1], iq[p]) ? p + 1 : p);
}
 
void pq_up(int i) {
	int p, q, j;
 
	for (p = pq[i]; (q = p / 2) && lt(i, j = iq[q]); p = q)
		iq[pq[j] = p] = j;
	iq[pq[i] = p] = i;
}
 
void pq_dn(int i) {
	int p, q, j;
 
	for (p = pq[i]; (q = p2(p)) && lt(j = iq[q], i); p = q)
		iq[pq[j] = p] = j;
	iq[pq[i] = p] = i;
}
 
void pq_add_last(int i) {
	iq[pq[i] = ++cnt] = i;
}
 
int pq_remove_first() {
	int i = iq[1], j = iq[cnt--];
 
	if (j != i)
		pq[j] = 1, pq_dn(j);
	pq[i] = 0;
	return i;
}
 
void solve(long long *dd, int u) {
	static int kk[N];
	int h, i, o;
 
	memset(dd, 0x3f, m * 2 * sizeof *dd), memset(kk, 0, n * sizeof *kk);
	dd_ = dd, dd[u] = cc[u >> 1], pq_add_last(u);
	while (cnt) {
		h = pq_remove_first(), i = ij[h ^ 1];
		if (kk[i] < 2) {
			kk[i]++;
			for (o = eo[i]; o--; ) {
				int h_ = eh[i][o];
				long long d = dd[h] + cc[h_ >> 1];
 
				if ((h ^ h_) != 1 && dd[h_] > d) {
					if (dd[h_] == INF)
						pq_add_last(h_);
					dd[h_] = d, pq_up(h_);
				}
			}
		}
	}
}
 
int uu1[MM], vv1[MM]; long long ww1[MM];
 
int compare_uv(int h1, int h2) {
	return uu1[h1] != uu1[h2] ? uu1[h1] - uu1[h2] : vv1[h1] - vv1[h2];
}
 
int compare_w(int h1, int h2) {
	return ww1[h1] == ww1[h2] ? 0 : (ww1[h1] < ww1[h2] ? -1 : 1);
}
 
int (*compare)(int, int);
 
void sort(int *gg, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, g = gg[l + rand_() % (r - l)], tmp;
 
		while (j < k) {
			int c = compare(gg[j], g);
 
			if (c == 0)
				j++;
			else if (c < 0) {
				tmp = gg[i], gg[i] = gg[j], gg[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = gg[j], gg[j] = gg[k], gg[k] = tmp;
			}
		}
		sort(gg, l, i);
		l = k;
	}
}
 
int simplify(int k) {
	static int dd1[M2], dd2[M2], gg[MM], uu_[MM], vv_[MM];
	static long long ww_[MM];
	int k_, g, g_, u, v;
	long long w;
 
	for (g = 0; g < k; g++)
		gg[g] = g;
	compare = compare_uv, sort(gg, 0, k);
	k_ = 0;
	for (g = 0; g < k; g = g_) {
		u = uu1[gg[g]], v = vv1[gg[g]];
		g_ = g, w = INF;
		while (g_ < k && uu1[gg[g_]] == u && vv1[gg[g_]] == v)
			w = min(w, ww1[gg[g_++]]);
		uu_[k_] = u, vv_[k_] = v, ww_[k_] = w, k_++;
	}
	memcpy(uu1, uu_, k_ * sizeof *uu_);
	memcpy(vv1, vv_, k_ * sizeof *vv_);
	memcpy(ww1, ww_, k_ * sizeof *ww_);
	k = k_;
	for (g = 0; g < k; g++)
		gg[g] = g;
	compare = compare_w, sort(gg, 0, k);
	k_ = 0;
	for (g = 0; g < k; g++) {
		g_ = gg[g], u = uu1[g_], v = vv1[g_], w = ww1[g_];
		if (dd1[u] >= 2 || dd2[v] >= 2)
			continue;
		dd1[u]++, dd2[v]++;
		if (k_ < K)
			uu_[k_] = u, vv_[k_] = v, ww_[k_] = w, k_++;
	}
	for (g = 0; g < k; g++) {
		u = uu1[g], v = vv1[g];
		dd1[u] = 0, dd2[v] = 0;
	}
	memcpy(uu1, uu_, k_ * sizeof *uu_);
	memcpy(vv1, vv_, k_ * sizeof *vv_);
	memcpy(ww1, ww_, k_ * sizeof *ww_);
	return k_;
}
 
int uu[N][N][K], vv[N][N][K], kk[N][N]; long long ww[N][N][K];
 
int uu_[N_ * 2][K], vv_[N_ * 2][K], kk_[N_ * 2], n_; long long ww_[N_ * 2][K];
 
void pul(int i) {
	int l, r, k, g1, g2;
 
	l = i << 1, r = l | 1;
	if (kk_[l] == -1 && kk_[r] == -1)
		kk_[i] = -1;
	else if (kk_[r] == -1) {
		memcpy(uu_[i], uu_[l], kk_[l] * sizeof *uu_[l]);
		memcpy(vv_[i], vv_[l], kk_[l] * sizeof *vv_[l]);
		memcpy(ww_[i], ww_[l], kk_[l] * sizeof *ww_[l]);
		kk_[i] = kk_[l];
	} else if (kk_[l] == -1) {
		memcpy(uu_[i], uu_[r], kk_[r] * sizeof *uu_[r]);
		memcpy(vv_[i], vv_[r], kk_[r] * sizeof *vv_[r]);
		memcpy(ww_[i], ww_[r], kk_[r] * sizeof *ww_[r]);
		kk_[i] = kk_[r];
	} else {
		k = 0;
		for (g1 = 0; g1 < kk_[l]; g1++)
			for (g2 = 0; g2 < kk_[r]; g2++)
				if ((vv_[l][g1] ^ uu_[r][g2]) != 1)
					uu1[k] = uu_[l][g1], vv1[k] = vv_[r][g2], ww1[k] = min(ww_[l][g1] + ww_[r][g2], INF), k++;
		k = simplify(k);
		memcpy(uu_[i], uu1, k * sizeof *uu1);
		memcpy(vv_[i], vv1, k * sizeof *vv1);
		memcpy(ww_[i], ww1, k * sizeof *ww1);
		kk_[i] = k;
	}
}
 
int ii[L], l;
 
void build() {
	int h, i, j;
 
	n_ = 1;
	while (n_ < l)
		n_ <<= 1;
	for (h = 0; h < n_; h++)
		if (h + 1 < l) {
			i = ii[h], j = ii[h + 1];
			memcpy(uu_[n_ + h], uu[i][j], kk[i][j] * sizeof *uu[i][j]);
			memcpy(vv_[n_ + h], vv[i][j], kk[i][j] * sizeof *vv[i][j]);
			memcpy(ww_[n_ + h], ww[i][j], kk[i][j] * sizeof *ww[i][j]);
			kk_[n_ + h] = kk[i][j];
		} else
			kk_[n_ + h] = -1;
	for (h = n_ - 1; h > 0; h--)
		pul(h);
}
 
void upd(int h) {
	int i = ii[h], j = ii[h + 1];
 
	memcpy(uu_[n_ + h], uu[i][j], kk[i][j] * sizeof *uu[i][j]);
	memcpy(vv_[n_ + h], vv[i][j], kk[i][j] * sizeof *vv[i][j]);
	memcpy(ww_[n_ + h], ww[i][j], kk[i][j] * sizeof *ww[i][j]);
	kk_[n_ + h] = kk[i][j];
	h += n_;
	while (h > 1)
		pul(h >>= 1);
}
 
int main() {
	static long long dd[M2][M2];
	int q, k, g, h, i, j, u, v, o, o_;
 
	scanf("%d%d%d%d", &n, &m, &q, &l);
	for (i = 0; i < n; i++)
		eh[i] = (int *) malloc(2 * sizeof *eh[i]);
	for (h = 0; h < m; h++) {
		scanf("%d%d%d", &i, &j, &cc[h]), i--, j--;
		ij[h << 1 | 0] = i, ij[h << 1 | 1] = j;
		append(i, h << 1 | 0), append(j, h << 1 | 1);
	}
	for (u = 0; u < m * 2; u++)
		solve(dd[u], u);
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++) {
			k = 0;
			for (o = eo[i]; o--; ) {
				u = eh[i][o];
				for (o_ = eo[j]; o_--; ) {
					v = eh[j][o_] ^ 1;
					uu1[k] = u, vv1[k] = v, ww1[k] = dd[u][v], k++;
				}
			}
			k = simplify(k);
			memcpy(uu[i][j], uu1, k * sizeof *uu1);
			memcpy(vv[i][j], vv1, k * sizeof *vv1);
			memcpy(ww[i][j], ww1, k * sizeof *ww1);
			kk[i][j] = k;
		}
	for (h = 0; h < l; h++)
		scanf("%d", &ii[h]), ii[h]--;
	build();
	while (q--) {
		long long ans;
 
		scanf("%d%d", &h, &i), h--, i--;
		ii[h] = i;
		if (h > 0)
			upd(h - 1);
		if (h + 1 < l)
			upd(h);
		ans = INF;
		for (g = 0; g < kk_[1]; g++)
			ans = min(ans, ww_[1][g]);
		printf("%lld\n", ans == INF ? -1 : ans);
	}
	return 0;
}

Compilation message

wild_boar.c: In function 'append':
wild_boar.c:28:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   28 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
wild_boar.c: In function 'main':
wild_boar.c:242:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  242 |  scanf("%d%d%d%d", &n, &m, &q, &l);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.c:246:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  246 |   scanf("%d%d%d", &i, &j, &cc[h]), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.c:269:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  269 |   scanf("%d", &ii[h]), ii[h]--;
      |   ^~~~~~~~~~~~~~~~~~~
wild_boar.c:274:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  274 |   scanf("%d%d", &h, &i), h--, i--;
      |   ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 0 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 0 ms 596 KB Output is correct
17 Correct 0 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 596 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 0 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 0 ms 596 KB Output is correct
17 Correct 0 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 3 ms 1108 KB Output is correct
27 Correct 41 ms 22980 KB Output is correct
28 Correct 41 ms 23048 KB Output is correct
29 Correct 337 ms 28584 KB Output is correct
30 Correct 412 ms 28588 KB Output is correct
31 Correct 394 ms 28824 KB Output is correct
32 Correct 349 ms 28776 KB Output is correct
33 Correct 266 ms 30608 KB Output is correct
34 Correct 250 ms 30620 KB Output is correct
35 Correct 375 ms 30816 KB Output is correct
36 Correct 409 ms 30884 KB Output is correct
37 Correct 274 ms 30700 KB Output is correct
38 Correct 195 ms 33156 KB Output is correct
39 Correct 368 ms 33192 KB Output is correct
40 Correct 202 ms 33200 KB Output is correct
41 Correct 204 ms 33184 KB Output is correct
42 Correct 319 ms 35020 KB Output is correct
43 Correct 154 ms 36156 KB Output is correct
44 Correct 150 ms 36352 KB Output is correct
45 Correct 109 ms 39744 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 0 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 0 ms 596 KB Output is correct
17 Correct 0 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 3 ms 1108 KB Output is correct
27 Correct 41 ms 22980 KB Output is correct
28 Correct 41 ms 23048 KB Output is correct
29 Correct 337 ms 28584 KB Output is correct
30 Correct 412 ms 28588 KB Output is correct
31 Correct 394 ms 28824 KB Output is correct
32 Correct 349 ms 28776 KB Output is correct
33 Correct 266 ms 30608 KB Output is correct
34 Correct 250 ms 30620 KB Output is correct
35 Correct 375 ms 30816 KB Output is correct
36 Correct 409 ms 30884 KB Output is correct
37 Correct 274 ms 30700 KB Output is correct
38 Correct 195 ms 33156 KB Output is correct
39 Correct 368 ms 33192 KB Output is correct
40 Correct 202 ms 33200 KB Output is correct
41 Correct 204 ms 33184 KB Output is correct
42 Correct 319 ms 35020 KB Output is correct
43 Correct 154 ms 36156 KB Output is correct
44 Correct 150 ms 36352 KB Output is correct
45 Correct 109 ms 39744 KB Output is correct
46 Correct 251 ms 19428 KB Output is correct
47 Correct 5805 ms 182180 KB Output is correct
48 Correct 5334 ms 225008 KB Output is correct
49 Correct 5131 ms 261588 KB Output is correct
50 Correct 5086 ms 262416 KB Output is correct
51 Correct 5056 ms 264096 KB Output is correct
52 Correct 4689 ms 260036 KB Output is correct
53 Correct 4709 ms 259944 KB Output is correct
54 Correct 4766 ms 260064 KB Output is correct
55 Correct 4661 ms 260140 KB Output is correct
56 Correct 4613 ms 281524 KB Output is correct
57 Correct 4576 ms 305312 KB Output is correct
58 Correct 4301 ms 330928 KB Output is correct
59 Correct 4127 ms 358028 KB Output is correct
60 Correct 3950 ms 387088 KB Output is correct
61 Correct 3812 ms 418372 KB Output is correct
62 Correct 3541 ms 451544 KB Output is correct
63 Correct 3347 ms 486136 KB Output is correct
64 Correct 1636 ms 537572 KB Output is correct
65 Correct 1566 ms 537372 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 0 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 0 ms 596 KB Output is correct
17 Correct 0 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 3 ms 1108 KB Output is correct
27 Correct 41 ms 22980 KB Output is correct
28 Correct 41 ms 23048 KB Output is correct
29 Correct 337 ms 28584 KB Output is correct
30 Correct 412 ms 28588 KB Output is correct
31 Correct 394 ms 28824 KB Output is correct
32 Correct 349 ms 28776 KB Output is correct
33 Correct 266 ms 30608 KB Output is correct
34 Correct 250 ms 30620 KB Output is correct
35 Correct 375 ms 30816 KB Output is correct
36 Correct 409 ms 30884 KB Output is correct
37 Correct 274 ms 30700 KB Output is correct
38 Correct 195 ms 33156 KB Output is correct
39 Correct 368 ms 33192 KB Output is correct
40 Correct 202 ms 33200 KB Output is correct
41 Correct 204 ms 33184 KB Output is correct
42 Correct 319 ms 35020 KB Output is correct
43 Correct 154 ms 36156 KB Output is correct
44 Correct 150 ms 36352 KB Output is correct
45 Correct 109 ms 39744 KB Output is correct
46 Correct 251 ms 19428 KB Output is correct
47 Correct 5805 ms 182180 KB Output is correct
48 Correct 5334 ms 225008 KB Output is correct
49 Correct 5131 ms 261588 KB Output is correct
50 Correct 5086 ms 262416 KB Output is correct
51 Correct 5056 ms 264096 KB Output is correct
52 Correct 4689 ms 260036 KB Output is correct
53 Correct 4709 ms 259944 KB Output is correct
54 Correct 4766 ms 260064 KB Output is correct
55 Correct 4661 ms 260140 KB Output is correct
56 Correct 4613 ms 281524 KB Output is correct
57 Correct 4576 ms 305312 KB Output is correct
58 Correct 4301 ms 330928 KB Output is correct
59 Correct 4127 ms 358028 KB Output is correct
60 Correct 3950 ms 387088 KB Output is correct
61 Correct 3812 ms 418372 KB Output is correct
62 Correct 3541 ms 451544 KB Output is correct
63 Correct 3347 ms 486136 KB Output is correct
64 Correct 1636 ms 537572 KB Output is correct
65 Correct 1566 ms 537372 KB Output is correct
66 Correct 178 ms 21432 KB Output is correct
67 Correct 597 ms 154476 KB Output is correct
68 Correct 1682 ms 517220 KB Output is correct
69 Correct 2085 ms 518452 KB Output is correct
70 Correct 2005 ms 538252 KB Output is correct
71 Correct 9260 ms 184500 KB Output is correct
72 Correct 8943 ms 227456 KB Output is correct
73 Correct 6898 ms 262996 KB Output is correct
74 Correct 7080 ms 262944 KB Output is correct
75 Correct 6959 ms 263008 KB Output is correct
76 Correct 8779 ms 263960 KB Output is correct
77 Correct 8446 ms 266592 KB Output is correct
78 Correct 8351 ms 271464 KB Output is correct
79 Correct 6374 ms 308448 KB Output is correct
80 Correct 6086 ms 333892 KB Output is correct
81 Correct 7656 ms 362264 KB Output is correct
82 Correct 5537 ms 390180 KB Output is correct
83 Correct 7606 ms 421604 KB Output is correct
84 Correct 4873 ms 489260 KB Output is correct
85 Correct 3096 ms 540664 KB Output is correct