-
Notifications
You must be signed in to change notification settings - Fork 0
/
3063.cpp
71 lines (56 loc) · 1.12 KB
/
3063.cpp
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
// Linhas de Ônibus
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define MAXN 501
vvi G;
vi dist;
queue<int> q;
int bfs(int src, int dst, int size)
{
dist[src] = 0;
q.push(src);
while(!q.empty())
{
int u = q.front();
q.pop();
for(auto v : G[u])
{
if(dist[v] == -1)
{
dist[v] = dist[u] + 1;
if(v == dst) return dist[v] / 2;
q.push(v);
}
}
}
return -1;
}
int main()
{
int T, L, O, D;
cin >> T >> L >> O >> D;
G = vvi(T + L + 1);
dist = vi(T + L + 1, -1);
for(int i = 1; i <= L; i++)
{
int c;
cin >> c;
for(int j = 0; j < c; j++)
{
int t;
cin >> t;
G[t].push_back(i + T);
G[i + T].push_back(t);
}
}
// for(int i = 1; i < G.size(); i++)
// {
// printf("[%2d]", i);
// for(auto j : G[i])
// printf("(%2d)", j);
// printf("\n");
// }
cout << bfs(O, D, T) << endl;
}