test/AOJ_GRL_1_A.test.cpp

View this file on GitHub
Last update: 2023-07-17 18:02:31+09:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_A&lang=ja

Depends on

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_A&lang=ja"

#include "../template.hpp"

#include "../Graph2/Dijkstra.hpp"

signed main(){
    int n,m,s;cin>>n>>m>>s;
    Graph<ll> g(n);
    g.read(m,0,true,true);
    Dijkstra dij(g);
    for(auto x:dij.build(s)){
        if(x==dij.inf) cout<<"INF"<<endl;
        else cout<<x<<endl;
    }
    return 0;
}

#line 1 "test/AOJ_GRL_1_A.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_A&lang=ja"

#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 4 "test/AOJ_GRL_1_A.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/Dijkstra.hpp"

template<typename T>
struct Dijkstra{
    const T inf;
    Graph<T> g;
    vector<T> d;
    vector<int> prev,eid;
    
    Dijkstra(Graph<T> g):inf(numeric_limits<T>::max()/4),g(g){}

    vector<T> build(int st){
        d.assign(g.V,inf);
        prev.assign(g.V,-1);
        eid.assign(g.V,-1);
        d[st]=0;
        priority_queue<pair<T,int>,vector<pair<T,int>>,greater<pair<T,int>>> 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(d[e]>d[cur]+e.w){
                    d[e]=d[cur]+e.w;
                    prev[e]=cur;
                    que.emplace(d[e],e);
                }
            }
        }
        return d;
    }

    // vertex = false :-> edge idx
    vector<int> get_path(int gl,bool vertex=true){
        vector<int> ret;
        if(d[gl]==inf) return ret;
        for(;gl!=-1;gl=prev[gl]){
            ret.push_back(vertex?gl:eid[gl]);
        }
        reverse(ret.begin(),ret.end());
        return ret;
    }
};
#line 6 "test/AOJ_GRL_1_A.test.cpp"

signed main(){
    int n,m,s;cin>>n>>m>>s;
    Graph<ll> g(n);
    g.read(m,0,true,true);
    Dijkstra dij(g);
    for(auto x:dij.build(s)){
        if(x==dij.inf) cout<<"INF"<<endl;
        else cout<<x<<endl;
    }
    return 0;
}