oj.uz

Submission #680410

# Submission time Handle Problem Language Result Execution time Memory
680410 2023-01-10T17:53:59 Z rainboy Wild Boar (JOI18_wild_boar) C
62 / 100
 4006 ms 189380 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N	2000
#define M	2000
#define L	100000
#define INF	0x3f3f3f3f3f3f3f3fLL

long long min(long long a, long long b) { return a < b ? a : b; }

int ij[M * 2], 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[M * 2 + 1], pq[M * 2], 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 main() {
	static long long dd[M * 2][M * 2], dp[M * 2], dq[M * 2];
	static int uu1[M * 2][N], uu2[M * 2][N], ii[L];
	int q, l, g, h, i, j, t, t1, t2, u, v;
	long long ans;

	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 (g = 0; g < l; g++)
		scanf("%d", &ii[g]), ii[g]--;
	while (q--) {
		scanf("%d%d", &g, &i), g--, i--;
		ii[g] = i;
	}
	for (v = 0; v < m * 2; v++) {
		memset(uu1[v], -1, n * sizeof *uu1[v]), memset(uu2[v], -1, n * sizeof *uu2[v]);
		for (u = 0; u < m * 2; u++)
			if (dd[u][v] != INF) {
				i = ij[u];
				if (uu1[v][i] == -1 || dd[uu1[v][i]][v] > dd[u][v])
					uu2[v][i] = uu1[v][i], uu1[v][i] = u;
				else if (uu2[v][i] == -1 || dd[uu2[v][i]][v] > dd[u][v])
					uu2[v][i] = u;
			}
	}
	for (g = 0; g + 1 < l; g++) {
		i = ii[g], j = ii[g + 1];
		memset(dq, 0x3f, m * 2 * sizeof *dq);
		t1 = t2 = -1;
		for (t = 0; t < m * 2; t++)
			if (dp[t] != INF) {
				if (t1 == -1 || dp[t1] > dp[t])
					t2 = t1, t1 = t;
				else if (t2 == -1 || dp[t2] > dp[t])
					t2 = t;
			}
		for (v = 0; v < m * 2; v++)
			if (ij[v ^ 1] == j && (u = uu1[v][i]) != -1) {
				if (g == 0)
					dq[v] = min(dq[v], dd[u][v]);
				else {
					if (t1 != -1 && (t1 ^ u) != 1)
						dq[v] = min(dq[v], dp[t1] + dd[u][v]);
					else if (t2 != -1)
						dq[v] = min(dq[v], dp[t2] + dd[u][v]);
					if ((u = uu2[v][i]) != -1) {
						if (t1 != -1 && (t1 ^ u) != 1)
							dq[v] = min(dq[v], dp[t1] + dd[u][v]);
						else if (t2 != -1)
							dq[v] = min(dq[v], dp[t2] + dd[u][v]);
					}
				}
			}
		memcpy(dp, dq, m * 2 * sizeof *dq);
	}
	ans = INF;
	for (v = 0; v < m * 2; v++)
		ans = min(ans, dp[v]);
	printf("%lld\n", ans == INF ? -1 : ans);
	return 0;
}

Compilation message

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

Subtask #1
12.0 / 12.0

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

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 0 ms 468 KB Output is correct
22 Correct 0 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 1364 KB Output is correct
27 Correct 50 ms 3592 KB Output is correct
28 Correct 48 ms 3592 KB Output is correct
29 Correct 178 ms 11136 KB Output is correct
30 Correct 194 ms 11140 KB Output is correct
31 Correct 226 ms 11140 KB Output is correct
32 Correct 216 ms 11056 KB Output is correct
33 Correct 174 ms 11356 KB Output is correct
34 Correct 201 ms 11340 KB Output is correct
35 Correct 213 ms 11368 KB Output is correct
36 Correct 205 ms 11364 KB Output is correct
37 Correct 186 ms 11456 KB Output is correct
38 Correct 168 ms 11588 KB Output is correct
39 Correct 183 ms 11512 KB Output is correct
40 Correct 169 ms 11588 KB Output is correct
41 Correct 167 ms 11644 KB Output is correct
42 Correct 172 ms 11744 KB Output is correct
43 Correct 173 ms 11784 KB Output is correct
44 Correct 165 ms 11796 KB Output is correct
45 Correct 141 ms 12044 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 0 ms 468 KB Output is correct
22 Correct 0 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 1364 KB Output is correct
27 Correct 50 ms 3592 KB Output is correct
28 Correct 48 ms 3592 KB Output is correct
29 Correct 178 ms 11136 KB Output is correct
30 Correct 194 ms 11140 KB Output is correct
31 Correct 226 ms 11140 KB Output is correct
32 Correct 216 ms 11056 KB Output is correct
33 Correct 174 ms 11356 KB Output is correct
34 Correct 201 ms 11340 KB Output is correct
35 Correct 213 ms 11368 KB Output is correct
36 Correct 205 ms 11364 KB Output is correct
37 Correct 186 ms 11456 KB Output is correct
38 Correct 168 ms 11588 KB Output is correct
39 Correct 183 ms 11512 KB Output is correct
40 Correct 169 ms 11588 KB Output is correct
41 Correct 167 ms 11644 KB Output is correct
42 Correct 172 ms 11744 KB Output is correct
43 Correct 173 ms 11784 KB Output is correct
44 Correct 165 ms 11796 KB Output is correct
45 Correct 141 ms 12044 KB Output is correct
46 Correct 128 ms 21612 KB Output is correct
47 Correct 3955 ms 173768 KB Output is correct
48 Correct 3764 ms 182968 KB Output is correct
49 Correct 3581 ms 189032 KB Output is correct
50 Correct 3689 ms 189000 KB Output is correct
51 Correct 4006 ms 188876 KB Output is correct
52 Correct 3336 ms 189160 KB Output is correct
53 Correct 3307 ms 189224 KB Output is correct
54 Correct 3305 ms 189176 KB Output is correct
55 Correct 3308 ms 189224 KB Output is correct
56 Correct 3263 ms 189380 KB Output is correct
57 Correct 3233 ms 189320 KB Output is correct
58 Correct 3196 ms 189300 KB Output is correct
59 Correct 3082 ms 189172 KB Output is correct
60 Correct 3087 ms 189244 KB Output is correct
61 Correct 2949 ms 189120 KB Output is correct
62 Correct 2805 ms 189184 KB Output is correct
63 Correct 2698 ms 189188 KB Output is correct
64 Correct 1170 ms 189208 KB Output is correct
65 Correct 1182 ms 189196 KB Output is correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 0 ms 468 KB Output is correct
22 Correct 0 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 1364 KB Output is correct
27 Correct 50 ms 3592 KB Output is correct
28 Correct 48 ms 3592 KB Output is correct
29 Correct 178 ms 11136 KB Output is correct
30 Correct 194 ms 11140 KB Output is correct
31 Correct 226 ms 11140 KB Output is correct
32 Correct 216 ms 11056 KB Output is correct
33 Correct 174 ms 11356 KB Output is correct
34 Correct 201 ms 11340 KB Output is correct
35 Correct 213 ms 11368 KB Output is correct
36 Correct 205 ms 11364 KB Output is correct
37 Correct 186 ms 11456 KB Output is correct
38 Correct 168 ms 11588 KB Output is correct
39 Correct 183 ms 11512 KB Output is correct
40 Correct 169 ms 11588 KB Output is correct
41 Correct 167 ms 11644 KB Output is correct
42 Correct 172 ms 11744 KB Output is correct
43 Correct 173 ms 11784 KB Output is correct
44 Correct 165 ms 11796 KB Output is correct
45 Correct 141 ms 12044 KB Output is correct
46 Correct 128 ms 21612 KB Output is correct
47 Correct 3955 ms 173768 KB Output is correct
48 Correct 3764 ms 182968 KB Output is correct
49 Correct 3581 ms 189032 KB Output is correct
50 Correct 3689 ms 189000 KB Output is correct
51 Correct 4006 ms 188876 KB Output is correct
52 Correct 3336 ms 189160 KB Output is correct
53 Correct 3307 ms 189224 KB Output is correct
54 Correct 3305 ms 189176 KB Output is correct
55 Correct 3308 ms 189224 KB Output is correct
56 Correct 3263 ms 189380 KB Output is correct
57 Correct 3233 ms 189320 KB Output is correct
58 Correct 3196 ms 189300 KB Output is correct
59 Correct 3082 ms 189172 KB Output is correct
60 Correct 3087 ms 189244 KB Output is correct
61 Correct 2949 ms 189120 KB Output is correct
62 Correct 2805 ms 189184 KB Output is correct
63 Correct 2698 ms 189188 KB Output is correct
64 Correct 1170 ms 189208 KB Output is correct
65 Correct 1182 ms 189196 KB Output is correct
66 Incorrect 38 ms 1892 KB Output isn't correct
67 Halted 0 ms 0 KB -