#607249 (C++17) No.848 なかよし旅行

• 問題: No.848 なかよし旅行
• ユーザー: k
• 提出日時: 2021-01-18 22:14:45
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: RE
• 実行時間: -
• コード長: 1,618 bytes
• コンパイル時間: 1,400 ms
• コンパイル使用メモリ: 228,144 KB
• 実行使用メモリ: 7,972 KB
• 最終ジャッジ日時: 2026-06-17 04:11:54
• 合計ジャッジ時間: 6,634 ms
• ジャッジサーバーID （参考情報）: judge1_1 / judge2_0

ファイルパターン	結果
sample	RE * 4
other	AC * 1 WA * 1 RE * 24

コンパイルメッセージ

main.cpp: In function 'std::vector<long long int> dijkstra(const std::vector<std::vector<std::pair<int, int> > >&, int)':
main.cpp:18:19: warning: 'v' may be used uninitialized [-Wmaybe-uninitialized]
   18 |     if (d > dist[v]) continue;
      |                   ^
main.cpp:17:9: note: 'v' declared here
   17 |     int v;
      |         ^
main.cpp:18:5: warning: 'd' may be used uninitialized [-Wmaybe-uninitialized]
   18 |     if (d > dist[v]) continue;
      |     ^~
main.cpp:16:15: note: 'd' was declared here
   16 |     long long d;
      |               ^
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/set:65,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/x86_64-pc-linux-gnu/bits/stdc++.h:161,
                 from main.cpp:1:
In member function 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = int; _Compare = std::less<int>; _Alloc = std::allocator<int>]',
    inlined from 'std::vector<long long int> dijkstra(const std::vector<std::vector<std::pair<int, int> > >&, int)' at main.cpp:20:19:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_set.h:536:32: warning: 'v' may be used uninitialized [-Wmaybe-uninitialized]
  536 |           _M_t._M_insert_unique(__x);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/map:64,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/x86_64-pc-linux-gnu/bits/stdc++.h:155:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_tree.h: In function 'std::vector<long long int> dijkstra(const std::vector<std::vector<std::pair<int, int> > >&, int)':
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_tree.h:278

ソースコード

#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
const long long INF = 1LL<<60;

vector<long long> dijkstra(const vector<vector<pair<int, int> > > &edges, int s) {
  int n = edges.size();
  vector<long long> dist(n, INF);

  set<int> visited;
  priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>> > Q;
  Q.emplace(0, s);
  while (!Q.empty()) {
    long long d;
    int v;
    if (d > dist[v]) continue;

    visited.insert(v);
    if (visited.size() == n)
      break;
    
    tie(d, v) = Q.top();
    Q.pop();
    dist[v] = d;

    for (auto &[w, cost] : edges[v]) {
      if (d + cost < dist[w]) {
        dist[w] = d + cost;
        Q.emplace(dist[w], w);
      }
    }
  }

  return dist;
}


int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n, m, p, q, t;
  cin >> n >> m >> p >> q >> t;
  --p, --q;

  vector<vector<pair<int, int> > > edges(n);
  for (int i = 0; i < m; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    --a, --b;
    edges[a].emplace_back(b, c);
    edges[b].emplace_back(a, c);
  }

  vector<long long> dp = dijkstra(edges, p);
  vector<long long> dq = dijkstra(edges, q);
  vector<long long> ds = dijkstra(edges, 0);

  long long ret = -1;
  for (int i = 0; i < n; i++) {
    long long tmp;
    // ずっと一緒
    tmp = 2 * ds[i] + dp[i] + dq[i] + dp[q];
    if (t >= tmp)
      ret = t;
    
    // 途中で別れる
    tmp = 2 * ds[i] + 2 * max(dp[i], dq[i]);
    if (t >= tmp) {
      ret = max(ret, t - tmp + 2 * ds[i]);
    }
  }

  cout << ret << endl;
  
  return 0;
}