結果
問題 | No.2569 はじめてのおつかいHard |
ユーザー |
👑 ![]() |
提出日時 | 2023-12-05 16:47:49 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 179 ms / 2,000 ms |
コード長 | 3,331 bytes |
コンパイル時間 | 2,184 ms |
コンパイル使用メモリ | 208,820 KB |
最終ジャッジ日時 | 2025-02-18 07:52:28 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 10 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=167167167167167167;const int INF=100000000;const int mod=998244353;#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}template<class T> void vec_out(vector<T> &p,int ty=0){if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}using len_type=ll;struct edge{int to;len_type length;};len_type dijkstra_movement(edge e,int from,len_type t){return t+e.length;}vector<len_type> dijkstra(vector<vector<edge>> &G,int start,len_type inf){int M=G.size();assert(M>start&&start>=0);vector<len_type> seen(M,inf);seen[start]=0;priority_queue<pair<len_type,int>,vector<pair<len_type,int>>,greater<pair<len_type,int>>> pq;pq.push({0,start});while(!pq.empty()){len_type time;int ver;tie(time,ver)=pq.top();pq.pop();if(seen[ver]<time) continue;for(edge x:G[ver]){len_type T=dijkstra_movement(x,ver,time);if(T<seen[x.to]){pq.push({T,x.to});seen[x.to]=T;}}}return seen;}void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,0,t) solve();}void solve(){int N,M;cin>>N>>M;vector<vector<edge>> G(N),H(N);rep(i,0,M){int a,b;ll c;cin>>a>>b>>c;a--,b--;G[a].push_back({b,c});H[b].push_back({a,c});}auto f=[&](int ind,vector<vector<edge>> &g) -> vector<ll> {return dijkstra(g,ind,ILL);};auto A=f(N-2,G),B=f(N-2,H);auto C=f(N-1,G),D=f(N-1,H);rep(k,0,N-2){ll ans1=B[k]+A[N-1]+C[k];ll ans2=D[k]+C[N-2]+A[k];ll ans=min(ans1,ans2);if(ans>=ILL) cout<<"-1\n";else cout<<ans<<"\n";}}