fork download
copy 
  1. /* AUTHOR: TUAN ANH - BUI */
  2. // ~~ icebear ~~
  3. #include <bits/stdc++.h>
  4. using namespace std;
  5.  
  6. typedef long long ll;
  7. typedef pair<int, int> ii;
  8. typedef pair<int, ii> iii;
  9.  
  10. template<class X, class Y>
  11.     bool minimize(X &x, const Y &y) {
  12.         if (x > y) return x = y, true;
  13.         return false;
  14.     }
  15.  
  16. template<class X, class Y>
  17.     bool maximize(X &x, const Y &y) {
  18.         if (x < y) return x = y, true;
  19.         return false;
  20.     }
  21.  
  22. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  23. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  24. #define REP(i, n) for(int i=0; i<(n); ++i)
  25. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  26. #define MASK(i) (1LL << (i))
  27. #define BIT(S, i) (((S) >> (i)) & 1)
  28. #define mp make_pair
  29. #define pb push_back
  30. #define fi first
  31. #define se second
  32. #define all(x) x.begin(), x.end()
  33. #define task "icebear"
  34. /*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
  35.  
  36. const int MOD = 1e9 + 7;
  37. const int inf = (int)1e9 + 27092008;
  38. const ll INF  = (ll)1e18 + 27092008;
  39. const int N = 2e5 + 5;
  40. int n, m, k, s, t;
  41. vector<ii> G[N], rG[N];
  42. ll dist[N];
  43.  
  44. void dijkstra() {
  45.     priority_queue<ii, vector<ii>, greater<ii> >  Q;
  46.     Q.push(mp(0, s));
  47.     FOR(i, 1, n) dist[i] = INF;
  48.     dist[s] = 0;
  49.     while(!Q.empty()) {
  50.         ll du = Q.top().fi;
  51.         int u = Q.top().se;
  52.         Q.pop();
  53.         if (du != dist[u]) continue;
  54.         for(ii v : G[u]) {
  55.             if (dist[v.fi] > dist[u] + v.se) {
  56.                 dist[v.fi] = dist[u] + v.se;
  57.                 Q.push(mp(dist[v.fi], v.fi));
  58.             }
  59.         }
  60.     }
  61. }
  62.  
  63. void init(void) {
  64.     cin >> n >> m >> k >> s >> t;
  65.     FOR(i, 1, m) {
  66.         int u, v, w;
  67.         cin >> u >> v >> w;
  68.         G[u].pb(mp(v, w));
  69.         rG[v].pb(mp(u, w));
  70.     }
  71. }
  72.  
  73. void process(void) {
  74.     ll ans = INF;
  75.     dijkstra();
  76.     ans = dist[t];
  77.     while(k--) {
  78.         int u, v, w;
  79.         cin >> u >> v >> w;
  80.         G[u].pb(mp(v, w));
  81.         G[v].pb(mp(u, w));
  82.         dijkstra();
  83.         ans = min(ans, dist[t]);
  84.         G[u].pop_back();
  85.         G[v].pop_back();
  86.     }
  87.     cout << (ans == INF ? -1 : ans);
  88. }
  89.  
  90. int main() {
  91.     ios_base::sync_with_stdio(0);
  92.     cin.tie(0); cout.tie(0);
  93.         freopen("gen.inp", "r", stdin);
  94.         freopen("gen.ans", "w", stdout);
  95.  
  96.     int tc = 1;
  97. //    cin >> tc;
  98.     while(tc--) {
  99.         init();
  100.         process();
  101.     }
  102.     return 0;
  103. }
  104.  
  105.  
Success #stdin #stdout 0.01s 14288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/uLoHQB
language:
C++14 (gcc 8.3)
created:
1 hour ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!