結果
問題 | No.807 umg tours |
ユーザー | omochana2 |
提出日時 | 2019-03-22 21:45:38 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 195 ms / 4,000 ms |
コード長 | 2,729 bytes |
コンパイル時間 | 1,328 ms |
コンパイル使用メモリ | 155,168 KB |
実行使用メモリ | 27,224 KB |
最終ジャッジ日時 | 2023-08-15 11:53:16 |
合計ジャッジ時間 | 4,808 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
11,064 KB |
testcase_01 | AC | 3 ms
11,052 KB |
testcase_02 | AC | 3 ms
11,024 KB |
testcase_03 | AC | 3 ms
11,168 KB |
testcase_04 | AC | 3 ms
10,980 KB |
testcase_05 | AC | 3 ms
11,000 KB |
testcase_06 | AC | 3 ms
11,116 KB |
testcase_07 | AC | 3 ms
11,072 KB |
testcase_08 | AC | 3 ms
11,040 KB |
testcase_09 | AC | 4 ms
10,972 KB |
testcase_10 | AC | 3 ms
11,076 KB |
testcase_11 | AC | 102 ms
21,900 KB |
testcase_12 | AC | 100 ms
19,184 KB |
testcase_13 | AC | 148 ms
22,100 KB |
testcase_14 | AC | 60 ms
15,664 KB |
testcase_15 | AC | 45 ms
14,684 KB |
testcase_16 | AC | 139 ms
22,852 KB |
testcase_17 | AC | 179 ms
27,224 KB |
testcase_18 | AC | 177 ms
26,764 KB |
testcase_19 | AC | 195 ms
24,336 KB |
testcase_20 | AC | 90 ms
17,704 KB |
testcase_21 | AC | 94 ms
17,820 KB |
testcase_22 | AC | 40 ms
14,008 KB |
testcase_23 | AC | 30 ms
13,360 KB |
testcase_24 | AC | 87 ms
22,816 KB |
testcase_25 | AC | 186 ms
26,152 KB |
ソースコード
#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 LOCAL ios::sync_with_stdio(false); cin.tie(0); #endif cout << fixed; cout.precision(20); srand((unsigned int)time(NULL)); #ifdef LOCAL //freopen("in.txt", "wt", stdout); //for tester freopen("in.txt", "rt", stdin); #endif solve(); #ifdef LOCAL cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif return 0; }