Submission #680397

# Submission time Handle Problem Language Result Execution time Memory
680397 2023-01-10T17:29:42 Z rainboy Wild Boar (JOI18_wild_boar) C
12 / 100
18000 ms 6244 KB
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

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

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

void solve(long long *dd, int u) {
	static char visited[M * 2];
	int h, h_, i, o;

	memset(dd, 0x3f, m * 2 * sizeof *dd), dd[u] = cc[u >> 1];
	memset(visited, 0, m * 2 * sizeof *visited);
	while (1) {
		h_ = -1;
		for (h = 0; h < m * 2; h++)
			if (!visited[h] && (h_ == -1 || dd[h_] > dd[h]))
				h_ = h;
		if (h_ == -1)
			break;
		visited[h_] = 1;
		h = h_, i = ij[h ^ 1];
		for (o = eo[i]; o--; ) {
			h_ = eh[i][o];
			if (!visited[h_] && (h ^ h_) != 1)
				dd[h_] = min(dd[h_], dd[h] + cc[h_ >> 1]);
		}
	}
}

int main() {
	static long long dd[M * 2][M * 2], dp[M * 2], dq[M * 2];
	static int ii[L];
	int q, l, g, h, i, j, t, 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 (g = 0; g + 1 < l; g++) {
		i = ii[g], j = ii[g + 1];
		memset(dq, 0x3f, m * 2 * sizeof *dq);
		for (u = 0; u < m * 2; u++)
			for (v = 0; v < m * 2; v++)
				if (ij[u] == i && ij[v ^ 1] == j) {
					if (g == 0)
						dq[v] = min(dq[v], dd[u][v]);
					else
						for (t = 0; t < m * 2; t++)
							if ((t ^ u) != 1)
								dq[v] = min(dq[v], dp[t] + 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:52:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |  scanf("%d%d%d%d", &n, &m, &q, &l);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.c:56:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |   scanf("%d%d%d", &i, &j, &cc[h]), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.c:63:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |   scanf("%d", &ii[g]), ii[g]--;
      |   ^~~~~~~~~~~~~~~~~~~
wild_boar.c:65:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |   scanf("%d%d", &g, &i), g--, i--;
      |   ^~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 420 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 424 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 420 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 300 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 420 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 424 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 420 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 300 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 2340 ms 2160 KB Output is correct
28 Correct 2323 ms 2160 KB Output is correct
29 Execution timed out 18068 ms 6244 KB Time limit exceeded
30 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 420 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 424 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 420 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 300 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 2340 ms 2160 KB Output is correct
28 Correct 2323 ms 2160 KB Output is correct
29 Execution timed out 18068 ms 6244 KB Time limit exceeded
30 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 420 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 424 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 420 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 300 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 2340 ms 2160 KB Output is correct
28 Correct 2323 ms 2160 KB Output is correct
29 Execution timed out 18068 ms 6244 KB Time limit exceeded
30 Halted 0 ms 0 KB -