procon

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub mugen1337/procon

:x: test/yuki4227.test.cpp

Depends on

Code

#define ERROR 1e-4
#define PROBLEM "https://yukicoder.me/problems/4227"

#include "../template.hpp"

#include "../Graph2/Yen.hpp"

signed main(){
    int n,m,k;cin>>n>>m>>k;
    int s,t;cin>>s>>t;s--,t--;
    vector<double> p(n),q(n);
    rep(i,n) cin>>p[i]>>q[i];

    Graph<double> g(n);
    rep(i,m){
        int u,v;cin>>u>>v;u--,v--;
        double c=hypot(p[u]-p[v],q[u]-q[v]);
        g.add_directed_edge(u,v,c);
        g.add_directed_edge(v,u,c);
    }
    auto res=Yen(g,s,t,k);
    rep(i,k){
        if(i<(int)res.size()) cout<<res[i].first<<endl;
        else cout<<-1<<endl;
    }

    return 0;
}
#line 1 "test/yuki4227.test.cpp"
#define ERROR 1e-4
#define PROBLEM "https://yukicoder.me/problems/4227"

#line 1 "template.hpp"
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

#line 5 "test/yuki4227.test.cpp"

#line 1 "Graph2/GraphTemplate.hpp"



// graph template
// ref : https://ei1333.github.io/library/graph/graph-template.hpp
template<typename T=int>
struct Edge{
    int from,to;
    T w;
    int idx;
    Edge()=default;
    Edge(int from,int to,T w=1,int idx=-1):from(from),to(to),w(w),idx(idx){}
    operator int() const{return to;}
};

template<typename T=int>
struct Graph{
    vector<vector<Edge<T>>> g;
    int V,E;
    Graph()=default;
    Graph(int n):g(n),V(n),E(0){}

    int size(){
        return (int)g.size();
    }
    void resize(int k){
        g.resize(k);
        V=k;
    }
    inline const vector<Edge<T>> &operator[](int k)const{
        return (g.at(k));
    }
    inline vector<Edge<T>> &operator[](int k){
        return (g.at(k));
    }
    void add_directed_edge(int from,int to,T cost=1){
        g[from].emplace_back(from,to,cost,E++);
    }
    void add_edge(int from,int to,T cost=1){
        g[from].emplace_back(from,to,cost,E);
        g[to].emplace_back(to,from,cost,E++);
    }
    void read(int m,int pad=-1,bool weighted=false,bool directed=false){
        for(int i=0;i<m;i++){
            int u,v;cin>>u>>v;
            u+=pad,v+=pad;
            T w=T(1);
            if(weighted) cin>>w;
            if(directed) add_directed_edge(u,v,w);
            else         add_edge(u,v,w);
        }
    }
};


#line 2 "Graph2/Yen.hpp"

// 有向グラフ向け
// 無向グラフでやりたいなら辺のidxが独立になるように振りなおす
// O(KN * (N+M)logN)のはずだけどどこか悪化してるかも
// vector ( pair(cost, pathの辺番号のリスト) ), k個ない時に注意
/*
ref: https://qiita.com/nariaki3551/items/821dc6ffdc552d3d5f22
     https://ei1333.github.io/library/graph/shortest-path/k-shortest-path.hpp
*/
template<typename T>
vector<pair<T,vector<int>>> Yen(Graph<T> g,int s,int t,int k){
    T inf=numeric_limits<T>::max();

    vector<Edge<T>> edge(g.E);
    for(int i=0;i<g.V;i++)for(auto &e:g[i]) edge[e.idx]=e;

    unordered_set<int> removed_edge;
    using P=pair<T,int>;
    auto dijkstra=[&](vector<T> &d,vector<int> &from_v,vector<int> &from_e,int st){
        priority_queue<P,vector<P>,greater<P>> que;
        que.emplace(d[st],st);
        while(!que.empty()){
            auto p=que.top();que.pop();
            int cur=p.second;
            if(d[cur]<p.first) continue;
            for(auto &e:g[cur])if(!removed_edge.count(e.idx)){
                if(chmin(d[e.to],d[cur]+e.w)){
                    from_v[e.to]=cur;
                    from_e[e.to]=e.idx;
                    que.emplace(d[e.to],e.to);
                }
            }
        }
    };

    // (s, t)へのパスの辺番号のvector
    auto get_path=[&](vector<int> &from_v,vector<int> &from_e,int st,int gl){
        vector<int> e_idx;
        for(;gl!=st;gl=from_v[gl]) e_idx.push_back(from_e[gl]);
        reverse(begin(e_idx),end(e_idx));
        return e_idx;
    };

    vector<pair<T,vector<int>>> A;
    set<pair<T,vector<int>>> B;

    vector<T> d;
    vector<int> from_v,from_e;
    d.assign(g.V,inf);
    d[s]=0;
    from_v.assign(g.V,-1);
    from_e.assign(g.V,-1);
    dijkstra(d,from_v,from_e,s);

    if(d[t]==inf) return A;

    A.emplace_back(d[t],get_path(from_v,from_e,s,t));

    for(int i=1;i<k;i++){
        vector<int> &last_path=A.back().second;
        d.assign(g.V,inf);
        d[s]=0;
        from_v.assign(g.V,-1);
        from_e.assign(g.V,-1);

        vector<int> same_path(i); // last pathに沿った道のリスト
        iota(begin(same_path),end(same_path),0);

        // O(N)
        for(int j=0;j<(int)last_path.size();j++){
            int spur=edge[last_path[j]].from;// spur node

            unordered_set<int> removed_edge_new;
            for(auto &l:same_path)if(j<(int)A[l].second.size()) removed_edge_new.insert(A[l].second[j]);
            swap(removed_edge,removed_edge_new);
            
            // spur nodeから先をdijkstraする
            vector<T> d_t{d};
            vector<int> from_v_t{from_v},from_e_t{from_e};

            dijkstra(d_t,from_v_t,from_e_t,spur);
            if(d_t[t]<inf) B.emplace(d_t[t],get_path(from_v_t,from_e_t,s,t));

            // last pathに沿って1つ進める
            auto &spur_root=edge[last_path[j]];
            d[spur_root.to]=d[spur_root.from]+spur_root.w;
            from_e[spur_root.to]=spur_root.idx;
            from_v[spur_root.to]=spur_root.from;

            vector<int> tmp;
            for(auto l:same_path)if(j<(int)A[l].second.size() and A[l].second[j]==last_path[j])
                tmp.push_back(l);
            swap(tmp,same_path);
        }
        if(B.empty()) return A;

        A.push_back(*begin(B));
        B.erase(begin(B));
    }
    return A;
}
#line 7 "test/yuki4227.test.cpp"

signed main(){
    int n,m,k;cin>>n>>m>>k;
    int s,t;cin>>s>>t;s--,t--;
    vector<double> p(n),q(n);
    rep(i,n) cin>>p[i]>>q[i];

    Graph<double> g(n);
    rep(i,m){
        int u,v;cin>>u>>v;u--,v--;
        double c=hypot(p[u]-p[v],q[u]-q[v]);
        g.add_directed_edge(u,v,c);
        g.add_directed_edge(v,u,c);
    }
    auto res=Yen(g,s,t,k);
    rep(i,k){
        if(i<(int)res.size()) cout<<res[i].first<<endl;
        else cout<<-1<<endl;
    }

    return 0;
}
Back to top page