刷题记录（NC22594 Rinne Loves Graph）

NC22594 Rinne Loves Graph

题目链接

关键点：

1、在用dijkstra求最短路的过程中加入了警戒城市，可以在dis最短路数组中加入当前过了几个警戒城市，即再开一维。在vis数组也开一维。在求最短路的过程中，在多加一个判断当前经过的警戒城市是否超过要求，其余就与dijkstra求最短路算法类似

完整代码：

# include <bits/stdc++.h>
using namespace std;
const int N = 1000;
struct ty{
    int t, next, len;
}edge[N*8+10];
struct ty2{
    int x, num, dis;
    bool operator < (const ty2& a) const{
        return dis>a.dis;
    }
};
int n, m, k, cnt;
int head[N], vis[N][20], t[N];
int dis[N][20];
priority_queue<ty2>q;
void addedge(int x, int y, int len)
{
    edge[++cnt].t = y;
    edge[cnt].len = len;
    edge[cnt].next = head[x];
    head[x] = cnt;
}
int dij(int s)
{
    memset(dis, 0x3f, sizeof(dis));
    ty2 tmp;
    tmp.dis = 0, tmp.num = 0, tmp.x = s;
    dis[s][0] = 0;
    q.push(tmp);
    while (!q.empty())
    {
        ty2 tmp = q.top();
        q.pop();
        int x = tmp.x;
        if (vis[x][tmp.num]) continue;
        if (tmp.num>k) continue;
        vis[x][tmp.num] = 1;
        for (int i=head[x]; i!=-1; i=edge[i].next)
        {
            int y = edge[i].t;
            if (t[x])
            {
                if (tmp.num+1>k) continue;
                if (vis[y][tmp.num+1]) continue;
                if (dis[x][tmp.num]+edge[i].len<dis[y][tmp.num+1])
                {
                    dis[y][tmp.num+1] = dis[x][tmp.num]+edge[i].len;
                    ty2 tmp2;
                    tmp2.dis = dis[y][tmp.num+1];
                    tmp2.num = tmp.num+1;
                    tmp2.x = y;
                    q.push(tmp2);
                }
            }
            else
            {
                if (vis[y][tmp.num]) continue;
                if (dis[x][tmp.num]+edge[i].len<dis[y][tmp.num])
                {
                    dis[y][tmp.num] = dis[x][tmp.num]+edge[i].len;
                    ty2 tmp2;
                    tmp2.dis = dis[y][tmp.num];
                    tmp2.num = tmp.num;
                    tmp2.x = y;
                    q.push(tmp2);
                }
            }
        }
    }
    int minn = 0x3f3f3f3f;
    for (int i=0; i<=k; i++)
        minn = min(minn, dis[n][i]);
    if (minn>=0x3f3f3f3f)
        return -1;
    else
        return minn;
}
int main()
{
    memset(head, -1, sizeof(head));
    cin>>n>>m>>k;
    for (int i=1; i<=n; i++)
        cin>>t[i];
    for (int i=1; i<=m; i++)
    {
        int x, y, len;
        cin>>x>>y>>len;
        addedge(x, y, len);
        addedge(y, x, len);
    }
    cout<<dij(1);
    
    return 0;
}