【CF】142 Div.1 B. Planes

/* 229B */
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <deque>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <cctype>
#include <cassert>
#include <functional>
#include <iterator>
#include <iomanip>
using namespace std;
//#pragma comment(linker,"/STACK:102400000,1024000")

#define sti                set<int>
#define stpii            set<pair<int, int> >
#define mpii            map<int,int>
#define vi                vector<int>
#define pii                pair<int,int>
#define vpii            vector<pair<int,int> >
#define rep(i, a, n)     for (int i=a;i<n;++i)
#define per(i, a, n)     for (int i=n-1;i>=a;--i)
#define clr                clear
#define pb                 push_back
#define mp                 make_pair
#define fir                first
#define sec                second
#define all(x)             (x).begin(),(x).end()
#define SZ(x)             ((int)(x).size())
#define lson            l, mid, rt<<1
#define rson            mid+1, r, rt<<1|1

const int maxn = 1e5+5;
const int INF = 0x3f3f3f3f;
vpii E[maxn];
vpii T[maxn];
int dis[maxn];
bool visit[maxn];
int a[maxn], b[maxn];

int main() {
ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("data.in", "r", stdin);
freopen("data.out", "w", stdout);
#endif

int n, m;
int u, v, w;

scanf("%d %d", &n, &m);
while (m--) {
scanf("%d %d %d", &u, &v, &w);
E[u].pb(mp(v, w));
E[v].pb(mp(u, w));
}
rep(i, 1, n+1) {
scanf("%d", &m);
rep(j, 1, m+1)
scanf("%d", &a[j]);
b[m] = 1;
per(j, 1, m) {
if (a[j]+1 == a[j+1])
b[j] = b[j+1] + 1;
else
b[j] = 1;
}
rep(j, 1, m+1)
T[i].pb(mp(a[j], b[j]));
}

int i, tmp;
int ans = INF;
pii p(0, 0);
vpii::iterator iter;
queue<int> Q;
Q.push(1);
memset(dis, 0x3f, sizeof(dis));
// may be have 0 in T[1]
iter = upper_bound(all(T[1]), p);
if (iter!=T[1].end() && iter->fir==0) {
dis[1] = iter->sec;
} else {
dis[1] = 0;
}
visit[1] = true;

while (!Q.empty()) {
u = Q.front();
Q.pop();
visit[u] = false;
for (i=0; i<SZ(E[u]); ++i) {
v = E[u][i].fir;
w = E[u][i].sec;
tmp = dis[u] + w;
if (v==n && tmp<ans)
ans = tmp;
p.fir = tmp;
iter = upper_bound(all(T[v]), p);
if (iter!=T[v].end() && iter->fir==tmp) {
tmp += iter->sec;
}
if (tmp < dis[v]) {
dis[v] = tmp;
if (!visit[v]) {
visit[v] = true;
Q.push(v);
}
}
}
}

ans = ans==INF ? -1:ans;
printf("%d\n", ans);

#ifndef ONLINE_JUDGE
printf("time = %d.\n", (int)clock());
#endif

return 0;
}