結果
問題 | No.807 umg tours |
ユーザー |
![]() |
提出日時 | 2019-03-22 21:45:38 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 237 ms / 4,000 ms |
コード長 | 2,729 bytes |
コンパイル時間 | 1,409 ms |
コンパイル使用メモリ | 169,320 KB |
実行使用メモリ | 25,788 KB |
最終ジャッジ日時 | 2024-11-23 18:54:42 |
合計ジャッジ時間 | 5,252 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 26 |
ソースコード
#include <bits/stdc++.h>#define ADD(a, b) a = (a + ll(b)) % mod#define MUL(a, b) a = (a * ll(b)) % mod#define MAX(a, b) a = max(a, b)#define MIN(a, b) a = min(a, b)#define rep(i, a, b) for(int i = int(a); i < int(b); i++)#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)#define all(a) (a).begin(), (a).end()#define sz(v) (int)(v).size()#define pb push_back#define sec second#define fst first#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)using namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair<int, int> pi;typedef pair<ll, ll> pl;typedef pair<ll, pi> ppi;typedef vector<int> vi;typedef vector<ll> vl;typedef vector<vl> mat;typedef complex<double> comp;void Debug() {cout << '\n'; }template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){cout<<arg<<" ";Debug(rest...);}template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){out<<"("<<v.first<<", "<<v.second<<")";return out;}const int MAX_N = 300010;const int MAX_V = 100010;const double eps = 1e-6;const ll mod = 1000000007;const int inf = 1 << 30;const ll linf = 1LL << 60;const double PI = 3.14159265358979323846;///////////////////////////////////////////////////////////////////////////////////////////////////int N, M;vector<pl> G[MAX_N];ll d[MAX_N][2];void solve() {cin >> N >> M;rep(i, 0, M) {int a, b, c; cin >> a >> b >> c; a--; b--;G[a].pb(pl(b, c));G[b].pb(pl(a, c));}rep(i, 0, N) {d[i][0] = linf;d[i][1] = linf;}d[0][0] = 0;priority_queue<ppi, vector<ppi>, greater<ppi>> que;que.push(ppi(0, pi(0, 0)));while(!que.empty()) {ppi pp = que.top(); que.pop();int v = pp.sec.fst, type = pp.sec.sec;if(d[v][type] < pp.fst) continue;rep(i, 0, sz(G[v])) {pi e = G[v][i];if(d[e.fst][type] > d[v][type] + e.sec) {d[e.fst][type] = d[v][type] + e.sec;que.push(ppi(d[e.fst][type], pi(e.fst, type)));}if(type == 0) {if(d[e.fst][1] > d[v][type]) {d[e.fst][1] = d[v][type];que.push(ppi(d[e.fst][1], pi(e.fst, 1)));}}}}rep(i, 0, N) {cout << d[i][0] + min(d[i][1], d[i][0]) << "\n";}}int main() {#ifndef LOCALios::sync_with_stdio(false);cin.tie(0);#endifcout << fixed;cout.precision(20);srand((unsigned int)time(NULL));#ifdef LOCAL//freopen("in.txt", "wt", stdout); //for testerfreopen("in.txt", "rt", stdin);#endifsolve();#ifdef LOCALcerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";#endifreturn 0;}