結果
問題 | No.2569 はじめてのおつかいHard |
ユーザー |
|
提出日時 | 2023-12-02 16:12:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 406 ms / 2,000 ms |
コード長 | 2,603 bytes |
コンパイル時間 | 2,581 ms |
コンパイル使用メモリ | 215,260 KB |
最終ジャッジ日時 | 2025-02-18 05:16:54 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 10 |
ソースコード
#include <bits/stdc++.h>using namespace std;long long mod = 998244353;int main(){ios_base::sync_with_stdio(false);cin.tie(nullptr);int N,M; cin >> N >> M;vector<vector<pair<int,long long>>> Graph(N),rev(N);for(int i=0; i<M; i++){int u,v; cin >> u >> v;u--; v--;long long t; cin >> t;Graph.at(u).push_back({v,t});rev.at(v).push_back({u,t});}vector<bool> already(N);vector<long long> dist1(N,2e18);priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<pair<long long,int>>> Q;Q.push({0,N-1}); dist1.at(N-1) = 0;while(Q.size()){auto[pdist,pos] = Q.top(); Q.pop();if(already.at(pos)) continue;already.at(pos) = true;for(auto [to,cost] : Graph.at(pos)){if(dist1.at(to) > pdist+cost){dist1.at(to) = pdist+cost;Q.push({dist1.at(to),to});}}}already.assign(N,false);vector<long long> dist2(N,2e18);Q.push({0,N-2}); dist2.at(N-2) = 0;while(Q.size()){auto[pdist,pos] = Q.top(); Q.pop();if(already.at(pos)) continue;already.at(pos) = true;for(auto [to,cost] : Graph.at(pos)){if(dist2.at(to) > pdist+cost){dist2.at(to) = pdist+cost;Q.push({dist2.at(to),to});}}}already.assign(N,false);vector<long long> dist3(N,2e18);Q.push({0,N-1}); dist3.at(N-1) = 0;while(Q.size()){auto[pdist,pos] = Q.top(); Q.pop();if(already.at(pos)) continue;already.at(pos) = true;for(auto [to,cost] : rev.at(pos)){if(dist3.at(to) > pdist+cost){dist3.at(to) = pdist+cost;Q.push({dist3.at(to),to});}}}already.assign(N,false);vector<long long> dist4(N,2e18);Q.push({0,N-2}); dist4.at(N-2) = 0;while(Q.size()){auto[pdist,pos] = Q.top(); Q.pop();if(already.at(pos)) continue;already.at(pos) = true;for(auto [to,cost] : rev.at(pos)){if(dist4.at(to) > pdist+cost){dist4.at(to) = pdist+cost;Q.push({dist4.at(to),to});}}}for(int i=0; i<N-2; i++){long long answer = 2e18;answer = min({answer,dist3.at(i)+dist1.at(N-2)+dist2.at(i),dist4.at(i)+dist2.at(N-1)+dist1.at(i)});if(answer == 2e18) cout << -1 << endl;else cout << answer << endl;}}