oj.uz

Submission #722799

# Submission time Handle Problem Language Result Execution time Memory
722799 2023-04-12T21:43:03 Z rainboy Bad Codes (CCO19_day2problem3) C
25 / 100
 5 ms 7252 KB 
#include <stdio.h>
#include <string.h>

#define N	60
#define L	60
#define N_	(N * L + 2)
#define INF	0x3f3f3f3f

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

unsigned int X = 12345;

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

int dd[N_ * N_];

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)
			if (dd[ii[j]] == dd[i_])
				j++;
			else if (dd[ii[j]] < dd[i_]) {
				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;
	}
}

int main() {
	static char cc[L + 1];
	static int ll[N], tt[N_][2], ii[N_], qu[2][N_ * N_], hh[2], cnt[2];
	int n, n_, h, i, s, s_, t, t_, st, d, d_;

	scanf("%d%*d", &n);
	memset(ii, -1, N_ * sizeof *ii);
	n_ = 2, d_ = INF;
	for (i = 0; i < n; i++) {
		scanf("%s", cc), ll[i] = strlen(cc);
		for (h = 0, s = 1; h < ll[i]; h++) {
			d = cc[h] - '0';
			if (!tt[s][d])
				tt[s][d] = n_++;
			s = tt[s][d];
		}
		if (ii[s] == -1)
			ii[s] = i;
		else
			d_ = min(d_, ll[i]);
	}
	memset(dd, 0x3f, n_ * n_ * sizeof *dd);
	for (s = 1; s < n_; s++)
		if (ii[s] != -1)
			dd[s * n_ + 1] = ll[ii[s]], qu[0][cnt[0]++] = s * n_ + 1;
	sort(qu[0], 0, cnt[0]);
	while (hh[0] < cnt[0] || hh[1] < cnt[1]) {
		st = hh[1] == cnt[1] || hh[0] < cnt[0] && dd[qu[0][hh[0]]] < dd[qu[1][hh[1]]] ? qu[0][hh[0]++] : qu[1][hh[1]++], s = st / n_, t = st % n_, d = dd[st] + 1;
		if (dd[st] >= d_)
			break;
		if (s == 1 && t == 1) {
			printf("%d\n", dd[st]);
			return 0;
		}
		if ((s_ = tt[s][0]) && (t_ = tt[t][0])) {
			if (dd[s_ * n_ + t_] > d)
				dd[s_ * n_ + t_] = d, qu[1][cnt[1]++] = s_ * n_ + t_;
			if (ii[t_] != -1 && dd[s_ * n_ + 1] > d)
				dd[s_ * n_ + 1] = d, qu[1][cnt[1]++] = s_ * n_ + 1;
			if (ii[s_] != -1 && dd[1 * n_ + t_] > d)
				dd[1 * n_ + t_] = d, qu[1][cnt[1]++] = 1 * n_ + t_;
			if (ii[s_] != -1 && ii[t_] != -1 && dd[1 * n_ + 1] > d)
				dd[1 * n_ + 1] = d, qu[1][cnt[1]++] = 1 * n_ + 1;
		}
		if ((s_ = tt[s][1]) && (t_ = tt[t][1])) {
			if (dd[s_ * n_ + t_] > d)
				dd[s_ * n_ + t_] = d, qu[1][cnt[1]++] = s_ * n_ + t_;
			if (ii[t_] != -1 && dd[s_ * n_ + 1] > d)
				dd[s_ * n_ + 1] = d, qu[1][cnt[1]++] = s_ * n_ + 1;
			if (ii[s_] != -1 && dd[1 * n_ + t_] > d)
				dd[1 * n_ + t_] = d, qu[1][cnt[1]++] = 1 * n_ + t_;
			if (ii[s_] != -1 && ii[t_] != -1 && dd[1 * n_ + 1] > d)
				dd[1 * n_ + 1] = d, qu[1][cnt[1]++] = 1 * n_ + 1;
		}
	}
	printf("%d\n", d_ != INF ? d_ : -1);
	return 0;
}

Compilation message

Main.c: In function 'main':
Main.c:65:42: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   65 |   st = hh[1] == cnt[1] || hh[0] < cnt[0] && dd[qu[0][hh[0]]] < dd[qu[1][hh[1]]] ? qu[0][hh[0]++] : qu[1][hh[1]++], s = st / n_, t = st % n_, d = dd[st] + 1;
      |                           ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.c:43:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |  scanf("%d%*d", &n);
      |  ^~~~~~~~~~~~~~~~~~
Main.c:47:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |   scanf("%s", cc), ll[i] = strlen(cc);
      |   ^~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
7.0 / 7.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 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 596 KB Output is correct
10 Correct 1 ms 1572 KB Output is correct
11 Correct 1 ms 936 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 0 ms 340 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 0 ms 468 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 0 ms 596 KB Output is correct
36 Correct 1 ms 1572 KB Output is correct
37 Correct 1 ms 936 KB Output is correct
38 Correct 1 ms 724 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 3 ms 5460 KB Output is correct
43 Correct 1 ms 1876 KB Output is correct
44 Correct 0 ms 596 KB Output is correct
45 Correct 3 ms 5972 KB Output is correct
46 Correct 2 ms 2644 KB Output is correct
47 Correct 2 ms 3412 KB Output is correct
48 Correct 1 ms 724 KB Output is correct
49 Correct 2 ms 4308 KB Output is correct
50 Correct 1 ms 1492 KB Output is correct
51 Correct 2 ms 2772 KB Output is correct
52 Correct 2 ms 4692 KB Output is correct
53 Correct 2 ms 3876 KB Output is correct
54 Correct 5 ms 7252 KB Output is correct
55 Correct 1 ms 1620 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 1 ms 980 KB Output is correct
58 Correct 0 ms 596 KB Output is correct
59 Correct 1 ms 2340 KB Output is correct
60 Correct 2 ms 3156 KB Output is correct
61 Correct 1 ms 1192 KB Output is correct
62 Correct 1 ms 1492 KB Output is correct
63 Correct 1 ms 1876 KB Output is correct
64 Correct 1 ms 2132 KB Output is correct
65 Correct 2 ms 3028 KB Output is correct
66 Correct 3 ms 5332 KB Output is correct
67 Correct 2 ms 4052 KB Output is correct
68 Correct 2 ms 5164 KB Output is correct