#include<bits/stdc++.h> using namespace std; vector<int> twe[509]; int ts[1009],tmp[1009]; int tpoj[509],tpar[509][509]; bool check(vector<int> *a, vector<int> *b, int m) { int wyn=0; if(a->size()+b->size()<m) return false; for(vector<int>::iterator it=a->begin();it!=a->end();++it) { while(wyn>=0 && *it!=ts[wyn+1]) wyn=tmp[wyn]; ++wyn; if(wyn==m) return true; } for(vector<int>::iterator it=b->begin();it!=b->end();++it) { while(wyn>=0 && *it!=ts[wyn+1]) wyn=tmp[wyn]; ++wyn; if(wyn==m) return true; } return false; } long long int poteguj(int a, int b, int m) { vector<int> va[2],vb[2]; long long int pom=0; int start,kon; va[0].push_back(a); vb[0].push_back(b); while(min(va[pom%2].size(),vb[pom%2].size())<m) { va[(pom+1)%2].clear(); start=0; kon=0; if(va[pom%2].size()>m) start=m-va[pom%2].size(); if(vb[pom%2].size()>m) kon=m-vb[pom%2].size(); for(vector<int>::iterator it=va[pom%2].begin()+start;it!=va[pom%2].end();++it) { for(vector<int>::iterator it2=twe[*it].begin();it2!=twe[*it].end();++it2) va[(pom+1)%2].push_back(*it2); } vb[(pom+1)%2].clear(); for(vector<int>::iterator it=vb[pom%2].begin();it!=vb[pom%2].end()-kon;++it) { for(vector<int>::iterator it2=twe[*it].begin();it2!=twe[*it].end();++it2) vb[(pom+1)%2].push_back(*it2); } if(va[pom%2].size()+vb[pom%2].size()>=m && check(va,vb,m)) return pom+1; ++pom; } return 1e18; } void gen_poj() { int ak; list<int> lista; tpoj[1]=1; lista.push_back(1); while(!lista.empty()) { ak=lista.front(); lista.pop_front(); for(vector<int>::iterator it=twe[ak].begin();it!=twe[ak].end();++it) if(!tpoj[*it]) { tpoj[*it]=tpoj[ak]+1; lista.push_back(*it); } } } void gen_pair(int n) { int v; list<pair<int,int> > lista; pair<int,int> ak; bool tb[509][509]; for(int i=1;i<=n;++i) if(tpoj[i]>0) { for(vector<int>::iterator it=twe[i].begin();it!=twe[i].end()-1;++it) if(tpar[*it][*(it+1)]==0 || tpar[*it][*(it+1)]>tpoj[i]+1) { tpar[*it][*(it+1)]=tpoj[i]+1; tb[*it][*(it+1)]=true; lista.push_back(make_pair(*it,*(it+1))); } } while(!lista.empty()) { ak=lista.front(); lista.pop_front(); if(tb[ak.first][ak.second]) { tb[ak.first][ak.second]=false; v=tpar[ak.first][ak.second]+1; while(true) { ak=make_pair(*twe[ak.first].rbegin(),*twe[ak.second].begin()); if(tpar[ak.first][ak.second]!=0 && tpar[ak.first][ak.second]<=v) break; tb[ak.first][ak.second]=false; tpar[ak.first][ak.second]=v; ++v; } } } } int main() { int n,m,roz,p; long long int wyn=1e18; scanf("%d%d",&n,&m); for(int i=1;i<=n;++i) { scanf("%d",&roz); for(int j=0;j<roz;++j) { scanf("%d",&p); twe[i].push_back(p); } } for(int i=1;i<=m;++i) { scanf("%d",&ts[i]); } gen_poj(); if(m==1) { if(tpoj[ts[1]]) printf("%d",tpoj[ts[1]]); else printf("-1"); return 0; } gen_pair(n); if(m==2) { if(tpar[ts[1]][ts[2]]) printf("%d",tpar[ts[1]][ts[2]]); else printf("-1"); return 0; } /*printf("\n"); for(int i=1;i<=n;++i) printf("%d ",tpoj[i]); printf("\n"); for(int i=1;i<=n;++i) { for(int j=1;j<=n;++j) printf("%d ",tpar[i][j]); printf("\n"); }*/ tmp[0]=-1; for(int i=1;i<=m;++i) { tmp[i]=tmp[i-1]; while(tmp[i]>=0 && ts[i]!=ts[tmp[i]+1]) tmp[i]=tmp[tmp[i]]; ++tmp[i]; } for(int i=1;i<=n;++i) { if(tpoj[i]) for(int j=1;j<=n;++j) if(tpar[i][j]) wyn=min(wyn,tpar[i][j]+poteguj(i,j,m)); //printf("%d %d %d\n",i,j,wyn);} } printf("%lld",wyn); 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 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 | #include<bits/stdc++.h> using namespace std; vector<int> twe[509]; int ts[1009],tmp[1009]; int tpoj[509],tpar[509][509]; bool check(vector<int> *a, vector<int> *b, int m) { int wyn=0; if(a->size()+b->size()<m) return false; for(vector<int>::iterator it=a->begin();it!=a->end();++it) { while(wyn>=0 && *it!=ts[wyn+1]) wyn=tmp[wyn]; ++wyn; if(wyn==m) return true; } for(vector<int>::iterator it=b->begin();it!=b->end();++it) { while(wyn>=0 && *it!=ts[wyn+1]) wyn=tmp[wyn]; ++wyn; if(wyn==m) return true; } return false; } long long int poteguj(int a, int b, int m) { vector<int> va[2],vb[2]; long long int pom=0; int start,kon; va[0].push_back(a); vb[0].push_back(b); while(min(va[pom%2].size(),vb[pom%2].size())<m) { va[(pom+1)%2].clear(); start=0; kon=0; if(va[pom%2].size()>m) start=m-va[pom%2].size(); if(vb[pom%2].size()>m) kon=m-vb[pom%2].size(); for(vector<int>::iterator it=va[pom%2].begin()+start;it!=va[pom%2].end();++it) { for(vector<int>::iterator it2=twe[*it].begin();it2!=twe[*it].end();++it2) va[(pom+1)%2].push_back(*it2); } vb[(pom+1)%2].clear(); for(vector<int>::iterator it=vb[pom%2].begin();it!=vb[pom%2].end()-kon;++it) { for(vector<int>::iterator it2=twe[*it].begin();it2!=twe[*it].end();++it2) vb[(pom+1)%2].push_back(*it2); } if(va[pom%2].size()+vb[pom%2].size()>=m && check(va,vb,m)) return pom+1; ++pom; } return 1e18; } void gen_poj() { int ak; list<int> lista; tpoj[1]=1; lista.push_back(1); while(!lista.empty()) { ak=lista.front(); lista.pop_front(); for(vector<int>::iterator it=twe[ak].begin();it!=twe[ak].end();++it) if(!tpoj[*it]) { tpoj[*it]=tpoj[ak]+1; lista.push_back(*it); } } } void gen_pair(int n) { int v; list<pair<int,int> > lista; pair<int,int> ak; bool tb[509][509]; for(int i=1;i<=n;++i) if(tpoj[i]>0) { for(vector<int>::iterator it=twe[i].begin();it!=twe[i].end()-1;++it) if(tpar[*it][*(it+1)]==0 || tpar[*it][*(it+1)]>tpoj[i]+1) { tpar[*it][*(it+1)]=tpoj[i]+1; tb[*it][*(it+1)]=true; lista.push_back(make_pair(*it,*(it+1))); } } while(!lista.empty()) { ak=lista.front(); lista.pop_front(); if(tb[ak.first][ak.second]) { tb[ak.first][ak.second]=false; v=tpar[ak.first][ak.second]+1; while(true) { ak=make_pair(*twe[ak.first].rbegin(),*twe[ak.second].begin()); if(tpar[ak.first][ak.second]!=0 && tpar[ak.first][ak.second]<=v) break; tb[ak.first][ak.second]=false; tpar[ak.first][ak.second]=v; ++v; } } } } int main() { int n,m,roz,p; long long int wyn=1e18; scanf("%d%d",&n,&m); for(int i=1;i<=n;++i) { scanf("%d",&roz); for(int j=0;j<roz;++j) { scanf("%d",&p); twe[i].push_back(p); } } for(int i=1;i<=m;++i) { scanf("%d",&ts[i]); } gen_poj(); if(m==1) { if(tpoj[ts[1]]) printf("%d",tpoj[ts[1]]); else printf("-1"); return 0; } gen_pair(n); if(m==2) { if(tpar[ts[1]][ts[2]]) printf("%d",tpar[ts[1]][ts[2]]); else printf("-1"); return 0; } /*printf("\n"); for(int i=1;i<=n;++i) printf("%d ",tpoj[i]); printf("\n"); for(int i=1;i<=n;++i) { for(int j=1;j<=n;++j) printf("%d ",tpar[i][j]); printf("\n"); }*/ tmp[0]=-1; for(int i=1;i<=m;++i) { tmp[i]=tmp[i-1]; while(tmp[i]>=0 && ts[i]!=ts[tmp[i]+1]) tmp[i]=tmp[tmp[i]]; ++tmp[i]; } for(int i=1;i<=n;++i) { if(tpoj[i]) for(int j=1;j<=n;++j) if(tpar[i][j]) wyn=min(wyn,tpar[i][j]+poteguj(i,j,m)); //printf("%d %d %d\n",i,j,wyn);} } printf("%lld",wyn); return 0; } |