結果
問題 | No.1480 Many Complete Graphs |
ユーザー | Aoxiang Cui |
提出日時 | 2021-10-06 23:30:50 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 99 ms / 2,000 ms |
コード長 | 4,204 bytes |
コンパイル時間 | 1,334 ms |
コンパイル使用メモリ | 121,236 KB |
実行使用メモリ | 22,960 KB |
最終ジャッジ日時 | 2023-09-30 08:58:33 |
合計ジャッジ時間 | 9,144 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
10,852 KB |
testcase_01 | AC | 4 ms
10,720 KB |
testcase_02 | AC | 4 ms
10,816 KB |
testcase_03 | AC | 4 ms
10,924 KB |
testcase_04 | AC | 5 ms
10,784 KB |
testcase_05 | AC | 5 ms
10,720 KB |
testcase_06 | AC | 5 ms
10,728 KB |
testcase_07 | AC | 5 ms
10,728 KB |
testcase_08 | AC | 5 ms
10,744 KB |
testcase_09 | AC | 5 ms
10,908 KB |
testcase_10 | AC | 5 ms
10,972 KB |
testcase_11 | AC | 5 ms
10,788 KB |
testcase_12 | AC | 4 ms
10,920 KB |
testcase_13 | AC | 16 ms
15,024 KB |
testcase_14 | AC | 14 ms
13,824 KB |
testcase_15 | AC | 27 ms
15,928 KB |
testcase_16 | AC | 17 ms
13,896 KB |
testcase_17 | AC | 17 ms
13,972 KB |
testcase_18 | AC | 7 ms
11,872 KB |
testcase_19 | AC | 18 ms
14,084 KB |
testcase_20 | AC | 24 ms
15,812 KB |
testcase_21 | AC | 18 ms
15,732 KB |
testcase_22 | AC | 12 ms
13,612 KB |
testcase_23 | AC | 38 ms
22,224 KB |
testcase_24 | AC | 40 ms
21,788 KB |
testcase_25 | AC | 55 ms
22,320 KB |
testcase_26 | AC | 57 ms
22,960 KB |
testcase_27 | AC | 41 ms
21,848 KB |
testcase_28 | AC | 47 ms
20,936 KB |
testcase_29 | AC | 48 ms
20,880 KB |
testcase_30 | AC | 47 ms
20,340 KB |
testcase_31 | AC | 46 ms
20,340 KB |
testcase_32 | AC | 48 ms
20,912 KB |
testcase_33 | AC | 47 ms
20,412 KB |
testcase_34 | AC | 48 ms
20,956 KB |
testcase_35 | AC | 47 ms
20,888 KB |
testcase_36 | AC | 48 ms
20,880 KB |
testcase_37 | AC | 46 ms
20,348 KB |
testcase_38 | AC | 47 ms
20,880 KB |
testcase_39 | AC | 47 ms
20,416 KB |
testcase_40 | AC | 46 ms
20,348 KB |
testcase_41 | AC | 47 ms
20,352 KB |
testcase_42 | AC | 48 ms
20,872 KB |
testcase_43 | AC | 48 ms
20,972 KB |
testcase_44 | AC | 49 ms
20,424 KB |
testcase_45 | AC | 49 ms
21,096 KB |
testcase_46 | AC | 47 ms
20,424 KB |
testcase_47 | AC | 97 ms
21,964 KB |
testcase_48 | AC | 99 ms
21,848 KB |
testcase_49 | AC | 99 ms
21,904 KB |
testcase_50 | AC | 58 ms
21,768 KB |
testcase_51 | AC | 95 ms
21,964 KB |
testcase_52 | AC | 75 ms
21,776 KB |
testcase_53 | AC | 75 ms
21,776 KB |
testcase_54 | AC | 73 ms
22,164 KB |
testcase_55 | AC | 74 ms
21,836 KB |
testcase_56 | AC | 74 ms
22,088 KB |
testcase_57 | AC | 51 ms
22,260 KB |
testcase_58 | AC | 51 ms
22,080 KB |
evil_aftercontest.txt | AC | 98 ms
33,876 KB |
コンパイルメッセージ
main.cpp: 関数 ‘void dijkstra(int, int)’ 内: main.cpp:119:10: 警告: 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: 警告: 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 #endif template <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; }