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
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
import java.io.InputStream;
import java.io.PrintStream;
import java.util.*;

public class eks {
    private static Set<String> visited = new HashSet<>();
    private static int[] previous_sequence;
    private static Map<String, int[]> previous;

    public static void main(String[] args) {
        InputStream in = System.in;
        PrintStream out = System.out;
        calculate(in, out);
    }

    public static int calculate(InputStream in, PrintStream out) {
        /** Read input */

        Scanner scanner = new Scanner(in);
        int n = Integer.parseInt(scanner.next());
        int m = Integer.parseInt(scanner.next());

        int[][] cells_sequences = readCellsSequences(scanner, n);
        int[] adult_sequence = readPattern(scanner, m);
        previous_sequence = new int[adult_sequence.length];

        /** Find */
        visited = new HashSet<>();

        int result = find(adult_sequence, cells_sequences);

        /** Save result */
        out.print(result);

        return 0;
    }


    private static int find(int[] adult_sequence, int[][] cell_sequences) {
        String str = sequenceToString(adult_sequence, adult_sequence.length);

        if (adult_sequence.length == 1 && adult_sequence[0] == 1) {
            return 1;
        }

        Queue<Seq> queue = new LinkedList<>();
        queue.add(new Seq(str, adult_sequence, 1));
        while (!queue.isEmpty()) {
            Seq seq = queue.remove();
            if (!visited.contains(seq.key)) {
                visited.add(seq.key);
                Map<String, int[]> previous = findPrevious(seq.tab, cell_sequences);
                for (Map.Entry<String, int[]> entry: previous.entrySet()) {
                    if (!visited.contains(entry.getKey())) {
                        if (entry.getValue().length == 1 && entry.getValue()[0] == 1) {
                            return seq.step + 1;
                        } else {
                            queue.add(new Seq(entry.getKey(), entry.getValue(), seq.step + 1));
                        }
                    }
                }
            }
        }

        return -1;
    }



    private static String sequenceToString(int[] sequence, int length) {
        StringBuilder str = new StringBuilder("|");
        for (int i = 0; i < length; i++) {
            str.append(sequence[i] + "|");
        }
        return str.toString();
    }

    /** Find previous sequences */

    private static Map<String, int[]> findPrevious(int adult_sequence[], int cell_sequences[][]) {
        previous = new HashMap<>();
        addIfFindPrefix(adult_sequence, adult_sequence.length, cell_sequences, 0);
        addIfFindMiddle(adult_sequence, adult_sequence.length, cell_sequences, 0);
        return previous;
    }

    private static void addToPrevious(int[] adult_sequence, int adult_sequence_size) {
        String str = sequenceToString(adult_sequence, adult_sequence_size);
        int seq[] = Arrays.copyOf(adult_sequence, adult_sequence_size);
        previous.put(str, seq);
    }

    private static void addIfFindPrefix(int[] adult_sequence, int adult_sequence_size, int cell_sequences[][], int previous_index) {
        for (int prefix_length = 1; prefix_length <= adult_sequence.length; prefix_length++) {
            for (int cell = 0; cell < cell_sequences.length; cell++) {
                boolean found = matchSuffix(adult_sequence, cell_sequences[cell], prefix_length);
                if (found) {
                    previous_sequence[previous_index] = cell + 1;
                    if (adult_sequence.length > prefix_length) {
                        addIfFindFullInternal(adult_sequence, adult_sequence_size, cell_sequences, prefix_length, previous_index + 1);
                        addIfFindSuffix(adult_sequence, adult_sequence_size, cell_sequences, prefix_length, previous_index + 1);
                    } else {
                        addToPrevious(previous_sequence, previous_index + 1);
                    }
                }
            }
        }
    }

    private static void addIfFindFullInternal(int[] adult_sequence, int adult_sequence_size, int[][] cell_sequences, int rangeFrom, int previous_index) {
        int left_length = adult_sequence_size - rangeFrom;
        for (int range_length = 1; range_length < left_length; range_length++) {
            for (int cell = 0; cell < cell_sequences.length; cell++) {
                boolean found = matchFullRange(adult_sequence, cell_sequences[cell], rangeFrom, range_length);
                if (found) {
                    previous_sequence[previous_index] = cell + 1;
                    if (left_length > range_length) {
                        addIfFindFullInternal(adult_sequence, adult_sequence_size, cell_sequences, rangeFrom + range_length, previous_index + 1);
                        addIfFindSuffix(adult_sequence, adult_sequence_size, cell_sequences, rangeFrom + range_length, previous_index + 1);
                    } else {
                        addToPrevious(previous_sequence, previous_index + 1);
                    }
                }
            }
        }
    }

    private static void addIfFindSuffix(int[] adult_sequence, int adult_sequence_size, int[][] cell_sequences, int rangeFrom, int previous_index) {
        int left_length = adult_sequence.length - rangeFrom;
        for (int cell = 0; cell < cell_sequences.length; cell++) {
            boolean found = matchPrefix(adult_sequence, adult_sequence_size, cell_sequences[cell], left_length);
            if (found) {
                previous_sequence[previous_index] = cell + 1;
                addToPrevious(previous_sequence, previous_index + 1);
            }
        }
    }

    private static void addIfFindMiddle(int[] adult_sequence, int adult_sequence_size, int[][] cell_sequences, int previous_index) {
        for (int cell = 0; cell < cell_sequences.length; cell++) {
            boolean found = matchPartOfRange(adult_sequence, adult_sequence_size, cell_sequences[cell]);
            if (found) {
                previous_sequence[previous_index] = cell + 1;
                addToPrevious(previous_sequence, previous_index + 1);
            }
        }
    }


    private static boolean matchPrefix(int[] adult_sequence, int adult_sequence_size, int[] cell_sequence, int prefix_length) {
        int length = cell_sequence[0];

        if (length < prefix_length) {
            return false;
        }

        for (int i = 0; i < prefix_length; i++) {
            if (cell_sequence[i + 1] != adult_sequence[adult_sequence_size - prefix_length + i]) {
                return false;
            }
        }

        return true;
    }

    private static boolean matchFullRange(int[] adult_sequence, int[] cell_sequence, int rangeFrom, int rangeLength) {
        int length = cell_sequence[0];

        if (length != rangeLength) {
            return false;
        }

        for (int i = 0; i < rangeLength; i++) {
            if (cell_sequence[i + 1] != adult_sequence[rangeFrom + i]) {
                return false;
            }
        }

        return true;
    }

    private static boolean matchSuffix(int[] adult_sequence, int[] cell_sequence, int suffix_length) {
        int length = cell_sequence[0];

        if (length < suffix_length) {
            return false;
        }

        for (int i = 0; i < suffix_length; i++) {
            if (cell_sequence[length - suffix_length + i + 1] != adult_sequence[i]) {
                return false;
            }
        }

        return true;
    }

    private static boolean matchPartOfRange(int[] adult_sequence, int adult_sequence_size, int[] cell_sequence) {
        int length = cell_sequence[0];

        if (length < adult_sequence_size) {
            return false;
        }

        for (int s = 1; s <= length - adult_sequence_size + 1; s++) {
            if (matchPartOfRangeStartFrom(adult_sequence, adult_sequence_size, cell_sequence, s)) {
                return true;
            }
        }

        return false;
    }

    private static boolean matchPartOfRangeStartFrom(int[] adult_sequence, int adult_sequence_size, int[] cell_sequence, int s) {
        for (int i = 0; i < adult_sequence_size; i++) {
            if (cell_sequence[s + i] != adult_sequence[i]) {
                return false;
            }
        }
        return true;
    }

    private static int[][] readCellsSequences(Scanner scanner, int n) {
        int k[][] = new int[n][];
        for (int i = 0; i < n; i++) {
            scanner.nextLine();
            int l = Integer.parseInt(scanner.next());
            k[i] = new int[l + 1];
            k[i][0] = l;
            for (int j = 0; j < l; j++) {
                k[i][j + 1] = Integer.parseInt(scanner.next());
            }
        }
        return k;
    }

    private static int[] readPattern(Scanner scanner, int m) {
        int d[] = new int[m];
        for (int i = 0; i < m; i++) {
            d[i] = Integer.parseInt(scanner.next());
        }
        return d;
    }

    private static class Seq {
        String key;
        int[] tab;
        int step;

        private Seq(String key, int[] tab, int step) {
            this.key = key;
            this.tab = tab;
            this.step = step;
        }
    }

}