結果
問題 | No.1480 Many Complete Graphs |
ユーザー | kimiyuki |
提出日時 | 2021-04-16 22:49:34 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 167 ms / 2,000 ms |
コード長 | 2,567 bytes |
コンパイル時間 | 2,529 ms |
コンパイル使用メモリ | 218,064 KB |
実行使用メモリ | 23,964 KB |
最終ジャッジ日時 | 2023-09-16 03:00:04 |
合計ジャッジ時間 | 8,092 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 21 ms
7,484 KB |
testcase_14 | AC | 15 ms
6,016 KB |
testcase_15 | AC | 34 ms
8,480 KB |
testcase_16 | AC | 19 ms
7,280 KB |
testcase_17 | AC | 19 ms
6,836 KB |
testcase_18 | AC | 7 ms
5,684 KB |
testcase_19 | AC | 20 ms
6,840 KB |
testcase_20 | AC | 31 ms
7,212 KB |
testcase_21 | AC | 25 ms
7,216 KB |
testcase_22 | AC | 14 ms
5,360 KB |
testcase_23 | AC | 48 ms
11,616 KB |
testcase_24 | AC | 46 ms
9,292 KB |
testcase_25 | AC | 66 ms
10,960 KB |
testcase_26 | AC | 72 ms
11,968 KB |
testcase_27 | AC | 47 ms
9,316 KB |
testcase_28 | AC | 66 ms
13,712 KB |
testcase_29 | AC | 67 ms
13,668 KB |
testcase_30 | AC | 65 ms
13,456 KB |
testcase_31 | AC | 68 ms
13,716 KB |
testcase_32 | AC | 65 ms
13,660 KB |
testcase_33 | AC | 65 ms
13,340 KB |
testcase_34 | AC | 66 ms
13,672 KB |
testcase_35 | AC | 64 ms
13,416 KB |
testcase_36 | AC | 63 ms
13,348 KB |
testcase_37 | AC | 64 ms
13,864 KB |
testcase_38 | AC | 64 ms
13,468 KB |
testcase_39 | AC | 65 ms
13,848 KB |
testcase_40 | AC | 64 ms
13,332 KB |
testcase_41 | AC | 64 ms
13,272 KB |
testcase_42 | AC | 67 ms
13,656 KB |
testcase_43 | AC | 66 ms
13,724 KB |
testcase_44 | AC | 67 ms
13,660 KB |
testcase_45 | AC | 67 ms
13,656 KB |
testcase_46 | AC | 67 ms
13,728 KB |
testcase_47 | AC | 156 ms
21,208 KB |
testcase_48 | AC | 167 ms
21,232 KB |
testcase_49 | AC | 164 ms
21,308 KB |
testcase_50 | AC | 98 ms
20,988 KB |
testcase_51 | AC | 158 ms
21,280 KB |
testcase_52 | AC | 110 ms
17,040 KB |
testcase_53 | AC | 111 ms
17,216 KB |
testcase_54 | AC | 111 ms
17,052 KB |
testcase_55 | AC | 110 ms
17,024 KB |
testcase_56 | AC | 108 ms
16,852 KB |
testcase_57 | AC | 96 ms
23,964 KB |
testcase_58 | AC | 96 ms
22,432 KB |
evil_aftercontest.txt | AC | 195 ms
42,368 KB |
ソースコード
#line 1 "main.cpp" #include <bits/stdc++.h> #line 2 "/home/user/Library/utils/macros.hpp" #define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i)) #define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i)) #define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i)) #define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i)) #define ALL(x) std::begin(x), std::end(x) #line 7 "/home/user/Library/graph/dijkstra.hpp" /** * @brief Dijkstra ($O((E + V) \log V)$) */ template <class T = int64_t> std::vector<T> dijkstra(std::vector<std::vector<std::pair<int, T> > > const & g, int root) { std::vector<T> dist(g.size(), std::numeric_limits<T>::max()); std::priority_queue<std::pair<T, int> > que; dist[root] = 0; que.emplace(- dist[root], root); while (not que.empty()) { T dist_x; int x; std::tie(dist_x, x) = que.top(); que.pop(); if (dist[x] < - dist_x) continue; for (auto it : g[x]) { int y; T cost; std::tie(y, cost) = it; if (- dist_x + cost < dist[y]) { dist[y] = - dist_x + cost; que.emplace(dist_x - cost, y); } } } return dist; } #line 4 "main.cpp" using namespace std; int64_t solve(int n, int m, const vector<int64_t>& c, const vector<vector<int> >& s) { vector<vector<pair<int, int64_t> > > g(n + 4 * m); auto even_in = [&](int i) { return n + 4 * i; }; auto even_out = [&](int i) { return n + 4 * i + 1; }; auto odd_in = [&](int i) { return n + 4 * i + 2; }; auto odd_out = [&](int i) { return n + 4 * i + 3; }; REP (i, m) { g[even_in(i)].emplace_back(even_out(i), c[i]); g[even_in(i)].emplace_back(odd_out(i), c[i] + 1); g[odd_in(i)].emplace_back(even_out(i), c[i] + 1); g[odd_in(i)].emplace_back(odd_out(i), c[i] + 1); for (int s_j : s[i]) { g[s_j - 1].emplace_back(s_j % 2 == 0 ? even_in(i) : odd_in(i), s_j / 2); g[s_j % 2 == 0 ? even_out(i) : odd_out(i)].emplace_back(s_j - 1, s_j / 2); } } int64_t ans = dijkstra(g, 0)[n - 1]; return ans == INT64_MAX ? -1 : ans; } // generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator) int main() { int n, m; cin >> n >> m; vector<int64_t> c(m); vector<vector<int> > s(m); REP (i, m) { int k; cin >> k >> c[i]; s[i].resize(k); REP (j, k) { cin >> s[i][j]; } } auto ans = solve(n, m, c, s); cout << ans << endl; return 0; }