AcWing 1892. 奶牛线路
原题链接
简单
作者:
Present.
,
2022-04-15 11:01:14
,
所有人可见
,
阅读 135
原谅我写不出来优美的代码
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> v;
int main()
{
int a,b,n;
int res = 10000;
cin >> a >> b >> n;
while(n --)
{
v.clear();
int f,num;
cin >> f >> num;
while(num --)
{
int m;
cin >> m;
v.push_back({m});
}
int q = 0,p = 0;
for(int i = 0;i < v.size();i ++)
{
if(v[i] == a) q = i + 1;
if(v[i] == b) p = i + 1;
}
if(q && p && p > q) res = min(res,f);
}
if(res != 10000) cout << res << endl;
else cout << "-1";
return 0;
}