#include <cstdio> #include <iostream> #include <algorithm> #include <string> #include <vector> #include <queue> /* PA-2015 R5 */ /* Korzystałem z kodu zaczęrpniętego z książki Piotr Stańczyka "Algorytmika Praktyczna" - kmp */ using namespace std; typedef vector<int> VI; typedef long long LL; #define FOR(x, b, e) for(int x = b; x <= (e); ++x) #define FORD(x, b, e) for(int x = b; x >= (e); --x) #define REP(x, n) for(int x = 0; x < (n); ++x) #define VAR(v, n) __typeof(n) v = (n) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PB push_back #define ST first #define ND second #include <list> bool found = false; void xx(int) { found = true; } void KMP(int* str, int strlen, int* wzo, int wzolen, void (*fun)(int)) { #define KMPH(z) while(k > 0 && wzo[k] != z[q]) k = p[k]; if(wzo[k] == z[q]) k++; LL p[wzolen + 1], k = 0, q, m; p[1] = 0; for (q = 1; q < wzolen; q++) { KMPH(wzo); p[q + 1] = k; } m = q; k = 0; for (q = 0; q < strlen; q++) { KMPH(str); if(m == k) { fun(q - m + 1); k = p[k]; } } } vector <int> nn[510]; int main () { int pat[1010]; int n, m; scanf("%d %d", &n, &m); REP(i, n) { int cnt; scanf("%d", &cnt); REP(k, cnt) { int elem; scanf("%d", &elem); nn[i].PB(elem - 1); } } REP(i, m) { int elem; scanf("%d", &elem); pat[i] = elem - 1; } std::list<int> li; std::list<int>::iterator it; std::list<int>::iterator itb; li.PB(0); int u = 0; while(1) { for(it = li.begin(); it != li.end(); ++it) { int elem = *it; itb = it; li.insert(it, nn[elem].begin(), nn[elem].end()); --it; li.erase(itb); } vector<int> test (li.begin(), li.end()); KMP(test.data(), test.size(), &pat[0], m, xx); if(found) { cout<< u + 2 << endl; return 0; } if(li.size() > 15000000) { cout<< -1 << endl; return 0; } u++; } return 0; }
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 | #include <cstdio> #include <iostream> #include <algorithm> #include <string> #include <vector> #include <queue> /* PA-2015 R5 */ /* Korzystałem z kodu zaczęrpniętego z książki Piotr Stańczyka "Algorytmika Praktyczna" - kmp */ using namespace std; typedef vector<int> VI; typedef long long LL; #define FOR(x, b, e) for(int x = b; x <= (e); ++x) #define FORD(x, b, e) for(int x = b; x >= (e); --x) #define REP(x, n) for(int x = 0; x < (n); ++x) #define VAR(v, n) __typeof(n) v = (n) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PB push_back #define ST first #define ND second #include <list> bool found = false; void xx(int) { found = true; } void KMP(int* str, int strlen, int* wzo, int wzolen, void (*fun)(int)) { #define KMPH(z) while(k > 0 && wzo[k] != z[q]) k = p[k]; if(wzo[k] == z[q]) k++; LL p[wzolen + 1], k = 0, q, m; p[1] = 0; for (q = 1; q < wzolen; q++) { KMPH(wzo); p[q + 1] = k; } m = q; k = 0; for (q = 0; q < strlen; q++) { KMPH(str); if(m == k) { fun(q - m + 1); k = p[k]; } } } vector <int> nn[510]; int main () { int pat[1010]; int n, m; scanf("%d %d", &n, &m); REP(i, n) { int cnt; scanf("%d", &cnt); REP(k, cnt) { int elem; scanf("%d", &elem); nn[i].PB(elem - 1); } } REP(i, m) { int elem; scanf("%d", &elem); pat[i] = elem - 1; } std::list<int> li; std::list<int>::iterator it; std::list<int>::iterator itb; li.PB(0); int u = 0; while(1) { for(it = li.begin(); it != li.end(); ++it) { int elem = *it; itb = it; li.insert(it, nn[elem].begin(), nn[elem].end()); --it; li.erase(itb); } vector<int> test (li.begin(), li.end()); KMP(test.data(), test.size(), &pat[0], m, xx); if(found) { cout<< u + 2 << endl; return 0; } if(li.size() > 15000000) { cout<< -1 << endl; return 0; } u++; } return 0; } |