#include<bits/stdc++.h> using namespace std; #define REP(i, n) for(int i = 0; i < (n); i++) #define SIZE(s) ((int) s.size()) #define ST first #define ND second using PII = pair<int, int>; using ULL = long long; const int K = 11; // log m const int N = 500; const int M = 1000; int n; int m; int l[N]; vector<int> h[N]; int s[M]; int dist[N]; // dist[i] - w ktorej generacji pojawi się i poraz pierwszy int dist2[N][N]; //dist[i][j] - w ktorej generacji i j pojawia sie obok siebie PII parent[N][N]; // kazdy dublet albo pochodzi z jednego h[i], albo z dwoch sasiednich void bfs2(){ fill_n(dist, n, -1); dist[0] = 0; REP(i, n) fill_n(dist2[i], n, -1); vector<PII> q; REP(j, l[0] - 1){ dist2[h[0][j]][h[0][j+1]] = 1; parent[h[0][j]][h[0][j+1]] = make_pair(-1, -1); q.emplace_back(h[0][j], h[0][j+1]); } REP(i, SIZE(q)){ PII cd = q[i]; int c = cd.ST; int d = cd.ND; if(dist[c] == -1){ dist[c] = dist2[c][d]; REP(j, l[c] - 1){ if(dist2[h[c][j]][h[c][j+1]] == -1){ dist2[h[c][j]][h[c][j+1]] = dist[c] + 1; parent[h[c][j]][h[c][j+1]] = cd; q.emplace_back(h[c][j], h[c][j+1]); } } } if(dist[d] == -1){ dist[d] = dist2[c][d]; REP(j, l[d] - 1){ if(dist2[h[d][j]][h[d][j+1]] == -1){ dist2[h[d][j]][h[d][j+1]] = dist[d] + 1; parent[h[d][j]][h[d][j+1]] = cd; q.emplace_back(h[d][j], h[d][j+1]); } } } if(dist2[h[c].back()][h[d][0]] == -1){ dist2[h[c].back()][h[d][0]] = dist2[c][d] + 1; parent[h[c].back()][h[d][0]] = cd; q.emplace_back(h[c].back(), h[d][0]); } } } void printmask(ULL x){ for(int i = 0; i < 64; i++) printf("%lld", (x>>i) & 1ll); printf("\n"); } ULL shiftl(ULL x, int d){ return (d>=64) ? 0ull : (ULL)(x << d); } ULL makerangemask(int a, int b){ assert(0 <= a && a < b && b <= 64); //cout << "mrm " << a << " " << b << " " << shiftl(1ull,(b-a)) << endl; return (shiftl(1ull, (b-a)) - 1) << a; } vector<bool> dpp[K+1][M+1][N]; // dpp(k, j, f(i, p)) - czy w j moze sie konczyc H^k(h_i,0..p-1) // = 1 jeśli j = 0; (<=0) // = 1 jeśli p = 0 // wpp niech len = długość H^k(h_i,p-1) // jeśli len >= j, // to dpp(k-1, j, f(h_i,p-1, l[h_i,p-1])) dla k > 0 // lub h_i,p-1 == s[j-1] dla k = 0 // jeśli len < j, // to j.w && dp(k, j-len, f(i, p-1)) vector<bool> dps[K+1][M+1][N]; int hklen[K+1][N]; vector<ULL> pmask[N]; // prefixes vector<ULL> smask[N]; // suffixes void makemasks(int k){ REP(i, n){ pmask[i].clear(); smask[i].clear(); pmask[i].resize((m + 1 + 63) / 64); smask[i].resize((m + 1 + 63) / 64); for(int j = 0; j <= m; j++){ if(dpp[k][j][i][l[i]]){ pmask[i][j>>8] |= shiftl(1ull, (j&63)); //cout << "pmask i " << i << " j " << j << endl; } if(dps[k][j][i][0]){ smask[i][j>>8] |= shiftl(1ull, (j&63)); //cout << "smask i " << i << " j " << j << endl; } } } } void testlen(int n){ cout << "n = " << n << endl; cout << "1ull<<n = " << shiftl(1ull, n) << endl; } int solve(){ int t = -1; fill_n(hklen[0], n, 1); REP(k, K){ for(int j = 0; j <= m; j++){ REP(i, n){ dpp[k][j][i].resize(l[i] + 1); for(int p = 0; p <= l[i]; p++){ if(j == 0 || p == 0) dpp[k][j][i][p] = 1; else if(k == 0) dpp[k][j][i][p] = (s[j-1] == h[i][p-1]) && dpp[k][j-1][i][p-1]; else { int last = h[i][p-1]; int len = hklen[k][last]; dpp[k][j][i][p] = dpp[k-1][j][last][l[last]] && ((j-len < 0) ? 1 : dpp[k][j-len][i][p-1]); } //if(j && p && dpp[k][j][i][p]) printf("dpp %d %d %d %d\n", k, j, i, p); } } } for(int j = m; j >= 0; --j){ REP(i, n){ dps[k][j][i].resize(l[i] + 1); for(int p = l[i]; p >= 0; --p){ if(j == m || p == l[i]) dps[k][j][i][p] = 1; else if(k == 0){ dps[k][j][i][p] = (s[j] == h[i][p]) && dps[k][j+1][i][p+1]; } else { int first = h[i][p]; int len = hklen[k][first]; dps[k][j][i][p] = dps[k-1][j][first][0] && ((j + len > m) ? 1 : dps[k][j+len][i][p+1]); } //if(j != m && p != l[i] && dps[k][j][i][p]) printf("dps %d %d %d %d\n", k, j, i, p); } } } REP(i, n){ hklen[k+1][i] = 0; for(int c : h[i]){ hklen[k+1][i] += hklen[k][c]; if(hklen[k+1][i] > m) hklen[k+1][i] = m ; } } makemasks(k); REP(i1, n){ REP(i2, n) if(dist2[i1][i2] != -1){ int j0 = m-hklen[k+1][i2]; //first int j1 = hklen[k+1][i1]; //last inclusive // cout << "j0 = " << j0 << " j1 = " << j1 << endl; if(j1 < j0) continue; REP(b, SIZE(pmask[i1])){ int begin = max(b*64, j0); int end = min(min((b+1) * 64, n), j1+1); // cout << begin << " " << end << endl; if(begin >= end) continue; int k0 = begin & 63; // poczatek int len = end - begin; //testlen(len); //cout << "len = " << len << " " << shiftl(1ull, len) <<endl; //cout << shiftl(1ull, len) << " " << (shiftl(1ull, len) - 1) << " " << ((shiftl(1ull, len) - 1) << k0) << endl; ULL mask = makerangemask(k0, k0 + len); //cout << "mask(" << b << ") = "; //printmask(mask); if(pmask[i1][b] & smask[i2][b] & mask){ int y = k + 1 + dist2[i1][i2]; assert(y != 0); if(t == -1 || t > y){ t = y; } break; } } } } //printf("k=%d\n", k); REP(i, n){ int plen = 0; int tlen = 0; for(int p = 0; p < l[i]; p++) tlen += hklen[k][h[i][p]]; for(int p = 0; p <= l[i]; p++){ //printf("i=%d p=%d plen=%d tlen=%d\n", i, p, plen, tlen); for(int j = max(0, m - (tlen - plen)); j <= min(plen, m); j++){ //printf("j=%d: %d %d %d\n", (int)dpp[k][j][i][p], (int)dps[k][j][i][p], dist[i] != -1); if(dpp[k][j][i][p] && dps[k][j][i][p] && dist[i] != -1){ int y = k + dist[i] + 1; assert(y != 0); if(t == -1 || t > y){t = y;} goto iend; } } plen += hklen[k][h[i][p]]; } iend:; } } return t; } int main(){ assert(scanf("%d%d", &n, &m) == 2); REP(i, n){ assert(scanf("%d", &l[i]) == 1); h[i].resize(l[i]); REP(j, l[i]){ assert(scanf("%d", &h[i][j]) == 1); h[i][j]--; } } REP(i, m){ assert(scanf("%d", &s[i]) == 1); s[i]--; } bfs2(); int t = m == 1 ? dist[s[0]] : solve(); printf("%d\n", (t == -1) ? -1 : t+1); }
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 | #include<bits/stdc++.h> using namespace std; #define REP(i, n) for(int i = 0; i < (n); i++) #define SIZE(s) ((int) s.size()) #define ST first #define ND second using PII = pair<int, int>; using ULL = long long; const int K = 11; // log m const int N = 500; const int M = 1000; int n; int m; int l[N]; vector<int> h[N]; int s[M]; int dist[N]; // dist[i] - w ktorej generacji pojawi się i poraz pierwszy int dist2[N][N]; //dist[i][j] - w ktorej generacji i j pojawia sie obok siebie PII parent[N][N]; // kazdy dublet albo pochodzi z jednego h[i], albo z dwoch sasiednich void bfs2(){ fill_n(dist, n, -1); dist[0] = 0; REP(i, n) fill_n(dist2[i], n, -1); vector<PII> q; REP(j, l[0] - 1){ dist2[h[0][j]][h[0][j+1]] = 1; parent[h[0][j]][h[0][j+1]] = make_pair(-1, -1); q.emplace_back(h[0][j], h[0][j+1]); } REP(i, SIZE(q)){ PII cd = q[i]; int c = cd.ST; int d = cd.ND; if(dist[c] == -1){ dist[c] = dist2[c][d]; REP(j, l[c] - 1){ if(dist2[h[c][j]][h[c][j+1]] == -1){ dist2[h[c][j]][h[c][j+1]] = dist[c] + 1; parent[h[c][j]][h[c][j+1]] = cd; q.emplace_back(h[c][j], h[c][j+1]); } } } if(dist[d] == -1){ dist[d] = dist2[c][d]; REP(j, l[d] - 1){ if(dist2[h[d][j]][h[d][j+1]] == -1){ dist2[h[d][j]][h[d][j+1]] = dist[d] + 1; parent[h[d][j]][h[d][j+1]] = cd; q.emplace_back(h[d][j], h[d][j+1]); } } } if(dist2[h[c].back()][h[d][0]] == -1){ dist2[h[c].back()][h[d][0]] = dist2[c][d] + 1; parent[h[c].back()][h[d][0]] = cd; q.emplace_back(h[c].back(), h[d][0]); } } } void printmask(ULL x){ for(int i = 0; i < 64; i++) printf("%lld", (x>>i) & 1ll); printf("\n"); } ULL shiftl(ULL x, int d){ return (d>=64) ? 0ull : (ULL)(x << d); } ULL makerangemask(int a, int b){ assert(0 <= a && a < b && b <= 64); //cout << "mrm " << a << " " << b << " " << shiftl(1ull,(b-a)) << endl; return (shiftl(1ull, (b-a)) - 1) << a; } vector<bool> dpp[K+1][M+1][N]; // dpp(k, j, f(i, p)) - czy w j moze sie konczyc H^k(h_i,0..p-1) // = 1 jeśli j = 0; (<=0) // = 1 jeśli p = 0 // wpp niech len = długość H^k(h_i,p-1) // jeśli len >= j, // to dpp(k-1, j, f(h_i,p-1, l[h_i,p-1])) dla k > 0 // lub h_i,p-1 == s[j-1] dla k = 0 // jeśli len < j, // to j.w && dp(k, j-len, f(i, p-1)) vector<bool> dps[K+1][M+1][N]; int hklen[K+1][N]; vector<ULL> pmask[N]; // prefixes vector<ULL> smask[N]; // suffixes void makemasks(int k){ REP(i, n){ pmask[i].clear(); smask[i].clear(); pmask[i].resize((m + 1 + 63) / 64); smask[i].resize((m + 1 + 63) / 64); for(int j = 0; j <= m; j++){ if(dpp[k][j][i][l[i]]){ pmask[i][j>>8] |= shiftl(1ull, (j&63)); //cout << "pmask i " << i << " j " << j << endl; } if(dps[k][j][i][0]){ smask[i][j>>8] |= shiftl(1ull, (j&63)); //cout << "smask i " << i << " j " << j << endl; } } } } void testlen(int n){ cout << "n = " << n << endl; cout << "1ull<<n = " << shiftl(1ull, n) << endl; } int solve(){ int t = -1; fill_n(hklen[0], n, 1); REP(k, K){ for(int j = 0; j <= m; j++){ REP(i, n){ dpp[k][j][i].resize(l[i] + 1); for(int p = 0; p <= l[i]; p++){ if(j == 0 || p == 0) dpp[k][j][i][p] = 1; else if(k == 0) dpp[k][j][i][p] = (s[j-1] == h[i][p-1]) && dpp[k][j-1][i][p-1]; else { int last = h[i][p-1]; int len = hklen[k][last]; dpp[k][j][i][p] = dpp[k-1][j][last][l[last]] && ((j-len < 0) ? 1 : dpp[k][j-len][i][p-1]); } //if(j && p && dpp[k][j][i][p]) printf("dpp %d %d %d %d\n", k, j, i, p); } } } for(int j = m; j >= 0; --j){ REP(i, n){ dps[k][j][i].resize(l[i] + 1); for(int p = l[i]; p >= 0; --p){ if(j == m || p == l[i]) dps[k][j][i][p] = 1; else if(k == 0){ dps[k][j][i][p] = (s[j] == h[i][p]) && dps[k][j+1][i][p+1]; } else { int first = h[i][p]; int len = hklen[k][first]; dps[k][j][i][p] = dps[k-1][j][first][0] && ((j + len > m) ? 1 : dps[k][j+len][i][p+1]); } //if(j != m && p != l[i] && dps[k][j][i][p]) printf("dps %d %d %d %d\n", k, j, i, p); } } } REP(i, n){ hklen[k+1][i] = 0; for(int c : h[i]){ hklen[k+1][i] += hklen[k][c]; if(hklen[k+1][i] > m) hklen[k+1][i] = m ; } } makemasks(k); REP(i1, n){ REP(i2, n) if(dist2[i1][i2] != -1){ int j0 = m-hklen[k+1][i2]; //first int j1 = hklen[k+1][i1]; //last inclusive // cout << "j0 = " << j0 << " j1 = " << j1 << endl; if(j1 < j0) continue; REP(b, SIZE(pmask[i1])){ int begin = max(b*64, j0); int end = min(min((b+1) * 64, n), j1+1); // cout << begin << " " << end << endl; if(begin >= end) continue; int k0 = begin & 63; // poczatek int len = end - begin; //testlen(len); //cout << "len = " << len << " " << shiftl(1ull, len) <<endl; //cout << shiftl(1ull, len) << " " << (shiftl(1ull, len) - 1) << " " << ((shiftl(1ull, len) - 1) << k0) << endl; ULL mask = makerangemask(k0, k0 + len); //cout << "mask(" << b << ") = "; //printmask(mask); if(pmask[i1][b] & smask[i2][b] & mask){ int y = k + 1 + dist2[i1][i2]; assert(y != 0); if(t == -1 || t > y){ t = y; } break; } } } } //printf("k=%d\n", k); REP(i, n){ int plen = 0; int tlen = 0; for(int p = 0; p < l[i]; p++) tlen += hklen[k][h[i][p]]; for(int p = 0; p <= l[i]; p++){ //printf("i=%d p=%d plen=%d tlen=%d\n", i, p, plen, tlen); for(int j = max(0, m - (tlen - plen)); j <= min(plen, m); j++){ //printf("j=%d: %d %d %d\n", (int)dpp[k][j][i][p], (int)dps[k][j][i][p], dist[i] != -1); if(dpp[k][j][i][p] && dps[k][j][i][p] && dist[i] != -1){ int y = k + dist[i] + 1; assert(y != 0); if(t == -1 || t > y){t = y;} goto iend; } } plen += hklen[k][h[i][p]]; } iend:; } } return t; } int main(){ assert(scanf("%d%d", &n, &m) == 2); REP(i, n){ assert(scanf("%d", &l[i]) == 1); h[i].resize(l[i]); REP(j, l[i]){ assert(scanf("%d", &h[i][j]) == 1); h[i][j]--; } } REP(i, m){ assert(scanf("%d", &s[i]) == 1); s[i]--; } bfs2(); int t = m == 1 ? dist[s[0]] : solve(); printf("%d\n", (t == -1) ? -1 : t+1); } |