Submission #2888480

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <tuple>
#include <utility>
#include <vector>

#define llong long long

using namespace std;
const int IINF = 2147483647;
const llong LLINF = 9223372036854775807;

vector<llong> DJK(int n, int s, vector<vector<pair<int, llong>>> &E)
{
    vector<pair<llong, bool>> V(n);
    for (int i = 0; i < n; i++)
        V[i] = make_pair(-1, false);
    V[s].first = 0;
    priority_queue<pair<llong, int>> Q;
    Q.push(make_pair(-V[s].first, s));
    while (!Q.empty())
    {
        int m = Q.top().second;
        Q.pop();
        if (V[m].second)
            continue;
        V[m].second = true;
        for (pair<int, llong> p : E[m])
        {
            int pd = p.first;
            llong plen = p.second;
            if (V[pd].first < 0)
                V[pd].first = LLINF;
            if (V[m].first + plen < V[pd].first)
            {
                V[pd].first = V[m].first + plen;
                Q.push(make_pair(-V[pd].first, pd));
            }
        }
    }
    vector<llong> ret(n);
    for (int i = 0; i < n; i++)
        ret[i] = V[i].first;
    return ret;
}

int main(){
  int n, m, s, t;
  cin >> n >> m >> s >> t;
  vector<vector<pair<int, llong>>>uva(n), uvb(n);
  for(int i=0; i<m; i++){
    int u, v, a, b;
    cin >> u >> v >> a >> b;
    uva[u-1].push_back(make_pair(v-1, a));
    uva[v-1].push_back(make_pair(u-1, a));
    uvb[u-1].push_back(make_pair(v-1, b));
    uvb[v-1].push_back(make_pair(u-1, b));
  }
  vector<llong>ca=DJK(n, s-1, uva), cb=DJK(n, t-1, uvb), c(n);
  for(int i=0; i<n; i++)c[i]=ca[i]+cb[i];
  llong mc=c[n-1];
  vector<llong>ret(n);
  for(int i=n-1; i>=0; i--){
    mc = min(mc, c[i]);
    ret[i]=1000000000000000-mc;
  }
  for(int i=0; i<n; i++)cout << ret[i] << endl;
  return 0;
}

Submission Info

Judge Result