oj.uz

Submission #683603

# Submission time Handle Problem Language Result Execution time Memory
683603 2023-01-18T20:35:52 Z rainboy Railway Trip (JOI17_railway_trip) C
45 / 100
 2000 ms 11064 KB 
#include <stdio.h>
#include <stdlib.h>
 
#define N	100000
#define INF	0x3f3f3f3f
 
int min(int a, int b) { return a < b ? a : b; }
 
int aa[N], ll[N], ll_[N], ddl[N], rr[N], rr_[N], ddr[N], n;
 
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 bfs(int n, int s, int t) {
	static int qu[N], dd[N];
	int cnt, h, i, j, d, o;
 
	for (i = 0; i < n; i++)
		dd[i] = n;
	cnt = 0;
	dd[s] = 0, qu[cnt++] = s;
	for (h = 0; h < cnt; h++) {
		i = qu[h], d = dd[i] + 1;
		for (o = eo[i]; o--; ) {
			j = ej[i][o];
			if (dd[j] > d)
				dd[j] = d, qu[cnt++] = j;
		}
	}
	return dd[t];
}
 
int solve(int i, int j, int d, int x) {
	int d_, tmp;
 
	if (i > j)
		tmp = i, i = j, j = tmp;
	if (i == -1 || j == n)
		return INF;
	if (i == j)
		return d;
	d_ = INF;
	if (rr_[i] >= j && ll_[j] <= i) {
		d_ = d;
		if (aa[i] < aa[j])
			d_ += ddr[i];
		else if (aa[i] > aa[j])
			d_ += ddl[j];
		else
			d_ += ddl[j] - ddl[i];
	}
	if (x < 4) {
		d_ = min(d_, solve(ll_[i], j, d + ddl[i], x + 1));
		d_ = min(d_, solve(rr_[i], j, d + ddr[i], x + 1));
		d_ = min(d_, solve(i, ll_[j], d + ddl[j], x + 1));
		d_ = min(d_, solve(i, rr_[j], d + ddr[j], x + 1));
	}
	return d_;
}
 
int main() {
	static int qu[N];
	int k, q, i, j, cnt;
 
	scanf("%d%d%d", &n, &k, &q);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	cnt = 0;
	for (i = 0; i < n; i++) {
		while (cnt && aa[qu[cnt - 1]] < aa[i])
			cnt--;
		ll[i] = cnt == 0 ? -1 : qu[cnt - 1];
		qu[cnt++] = i;
	}
	for (i = 0; i < n; i++)
		if (ll[i] == -1)
			ll_[i] = -1, ddl[i] = 0;
		else if (aa[i] != aa[ll[i]])
			ll_[i] = ll[i], ddl[i] = 1;
		else
			ll_[i] = ll_[ll[i]], ddl[i] = ddl[ll[i]] + 1;
	cnt = 0;
	for (i = n - 1; i >= 0; i--) {
		while (cnt && aa[qu[cnt - 1]] < aa[i])
			cnt--;
		rr[i] = cnt == 0 ? n : qu[cnt - 1];
		qu[cnt++] = i;
	}
	for (i = n - 1; i >= 0; i--)
		if (rr[i] == n)
			rr_[i] = n, ddr[i] = 0;
		else if (aa[i] != aa[rr[i]])
			rr_[i] = rr[i], ddr[i] = 1;
		else
			rr_[i] = rr_[rr[i]], ddr[i] = ddr[rr[i]] + 1;
	for (i = 0; i < n; i++)
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
	for (i = 0; i < n; i++)
		if (ll[i] != -1)
			append(i, ll[i]), append(ll[i], i);
	for (i = 0; i < n; i++)
		if (rr[i] != n)
			append(i, rr[i]), append(rr[i], i);
	while (q--) {
		int s, t, u, v, d, d_;
		int tmp;
 
		scanf("%d%d", &i, &j), i--, j--;
		if (i > j)
			tmp = i, i = j, j = tmp;
		if (rr[i] >= j && ll[j] <= i) {
			d_ = 0;
			goto print;
		}
		d = 0;
		u = i, s = 0;
		while ((s == 0 ? rr_[u] < j : (rr_[ll_[u]] < j && rr_[rr_[u]] < j)))
			if (s == 0) {
				if (ddl[u] < ddr[u])
					d += ddl[u], u = ll_[u], s = 0;
				else if (ddl[u] > ddr[u])
					d += ddr[u], u = rr_[u], s = 0;
				else
					d += ddl[u], s = 1;
			} else {
				if (aa[ll_[u]] > aa[rr_[u]])
					u = ll_[u], s = 0;
				else if (aa[ll_[u]] < aa[rr_[u]])
					u = rr_[u], s = 0;
				else {
					if (ddl[ll_[u]] < ddr[rr_[u]])
						d += ddl[ll_[u]], u = ll_[ll_[u]], s = 0;
					else if (ddl[ll_[u]] > ddr[rr_[u]])
						d += ddr[rr_[u]], u = rr_[rr_[u]], s = 0;
					else
						d += ddl[ll_[u]], u = ll_[u], s = 1;
				}
			}
		v = j, t = 0;
		while ((t == 0 ? ll_[v] > i : (ll_[ll_[v]] > i && ll_[rr_[v]] > i)))
			if (t == 0) {
				if (ddl[v] < ddr[v])
					d += ddl[v], v = ll_[v], t = 0;
				else if (ddl[v] > ddr[v])
					d += ddr[v], v = rr_[v], t = 0;
				else
					d += ddl[v], t = 1;
			} else {
				if (aa[ll_[v]] > aa[rr_[v]])
					v = ll_[v], t = 0;
				else if (aa[ll_[v]] < aa[rr_[v]])
					v = rr_[v], t = 0;
				else {
					if (ddl[ll_[v]] < ddr[rr_[v]])
						d += ddl[ll_[v]], v = ll_[ll_[v]], t = 0;
					else if (ddl[ll_[v]] > ddr[rr_[v]])
						d += ddr[rr_[v]], v = rr_[rr_[v]], t = 0;
					else
						d += ddl[ll_[v]], v = ll_[v], t = 1;
				}
			}
		d_ = INF;
		if (s == 0 && t == 0) {
			d_ = min(d_, solve(u, v, d, 0) - 1);
		} else if (s == 0 && t == 1) {
			d_ = min(d_, solve(u, ll_[v], d, 0) - 1);
			d_ = min(d_, solve(u, rr_[v], d, 0) - 1);
		} else if (s == 1 && t == 0) {
			d_ = min(d_, solve(ll_[u], v, d, 0) - 1);
			d_ = min(d_, solve(rr_[u], v, d, 0) - 1);
		} else {
			d_ = min(d_, solve(ll_[u], ll_[v], d, 0) - 1);
			d_ = min(d_, solve(ll_[u], rr_[v], d, 0) - 1);
			d_ = min(d_, solve(rr_[u], ll_[v], d, 0) - 1);
			d_ = min(d_, solve(rr_[u], rr_[v], d, 0) - 1);
		}
print:
		printf("%d\n", d_);
	}
	return 0;
}

Compilation message

railway_trip.c: In function 'main':
railway_trip.c:72:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |  scanf("%d%d%d", &n, &k, &q);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~
railway_trip.c:74:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   scanf("%d", &aa[i]);
      |   ^~~~~~~~~~~~~~~~~~~
railway_trip.c:115:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |   scanf("%d%d", &i, &j), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 22 ms 8756 KB Output is correct
3 Correct 22 ms 8800 KB Output is correct
4 Correct 21 ms 8780 KB Output is correct
5 Correct 22 ms 8788 KB Output is correct
6 Correct 22 ms 8672 KB Output is correct
7 Correct 23 ms 8780 KB Output is correct
8 Correct 17 ms 7712 KB Output is correct
9 Correct 23 ms 9684 KB Output is correct
10 Correct 23 ms 8872 KB Output is correct
11 Correct 26 ms 9376 KB Output is correct
12 Correct 25 ms 9360 KB Output is correct
13 Correct 25 ms 9364 KB Output is correct
14 Correct 24 ms 9424 KB Output is correct
15 Correct 25 ms 9356 KB Output is correct
16 Correct 26 ms 9420 KB Output is correct
17 Correct 29 ms 9272 KB Output is correct
18 Correct 25 ms 9332 KB Output is correct
19 Correct 20 ms 8548 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 9192 KB Output is correct
2 Correct 71 ms 9232 KB Output is correct
3 Correct 76 ms 9180 KB Output is correct
4 Correct 80 ms 9244 KB Output is correct
5 Correct 78 ms 9188 KB Output is correct
6 Correct 75 ms 9232 KB Output is correct
7 Correct 78 ms 9188 KB Output is correct
8 Correct 61 ms 9460 KB Output is correct
9 Correct 69 ms 8264 KB Output is correct
10 Correct 157 ms 9632 KB Output is correct
11 Correct 172 ms 9528 KB Output is correct
12 Correct 164 ms 9620 KB Output is correct
13 Correct 152 ms 9588 KB Output is correct
14 Correct 83 ms 9164 KB Output is correct
15 Correct 80 ms 9164 KB Output is correct
16 Correct 94 ms 9604 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 9064 KB Output is correct
2 Correct 240 ms 9064 KB Output is correct
3 Correct 131 ms 9088 KB Output is correct
4 Correct 171 ms 9056 KB Output is correct
5 Correct 79 ms 8200 KB Output is correct
6 Execution timed out 2074 ms 11064 KB Time limit exceeded
7 Halted 0 ms 0 KB -