結果
問題 | No.1480 Many Complete Graphs |
ユーザー |
|
提出日時 | 2021-10-06 23:30:50 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 99 ms / 2,000 ms |
コード長 | 4,204 bytes |
コンパイル時間 | 1,299 ms |
コンパイル使用メモリ | 122,348 KB |
実行使用メモリ | 22,804 KB |
最終ジャッジ日時 | 2024-07-23 03:02:36 |
合計ジャッジ時間 | 6,711 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 57 |
コンパイルメッセージ
main.cpp: In function 'void dijkstra(int, int)': main.cpp:119:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 119 | auto [dd, u] = Q.top(); | ^ main.cpp:122:16: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 122 | for (auto& [v, w] : a[u]) { | ^
ソースコード
#define LOCAL#define _USE_MATH_DEFINES#include <array>#include <cassert>#include <cstdio>#include <cstring>#include <iostream>#include <iomanip>#include <string>#include <sstream>#include <vector>#include <queue>#include <stack>#include <list>#include <set>#include <map>#include <unordered_set>#include <unordered_map>#include <algorithm>#include <complex>#include <cmath>#include <numeric>#include <bitset>#include <functional>#include <random>#include <ctime>using namespace std;template <typename A, typename B>ostream& operator <<(ostream& out, const pair<A, B>& a) {out << "(" << a.first << "," << a.second << ")";return out;}template <typename T, size_t N>ostream& operator <<(ostream& out, const array<T, N>& a) {out << "["; bool first = true;for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";return out;}template <typename T>ostream& operator <<(ostream& out, const vector<T>& a) {out << "["; bool first = true;for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";return out;}template <typename T, class Cmp>ostream& operator <<(ostream& out, const set<T, Cmp>& a) {out << "{"; bool first = true;for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";return out;}template <typename U, typename T, class Cmp>ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {out << "{"; bool first = true;for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";return out;}#ifdef LOCAL#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)#else#define trace(...) 42#endiftemplate <typename Arg1>void __f(const char* name, Arg1&& arg1){cerr << name << ": " << arg1 << endl;}template <typename Arg1, typename... Args>void __f(const char* names, Arg1&& arg1, Args&&... args){const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << ": " << arg1 << " |";__f(comma + 1, args...);}template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }template <class T, class... D> auto vect(const T& v, int n, D... m) {return vector<decltype(vect(v, m...))>(n, vect(v, m...));}typedef long long int64;typedef pair<int64, int64> ii;#define SZ(x) (int)((x).size())template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;const int MOD = 1e9 + 7;// const int MOD = 998244353;mt19937 mrand(random_device{}());int rnd(int x) { return mrand() % x; }// mt19937_64 mrand(random_device{}());// int64 rnd(int64 x) { return mrand() % x; }template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }void add(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }struct fast_ios {fast_ios() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);};} fast_ios_;const int N = 3e5 + 10;vector<ii> a[N];int64 d[N];void add_edge(int x, int y, int z) {a[x].push_back({y, z});a[y].push_back({x, z});}void dijkstra(int s, int n) {fill(d, d + n, inf<int64>);d[s] = 0;priority_queue<ii, vector<ii>, greater<ii>> Q;Q.push({d[s], s});while (!Q.empty()) {auto [dd, u] = Q.top();Q.pop();if (dd != d[u]) continue;for (auto& [v, w] : a[u]) {if (d[v] > d[u] + w) {d[v] = d[u] + w;Q.push({d[v], v});}}}}int main() {int n, m;cin >> n >> m;for (int i = 0; i < m; ++i) {int len, cost;cin >> len >> cost;vector<int> c(len);for (int j = 0; j < len; ++j) {int x;cin >> x;--x;add_edge(x, n + i * 2 + x % 2, cost + x + 1);add_edge(n + i * 2, n + i * 2 + 1, 1);}}dijkstra(0, n + m * 2);int64 ret = d[n - 1];if (ret == inf<int64>) ret = -2;cout << ret / 2 << '\n';return 0;}