leetcode 2045. 到达目的地的第二短时间

class Solution {
public:
    typedef pair<int,int> pii;
    struct cmp{
        bool operator ()(pii &a,pii &b)
        {
            return a.second>b.second;
        }
    };
    
    int secondMinimum(int n, vector<vector<int>>& edges, int time, int change) {
        vector<int>G[n+1];
        for(auto &p:edges)
        {
            G[p[0]].push_back(p[1]);
            G[p[1]].push_back(p[0]);
        }
        vector<int>dis1(n+1,INT_MAX),dis2(n+1,INT_MAX);
        priority_queue<pii,vector<pii>,cmp>q;
        q.push({1,0});
        dis1[1]=0;
        int cnt=0,first=INT_MAX;
        while(q.size())
        {
            auto [u,d]=q.top();
            q.pop(); 
            for(int i=0;i<G[u].size();i++)
            {
                int v=G[u][i];
                int w= (d%(2*change)<change)?d+time:d-(d%(change))+change+time;
                    if(w<dis1[v])
                    {
                        dis2[v]=dis1[v];
                        dis1[v]=w;
                        q.push({v,w});
                    }
                    else if(w>dis1[v]&&w<dis2[v])
                    {
                        dis2[v]=w;
                        q.push({v,w});
                    }
            }
        }
        return dis2[n];
    }
};