#include <stdio.h> #include <deque> #include <queue> #include <vector> using namespace std; typedef unsigned long long ull; struct CellIdxLevelPair{ int cell_idx; int level; }; struct OccurenceInfo{ int cell_idx; int occur_idx; }; struct CellInfo{ vector<OccurenceInfo> occurences; vector<int> reprod_seq; }; int findOccurenceLevel( deque<int> seq, const vector<CellInfo>& cells, const vector<int>& cells_occur, int level, int& cntrl_level ) { queue<pair<int, deque<int>>> seq_to_process; seq_to_process.push( { 1, seq } ); while( !seq_to_process.empty() ){ auto& lvl_seq = seq_to_process.front(); int level = lvl_seq.first; deque<int> seq; seq.swap( lvl_seq.second ); seq_to_process.pop(); if( cntrl_level != -1 && level >= cntrl_level ) continue; if( seq.size() == 1 ){ int min_level = cells_occur[seq[0]-1]; if( cntrl_level == -1 || level + min_level < cntrl_level ) cntrl_level = level + min_level; continue; } //find first elem of seq int first_elem = seq[0] - 1; queue<pair<int, deque<int>>> idx_newSeq_col; for( const OccurenceInfo& it : cells[first_elem].occurences ){ if( cells_occur[it.cell_idx] == -1 ) continue; auto& rep_seq_to_search = cells[it.cell_idx].reprod_seq; bool isMatch = true; int curr_seq_idx = 1; for( int i = it.occur_idx + 1; i < rep_seq_to_search.size(); ++i ){ if( rep_seq_to_search[i] != seq[curr_seq_idx] - 1 ){ isMatch = false; break; } ++curr_seq_idx; if( curr_seq_idx >= seq.size() ) break; } if( !isMatch ) continue; deque<int> d; d.push_back( it.cell_idx + 1 ); idx_newSeq_col.push( { curr_seq_idx, d } ); } bool isFirstFullSeq = true; while( !idx_newSeq_col.empty() ){ auto& p = idx_newSeq_col.front(); int seq_pos = p.first; deque<int> s; s.swap( p.second ); idx_newSeq_col.pop(); if( seq_pos >= seq.size() ){ seq_to_process.push( { level + 1, s } ); continue; } auto& oc = cells[seq[seq_pos] - 1].occurences; for( int i = 0; i < oc.size(); ++i ){ if( oc[i].occur_idx != 0 ) //occurrence should be on 0 pos continue; auto rep_seq_to_search = cells[oc[i].cell_idx].reprod_seq; int curr_seq_idx = seq_pos + 1; bool isMatch = true; for( int j = 1; j < rep_seq_to_search.size(); ++j ){ if( curr_seq_idx >= seq.size() ) //full curr seq break; if( rep_seq_to_search[j] != seq[curr_seq_idx] - 1 ){ isMatch = false; break; } ++curr_seq_idx; } if( !isMatch ) continue; auto new_s = s; new_s.push_back( oc[i].cell_idx + 1 ); idx_newSeq_col.push( { curr_seq_idx, new_s } ); } } } return cntrl_level; } int main() { int N, M; scanf( "%d", &N ); scanf( "%d", &M ); vector<CellInfo> cells( N ); //read all cell sequences for( int i = 0; i < N; ++i ){ int l, tmp; scanf( "%d", &l ); cells[i].reprod_seq.resize( l ); for( int j = 0; j < l; ++j ){ scanf( "%d", &tmp ); cells[i].reprod_seq[j] = tmp - 1; cells[tmp - 1].occurences.push_back( { i, j } ); } } //read the final sequence deque<int> sequence( M ); for( int i = 0; i < M; ++i ){ scanf( "%d", &sequence[i] ); } // find first occurence for each cell vector<int> cells_occur( N, -1 ); queue<CellIdxLevelPair> cellLevelQueue; cellLevelQueue.push( {0, 1} ); while( !cellLevelQueue.empty() ){ auto cellLevel = cellLevelQueue.front(); cellLevelQueue.pop(); if( cells_occur[cellLevel.cell_idx] != -1 ) //cell already occurred continue; cells_occur[cellLevel.cell_idx] = cellLevel.level; for( int i : cells[cellLevel.cell_idx].reprod_seq ){ if( cells_occur[i] != -1 ) continue; cellLevelQueue.push( { i, cellLevel.level + 1 } ); } } // find occuring single common ancestor for sequence int min_level = -1; int level = findOccurenceLevel( sequence, cells, cells_occur, 1, min_level ); printf( "%d\n", level - 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 | #include <stdio.h> #include <deque> #include <queue> #include <vector> using namespace std; typedef unsigned long long ull; struct CellIdxLevelPair{ int cell_idx; int level; }; struct OccurenceInfo{ int cell_idx; int occur_idx; }; struct CellInfo{ vector<OccurenceInfo> occurences; vector<int> reprod_seq; }; int findOccurenceLevel( deque<int> seq, const vector<CellInfo>& cells, const vector<int>& cells_occur, int level, int& cntrl_level ) { queue<pair<int, deque<int>>> seq_to_process; seq_to_process.push( { 1, seq } ); while( !seq_to_process.empty() ){ auto& lvl_seq = seq_to_process.front(); int level = lvl_seq.first; deque<int> seq; seq.swap( lvl_seq.second ); seq_to_process.pop(); if( cntrl_level != -1 && level >= cntrl_level ) continue; if( seq.size() == 1 ){ int min_level = cells_occur[seq[0]-1]; if( cntrl_level == -1 || level + min_level < cntrl_level ) cntrl_level = level + min_level; continue; } //find first elem of seq int first_elem = seq[0] - 1; queue<pair<int, deque<int>>> idx_newSeq_col; for( const OccurenceInfo& it : cells[first_elem].occurences ){ if( cells_occur[it.cell_idx] == -1 ) continue; auto& rep_seq_to_search = cells[it.cell_idx].reprod_seq; bool isMatch = true; int curr_seq_idx = 1; for( int i = it.occur_idx + 1; i < rep_seq_to_search.size(); ++i ){ if( rep_seq_to_search[i] != seq[curr_seq_idx] - 1 ){ isMatch = false; break; } ++curr_seq_idx; if( curr_seq_idx >= seq.size() ) break; } if( !isMatch ) continue; deque<int> d; d.push_back( it.cell_idx + 1 ); idx_newSeq_col.push( { curr_seq_idx, d } ); } bool isFirstFullSeq = true; while( !idx_newSeq_col.empty() ){ auto& p = idx_newSeq_col.front(); int seq_pos = p.first; deque<int> s; s.swap( p.second ); idx_newSeq_col.pop(); if( seq_pos >= seq.size() ){ seq_to_process.push( { level + 1, s } ); continue; } auto& oc = cells[seq[seq_pos] - 1].occurences; for( int i = 0; i < oc.size(); ++i ){ if( oc[i].occur_idx != 0 ) //occurrence should be on 0 pos continue; auto rep_seq_to_search = cells[oc[i].cell_idx].reprod_seq; int curr_seq_idx = seq_pos + 1; bool isMatch = true; for( int j = 1; j < rep_seq_to_search.size(); ++j ){ if( curr_seq_idx >= seq.size() ) //full curr seq break; if( rep_seq_to_search[j] != seq[curr_seq_idx] - 1 ){ isMatch = false; break; } ++curr_seq_idx; } if( !isMatch ) continue; auto new_s = s; new_s.push_back( oc[i].cell_idx + 1 ); idx_newSeq_col.push( { curr_seq_idx, new_s } ); } } } return cntrl_level; } int main() { int N, M; scanf( "%d", &N ); scanf( "%d", &M ); vector<CellInfo> cells( N ); //read all cell sequences for( int i = 0; i < N; ++i ){ int l, tmp; scanf( "%d", &l ); cells[i].reprod_seq.resize( l ); for( int j = 0; j < l; ++j ){ scanf( "%d", &tmp ); cells[i].reprod_seq[j] = tmp - 1; cells[tmp - 1].occurences.push_back( { i, j } ); } } //read the final sequence deque<int> sequence( M ); for( int i = 0; i < M; ++i ){ scanf( "%d", &sequence[i] ); } // find first occurence for each cell vector<int> cells_occur( N, -1 ); queue<CellIdxLevelPair> cellLevelQueue; cellLevelQueue.push( {0, 1} ); while( !cellLevelQueue.empty() ){ auto cellLevel = cellLevelQueue.front(); cellLevelQueue.pop(); if( cells_occur[cellLevel.cell_idx] != -1 ) //cell already occurred continue; cells_occur[cellLevel.cell_idx] = cellLevel.level; for( int i : cells[cellLevel.cell_idx].reprod_seq ){ if( cells_occur[i] != -1 ) continue; cellLevelQueue.push( { i, cellLevel.level + 1 } ); } } // find occuring single common ancestor for sequence int min_level = -1; int level = findOccurenceLevel( sequence, cells, cells_occur, 1, min_level ); printf( "%d\n", level - 1 ); } |