Submission #2813641

---

Source Code Expand

#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
using namespace std;
#define MAX_N 100001
#define INF 10E15 + 1
#define REP(i,COUNT) for(int i=0;i<(int)(COUNT);i++)
struct edge{
  long long int to, cost;
};
typedef vector<vector<edge> > AdjList;
AdjList graph;
AdjList graph2;
typedef pair<long long int, long long int> P;
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
vector<long long int> dist;
void dijkstra(int n,long long int s){
  dist = vector<long long int>(n,INF);
  dist[s] = 0;

  priority_queue<P, vector<P> , greater<P> > que;
  que.push(P(0,s));

  while(!que.empty()){
    P p = que.top();
    que.pop();
    int v = p.second;
    if(dist[v] < p.first)
      continue;
    REP(i,graph[v].size()){
      edge e = graph[v][i];
      if(dist[e.to] > dist[v] + e.cost){
        dist[e.to] = dist[v] + e.cost;
        que.push(P(dist[e.to],e.to));
      }

    }

  }
}

int main()
{
  long long int money = 1.0E15,res[100001];
  long long int u,v,n,m,s,t,a,b,distt[100001];
  cin >> n >> m >> s >> t;
  graph = AdjList(n);
  graph2 = AdjList(n);
  REP(i,m){
    cin >> u >> v  >> a >> b;
    graph[u-1].push_back((edge){v-1,a});
    graph[v-1].push_back((edge){u-1,a});
    graph2[u-1].push_back((edge){v-1,b});
    graph2[v-1].push_back((edge){u-1,b});
  }
  dijkstra(n,s-1);
  REP(i,n)distt[i] = dist[i];
  graph = graph2;
  dijkstra(n,t-1);
  res[n-1] = distt[n-1] + dist[n-1];
  for(int i=n-2;i>=0;i--)
    res[i] = min(distt[i] + dist[i],res[i+1]);
  REP(i,n)
    cout << money - res[i] << endl;
  return 0;
}

int par[MAX_N];
int ranks[MAX_N];

//n要素で初期化
void init(int n){
  REP(i,n){
    par[i] = i;
    ranks[i] = 0;
  }

}

//木の根を求める
int find(int x){
  if(par[x] == x){
    return x;
  }else{
    return par[x] = find(par[x]);
  }
}

void unite(int x,int y){
  x = find(x);
  y = find(y);
  if(x == y) return ;
  if(ranks[x] < ranks[y]){
    par[x] = y;
  }else{
    par[y] = x;
    if(ranks[x] == ranks[y]) ranks[x]++;
  }
}

bool same(int x, int y){
  return find(x) == find(y);
}

Submission Info

Judge Result