結果
問題 | No.1480 Many Complete Graphs |
ユーザー |
|
提出日時 | 2021-04-16 22:49:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 138 ms / 2,000 ms |
コード長 | 2,567 bytes |
コンパイル時間 | 4,750 ms |
コンパイル使用メモリ | 210,296 KB |
最終ジャッジ日時 | 2025-01-20 20:27:20 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 57 |
ソースコード
#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;}