#include <iostream> #include <cstdio> #include <stdlib.h> #include <stdio.h> #include <string.h> #include <vector> #include <algorithm> using namespace std; bool isSubset(vector<int> A, vector<int> B){ sort(A.begin(), A.end()); sort(B.begin(), B.end()); return includes(A.begin(), A.end(), B.begin(), B.end()); } int main(){ int n; int m; scanf("%d%d", &n,&m); vector< vector <int> > cells; for(int i = 0; i < n; ++i){ vector <int> a; int l; scanf("%d", &l); for(int j = 0; j < l; ++j){ int k; scanf("%d", &k); a.push_back(k); } cells.push_back(a); } vector<int> wantedSequence; for(int i = 0; i < m; ++i){ int k; scanf("%d", &k); wantedSequence.push_back(k); } vector<int> currentSequence; currentSequence.push_back(1); for(long long result = 1; result < 15; ++result){ if(isSubset(currentSequence, wantedSequence)){ printf("%lld", result); return 0; } vector<int> newSequence; for(int i = 0; i < currentSequence.size(); ++i){ for(int j = 0; j < cells[currentSequence[i] - 1].size(); ++j){ newSequence.push_back(cells[currentSequence[i] - 1][j]); } } currentSequence = newSequence; } int a = -1; printf("%d\n", a); 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 | #include <iostream> #include <cstdio> #include <stdlib.h> #include <stdio.h> #include <string.h> #include <vector> #include <algorithm> using namespace std; bool isSubset(vector<int> A, vector<int> B){ sort(A.begin(), A.end()); sort(B.begin(), B.end()); return includes(A.begin(), A.end(), B.begin(), B.end()); } int main(){ int n; int m; scanf("%d%d", &n,&m); vector< vector <int> > cells; for(int i = 0; i < n; ++i){ vector <int> a; int l; scanf("%d", &l); for(int j = 0; j < l; ++j){ int k; scanf("%d", &k); a.push_back(k); } cells.push_back(a); } vector<int> wantedSequence; for(int i = 0; i < m; ++i){ int k; scanf("%d", &k); wantedSequence.push_back(k); } vector<int> currentSequence; currentSequence.push_back(1); for(long long result = 1; result < 15; ++result){ if(isSubset(currentSequence, wantedSequence)){ printf("%lld", result); return 0; } vector<int> newSequence; for(int i = 0; i < currentSequence.size(); ++i){ for(int j = 0; j < cells[currentSequence[i] - 1].size(); ++j){ newSequence.push_back(cells[currentSequence[i] - 1][j]); } } currentSequence = newSequence; } int a = -1; printf("%d\n", a); return 0; } |