1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include<cstdio>
#include<cstring>

int n,m,k;
char T[1001][1001];
int C[1001];
char P[1002];
char TT[2][10003000];
int q,q2,curr=0, curr2;
int d=1;

int main() {
    scanf("%d %d", &n, &m);
    if(n>254) {
        printf("-1\n");
        return 0;
    }
    for(int i=1;i<=n;i++) {
        scanf("%d", &C[i]);
        for(int j=0;j<C[i];j++) {
            scanf("%d", &k);
            T[i][j] = k;
        }
    }
    for(int i=0;i<m;i++) {
        scanf("%d", &k);
        P[i] = k;
    }
    TT[0][0] = 1;
    q = 1;
    while(q < 10000001) {
        if(strstr(TT[curr], P)) {
            printf("%d\n", d);
            return 0;
        }
        d++;
        q2 = 0;
        curr2 = 1-curr;
        for(int i=0;i<q;i++) {
            for(int j=0;j<C[TT[curr][i]];j++)
                TT[curr2][q2++] = T[TT[curr][i]][j];
            if(q2 > 10000000) {
                if(strstr(TT[curr], P))
                    printf("%d\n", d);
                else
                    printf("-1\n");
                return 0;
            }
        }
        curr = curr2;
        q = q2;
    }
    printf("-1\n");
    return 0;
}