結果

問題 No.807 umg tours
ユーザー sak
提出日時 2020-06-22 00:19:11
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,432 bytes
コンパイル時間 4,738 ms
コンパイル使用メモリ 215,572 KB
最終ジャッジ日時 2025-01-11 09:12:33
ジャッジサーバーID
（参考情報） 		judge5 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other WA * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

struct edge { ll to, d; };
vector<vector<edge>> adj;

vector<ll> dijkstra_1(int n=0) {
  int N = adj.size();
  auto c = [](const p_ll &x, const p_ll &y){return x.second>y.second;};
  priority_queue<p_ll, vector<p_ll>, decltype(c)> q(c);
  vector<ll> result(N,LLINF); result[n] = 0; q.push(make_pair(n,0));
  while(q.size()) {
    p_ll now = q.top(); q.pop();
    ll np = now.first, nd = now.second;
    if (nd>result[np]) continue;
    for (auto x: adj[np]) {
      if (result[x.to]<=result[np]+x.d) continue;
      q.push(make_pair(x.to, result[np]+x.d));
      result[x.to] = result[np]+x.d;
    }
  }
  return result;
}

struct road {
  ll d, m;
  bool operator< (const road &x) const { return d-m<x.d-x.m||(d-m==x.d-x.m&&m<x.m); };
  bool operator<= (const road &x) const { return d-m<x.d-x.m||(d-m==x.d-x.m&&m<=x.m); };
  bool operator> (const road &x) const { return d-m>x.d-x.m||(d-m==x.d-x.m&&m>x.m); };
  bool operator>= (const road &x) const { return d-m>x.d-x.m||(d-m==x.d-x.m&&m>=x.m); };
};

vector<ll> dijkstra_2(int n=0) {
  int N = adj.size();
  auto c = [](const pair<ll, road> &x, const pair<ll, road> &y){return x.second>y.second;};
  priority_queue<pair<ll, road>, vector<pair<ll, road>>, decltype(c)> q(c);
  vector<road> rtmp(N,{LLINF,0}); rtmp[n].d = 0; q.push(make_pair(n,(road){0,0}));
  while(q.size()) {
    pair<ll, road> now = q.top(); q.pop();
    ll np = now.first; road nd = now.second;
    if (nd>rtmp[np]) continue;
    for (auto x: adj[np]) {
      if (rtmp[x.to]<=(road){rtmp[np].d+x.d, max(x.d,rtmp[np].m)}) continue;
      q.push(make_pair(x.to, (road){rtmp[np].d+x.d, max(x.d,rtmp[np].m)}));
      rtmp[x.to].d = rtmp[np].d+x.d;
      rtmp[x.to].m = max(x.d,rtmp[np].m);
    }
  }
  rep(i,N) cout << rtmp[i].d << "-" << rtmp[i].m << " "; cout << endl;
  vector<ll> result(N); rep(i,N) result[i] = rtmp[i].d - rtmp[i].m;
  return result;
}

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

int main() {
  ll N, M; cin >> N >> M;
  adj.resize(N);
  rep(i,M) {
    ll a, b, c; cin >> a >> b >> c; a--; b--;
    adj[a].push_back({b,c});
    adj[b].push_back({a,c});
  }
  vector<ll> d1 = dijkstra_1(), d2 = dijkstra_2();
  // debug(all(d1)); debug(all(d2));

  rep(i,N) cout << d1[i] + d2[i] << endl;
  return 0;
}
0