1139: [POI2009]Wie

1139: [POI2009]Wie

https://www.lydsy.com/JudgeOnline/problem.php?id=1139

分析：

　　Dijkstra。状压最短路，dis[i][j]表示到第i个点，状态为j的最短路。

　　或者 分层最短路可以做。

代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;

inline int read() { 
    int x=0,f=1;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;
    for(;isdigit(ch);ch=getchar())x=x*10+ch-'0';return x*f;
}

const int N = 210;
const int M = 3010;

int dis[210][8200], head[N], to[M<<1], nxt[M<<1], sta[M<<1], len[M<<1], S[N], Enum, n;
bool vis[210][8200];

struct Heap{
    int u, dis, st;
    Heap() {}
    Heap(int a,int b,int c) {u = a, dis = b, st = c;}
    bool operator < (const Heap &A) const {
        return dis > A.dis;
    }
};
priority_queue < Heap > q;

void add_edge(int u,int v,int w,int s) {
    ++Enum; to[Enum] = v; len[Enum] = w; sta[Enum] = s; nxt[Enum] = head[u]; head[u] = Enum;
    ++Enum; to[Enum] = u; len[Enum] = w; sta[Enum] = s; nxt[Enum] = head[v]; head[v] = Enum;
}

int Dijkstra() {
    memset(dis, 0x3f, sizeof(dis));
    dis[1][0] = 0;
    q.push(Heap(1, 0, 0));
    while (!q.empty()) {
        int d = q.top().dis, u = q.top().u, s = q.top().st; q.pop();
        if (u == n) return d;
        if (vis[u][s]) continue;
        vis[u][s] = true;
        s |= S[u];
        for (int i=head[u]; i; i=nxt[i]) {
            int v= to[i];
            if ((sta[i] | s) != s) continue;
            if (dis[v][s] > d + len[i]) {
                dis[v][s] = d + len[i];
                q.push(Heap(v, dis[v][s], s));
            }
        }
    }
    return -1;
}

int main () { 
    
    n = read(); int m = read(), p = read(), k = read();
    for (int w,cnt,t,st,i=1; i<=k; ++i) {
        w = read(), cnt = read();
        for (int j=1; j<=cnt; ++j) {
            t = read();
            S[w] |= (1 << (t - 1));
        }
    }
    for (int i=1; i<=m; ++i) {
        int u = read(), v = read(), w = read(), cnt = read(), st = 0, t;
        for (int j=1; j<=cnt; ++j) {
            t = read();
            st |= (1 << (t - 1));
        }
        add_edge(u, v, w, st);
    }
    printf("%d",Dijkstra());    
    return 0;
}