Coloring Contention

题目链接

题意理解的不是很清楚，反正就是Alice想要Bob选择的路径里颜色转换次数最大，那么Alice就要使路径的颜色交替变换，但Bob想要产生的颜色转换最小，就求从1到n的最短路。（我理解的可能也不是很准确，但就是用最短路来求😂）

好像用普通的Dijkstra会超时，得用dijkstra+堆优化

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define ll long long
#define inf 0x3f3f3f3f
#define lowbit(x) ((~x+1)&x)
using namespace std;
const int N = 2e5+100;
struct node {
    int w,v,next;
}e[N];
int u,v,n,m,cnt;
int head[N];
int dist[N],vis[N];
priority_queue< pair<int,int> >q;

void addedge(int u,int v) {
    e[cnt].v = v;
    e[cnt].next = head[u];
    head[u] = cnt++;
}

void dijk() {
    memset(dist,inf,sizeof(dist));
    memset(vis,0,sizeof(vis));
    dist[1] = 0;
    q.push(make_pair(0,1));//distance,point
    while(!q.empty()) {
        int pre = q.top().second;
        q.pop();
        if(vis[pre]) continue;
        vis[pre] = 1;
        for(int i=head[pre]; i!=-1; i=e[i].next) {
            int nxt = e[i].v;
            if(dist[nxt]>dist[pre]+1) {
                dist[nxt] = dist[pre]+1;
                q.push(make_pair(-dist[nxt],nxt));
            }
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin>>n>>m;
    memset(head,-1,sizeof(head));
    for(int i=1; i<=m; i++) {
        cin>>u>>v;
        addedge(u,v);
        addedge(v,u);
    }
    dijk();
    cout<<dist[n]-1<<endl;
    return 0;
}