[最短路] 2017 计蒜之道 复赛 D. 百度地图导航

直接最短路就好了
第一次写竟然只拆了一个点 样例输出一坨0 QAQ
没有拿到FB 不开心

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<vector>
#define cl(x) memset(x,0,sizeof(x))
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll,int> abcd;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
const int N=200005;
const int M=400005;
struct edge{
  int u,v,w,next;
}G[M<<1];
int head[N],inum;
#define V G[p].v
inline void add(int u,int v,int w){
  int p=++inum; G[p].u=u; G[p].v=v; G[p].w=w; G[p].next=head[u]; head[u]=p;
}
inline void link(int u,int v,int w){
  add(u,v,w); add(v,u,w);
}
inline void clear(){
  cl(head); inum=0;
}
int n,m;
int S,T;
ll dis[N];
priority_queue<abcd> Q;
inline void Dij(){
  while (!Q.empty()) Q.pop();
  for (int i=1;i<=n+m+m;i++) dis[i]=1LL<<60;

  dis[S]=0,Q.push(abcd(0,S));

  while (!Q.empty()){
    int u=Q.top().second; ll d=Q.top().first; Q.pop();
    if (dis[u]!=-d) continue;
    for (int p=head[u];p;p=G[p].next)
      if (dis[V]>dis[u]+G[p].w){
    dis[V]=dis[u]+G[p].w;
    Q.push(abcd(-dis[V],V));
      }
  }
}
int main(){
  int k,x,y,w;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(m);
  for (int i=1;i<=m;i++){
    read(k);
    while (k--){
      read(x),add(x,n+i,0),add(n+m+i,x,0);
    }
  }
  int mm;
  read(mm);
  while (mm--){
    read(x); read(y); read(w);
    add(x,y,w); add(y,x,w);
  }
  read(mm);
  while (mm--){
    read(x); read(y); read(w);
    add(n+x,n+m+y,w);
    add(n+y,n+m+x,w);
  }
  read(S); read(T);
  Dij();
  if (dis[T]==1LL<<60)
    printf("-1\n");
  else
    printf("%lld\n",dis[T]);
  return 0;
}