結果
問題 | No.1480 Many Complete Graphs |
ユーザー |
![]() |
提出日時 | 2021-04-16 21:15:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 81 ms / 2,000 ms |
コード長 | 6,186 bytes |
コンパイル時間 | 2,189 ms |
コンパイル使用メモリ | 203,216 KB |
最終ジャッジ日時 | 2025-01-20 19:23:30 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 57 |
ソースコード
#define LOCAL#include <bits/stdc++.h>using namespace std;#pragma region Macrostypedef long long ll;typedef __int128_t i128;typedef unsigned int uint;typedef unsigned long long ull;#define ALL(x) (x).begin(), (x).end()template <typename T> istream& operator>>(istream& is, vector<T>& v) {for (T& x : v) is >> x;return is;}template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {for (int i = 0; i < (int)v.size(); i++) {os << v[i] << (i + 1 == (int)v.size() ? "" : " ");}return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';return os;}template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {os << '{';for (auto itr = m.begin(); itr != m.end();) {os << '(' << itr->first << ',' << itr->second << ')';if (++itr != m.end()) os << ',';}os << '}';return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {os << '{';for (auto itr = m.begin(); itr != m.end();) {os << '(' << itr->first << ',' << itr->second << ')';if (++itr != m.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {for (int i = 0; i < (int)v.size(); i++) {os << v[i] << (i + 1 == (int)v.size() ? "" : " ");}return os;}void debug_out() { cerr << '\n'; }template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {cerr << head;if (sizeof...(Tail) > 0) cerr << ", ";debug_out(move(tail)...);}#ifdef LOCAL#define debug(...) \cerr << " "; \cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \cerr << " "; \debug_out(__VA_ARGS__)#else#define debug(...) 42#endiftemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }template <class T1, class T2> inline bool chmin(T1& a, T2 b) {if (a > b) {a = b;return true;}return false;}template <class T1, class T2> inline bool chmax(T1& a, T2 b) {if (a < b) {a = b;return true;}return false;}#pragma endregion/*** @brief Dijkstra* @docs docs/graph/Dijkstra.md*/template <typename T> struct Dijkstra {struct edge {int to;T cost;edge(int to, T cost) : to(to), cost(cost) {}bool operator<(const edge& e) const { return cost > e.cost; }};vector<vector<edge>> G;vector<T> dp;vector<int> pre;Dijkstra(int n) : G(n), dp(n), pre(n) {}void add_edge(int u, int v, T c) { G[u].emplace_back(v, c); }void build(int s) {int n = G.size();fill(dp.begin(), dp.end(), numeric_limits<T>::max());fill(pre.begin(), pre.end(), -1);priority_queue<edge> pq;dp[s] = 0;pq.emplace(s, dp[s]);while (!pq.empty()) {auto p = pq.top();pq.pop();int v = p.to;if (dp[v] < p.cost) continue;for (auto e : G[v]) {if (dp[v] + e.cost < dp[e.to]) {dp[e.to] = dp[v] + e.cost;pre[e.to] = v;pq.emplace(e.to, dp[e.to]);}}}}vector<int> restore(int t) {vector<int> res;if (pre[t] < 0) return res;while (~t) {res.emplace_back(t);t = pre[t];}reverse(res.begin(), res.end());return res;}T operator[](int to) { return dp[to]; }};const int INF = 1e9;const long long IINF = 1e18;const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};const char dir[4] = {'D', 'R', 'U', 'L'};const long long MOD = 1000000007;// const long long MOD = 998244353;int main() {cin.tie(0);ios::sync_with_stdio(false);int N, M;cin >> N >> M;Dijkstra<ll> D(N + 2 * M);for (int i = 0; i < M; i++) {int k, c;cin >> k >> c;int even = N + i * 2 + 0, odd = N + i * 2 + 1;for (; k--;) {int s;cin >> s;if (!(s & 1)) {D.add_edge(s - 1, even, s / 2 + c);D.add_edge(even, s - 1, s / 2);D.add_edge(odd, s - 1, s / 2 + 1);} else {D.add_edge(s - 1, odd, s / 2 + c);D.add_edge(even, s - 1, (s + 1) / 2);D.add_edge(odd, s - 1, (s + 1) / 2);}}}D.build(0);ll ans = D[N - 1];cout << (ans >= IINF ? -1 : ans) << '\n';return 0;}