ICPC网络赛 - Magical Girl Haze （DP+最短路）

Magical Girl Haze

题目链接： Magical Girl Haze

题意

给你一个图，N个节点，M条边，现在给你最多K次机会将一条边的权值变为0，求从1到N的最短路。$N < 10^5 ,M < 2*10^5,K <= 10$

---

思路

既然我们总共有K次机会修改，那么最显然的就是DP了，每次在进行最短路松弛时，增加一个状态

$dis[v][k] = dis[u][k] + cost$ 和 $dis[v][k] = dis[u][k-1]$ 两个公式不段断进行松弛即可，这里需用迪杰斯特拉进行优化，这样复杂度为 $O(KMlogv)$

---

代码

#include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(ll i = (ll)j;i <= (ll)k;i ++)
#define per(i,j,k) for(ll i = (ll)j;i >= (ll)k;i --)
#define debug(x) cerr<<#x<<" = "<<(x)<<endl
#define mmm(a,b) memset(a,b,sizeof(a))
#define pb push_back

typedef double db;
typedef long long ll;
const ll MAXN = (ll)1e5+7;
const ll INF = (ll)1e18;

inline int read() { int c = 0, f = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-') f = -1;ch = getchar();}
    while (ch >= '0' && ch <= '9') {c = c * 10 + ch - '0';ch = getchar();}
    return c * f;
}

ll dis[MAXN][12];
int N,M,K;

struct Node{
    int to;
    ll co;
    int sta;
    Node(int to = 0,ll co = 0,int sta = 0):to(to),co(co),sta(sta){}
    bool operator < (const Node& a) const {
        return a.co < co;
    }
};

struct edge{
    int to,co;
    edge(int to = 0,int co = 0):to(to),co(co){}
};

vector<edge> E[MAXN];
bool vis[MAXN][12];

priority_queue<Node> qu;
inline ll djs() {
    while (!qu.empty())qu.pop();
    dis[1][0] = 0;
    qu.push(Node(1,0,0));

    ll ans = INF;
    while (!qu.empty()) {
        Node k = qu.top();qu.pop();
        //cout <<k.to << ',' << k.sta << endl;
        rep(i,0,E[k.to].size()-1) {
            int to = E[k.to][i].to;
            ll co = k.co + E[k.to][i].co;
            if (k.sta < K && k.co < dis[to][k.sta+1]) {
                qu.push(Node(to,k.co,k.sta+1));
                dis[to][k.sta+1] = k.co;
            }
            if (co < dis[to][k.sta]) {
                qu.push(Node(to,co,k.sta));
                dis[to][k.sta] = co;
            }
        }
    }
    ans = *min_element(dis[N],dis[N]+1+K);
    return ans;
}

int main()
{
    int T;
    T = read();
    while(T --) {
        N = read(),M = read(),K = read();
        rep(i,1,N) E[i].clear();
        rep(i,1,N) rep(j,0,K) dis[i][j] = INF;
        rep(i,1,M) {
            int x = read(),y = read(),w = read();
            E[x].pb(edge(y,w));
        }
        printf("%lld\n",djs());
    }
}
/*
2
3 3 1
1 2 1
2 3 1
1 3 1
*/