結果
問題 | No.2569 はじめてのおつかいHard |
ユーザー |
👑 ![]() |
提出日時 | 2023-11-15 17:53:15 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 536 ms / 2,000 ms |
コード長 | 4,185 bytes |
コンパイル時間 | 5,390 ms |
コンパイル使用メモリ | 227,512 KB |
実行使用メモリ | 31,036 KB |
最終ジャッジ日時 | 2024-09-26 04:41:34 |
合計ジャッジ時間 | 9,448 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 141 ms
13,696 KB |
testcase_01 | AC | 141 ms
13,696 KB |
testcase_02 | AC | 142 ms
13,696 KB |
testcase_03 | AC | 143 ms
13,696 KB |
testcase_04 | AC | 141 ms
13,824 KB |
testcase_05 | AC | 525 ms
30,604 KB |
testcase_06 | AC | 301 ms
21,232 KB |
testcase_07 | AC | 487 ms
30,768 KB |
testcase_08 | AC | 536 ms
31,036 KB |
testcase_09 | AC | 215 ms
18,264 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <algorithm> #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> using mint = modint998244353; template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T> &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T> &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T> &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T> &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } ll INF = 100000000000000002; void dijkstra(vvpll &graph, ll v, vl &dist) { priority_queue<pll, vpll, greater<pll>> pque; pque.push(pll(0, v)); dist[v] = 0; while (pque.size()) { pll p = pque.top(); pque.pop(); if (dist[p.second] != p.first) { continue; } for (auto x : graph[p.second]) { if (dist[x.first] > dist[p.second] + x.second) { dist[x.first] = dist[p.second] + x.second; pque.push(pll(dist[x.first], x.first)); } } } } int main() { ll N, M; cin >> N >> M; vector<ll> u(M); vector<ll> v(M); vector<ll> t(M); for (ll i = 0; i < M; i++) { cin >> u[i] >> v[i] >> t[i]; u[i]--; v[i]--; } vector<vector<pll>> graph(N, vector<pll>(0)); vector<vector<pll>> graph_inv(N, vector<pll>(0)); for (ll i = 0; i < M; i++) { graph[u[i]].push_back(pll(v[i], t[i])); graph_inv[v[i]].push_back(pll(u[i], t[i])); } vector<ll> distn1(N, INF); vector<ll> distn(N, INF); vector<ll> distn1_inv(N, INF); vector<ll> distn_inv(N, INF); dijkstra(graph, N - 2, distn1); dijkstra(graph, N - 1, distn); dijkstra(graph_inv, N - 2, distn1_inv); dijkstra(graph_inv, N - 1, distn_inv); for (ll i = 0; i < N - 2; i++) { ll ans = min(distn1_inv[i] + distn1[N - 1] + distn[i], distn_inv[i] + distn[N - 2] + distn1[i]); if (ans >= INF) { cout << -1 << endl; } else { cout << ans << endl; } } }