結果
問題 | No.1480 Many Complete Graphs |
ユーザー | opt |
提出日時 | 2021-04-16 23:40:59 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 148 ms / 2,000 ms |
コード長 | 5,766 bytes |
コンパイル時間 | 5,153 ms |
コンパイル使用メモリ | 277,244 KB |
実行使用メモリ | 21,236 KB |
最終ジャッジ日時 | 2024-07-03 04:42:55 |
合計ジャッジ時間 | 10,307 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 3 ms
5,376 KB |
testcase_10 | AC | 3 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 19 ms
7,656 KB |
testcase_14 | AC | 13 ms
6,064 KB |
testcase_15 | AC | 33 ms
8,484 KB |
testcase_16 | AC | 21 ms
7,364 KB |
testcase_17 | AC | 20 ms
6,728 KB |
testcase_18 | AC | 7 ms
6,656 KB |
testcase_19 | AC | 19 ms
6,672 KB |
testcase_20 | AC | 27 ms
7,132 KB |
testcase_21 | AC | 20 ms
7,192 KB |
testcase_22 | AC | 11 ms
5,492 KB |
testcase_23 | AC | 38 ms
11,112 KB |
testcase_24 | AC | 37 ms
8,764 KB |
testcase_25 | AC | 58 ms
10,884 KB |
testcase_26 | AC | 67 ms
11,892 KB |
testcase_27 | AC | 40 ms
9,088 KB |
testcase_28 | AC | 60 ms
13,916 KB |
testcase_29 | AC | 61 ms
14,172 KB |
testcase_30 | AC | 59 ms
13,276 KB |
testcase_31 | AC | 61 ms
13,868 KB |
testcase_32 | AC | 62 ms
14,172 KB |
testcase_33 | AC | 57 ms
13,276 KB |
testcase_34 | AC | 59 ms
14,176 KB |
testcase_35 | AC | 61 ms
13,148 KB |
testcase_36 | AC | 57 ms
13,404 KB |
testcase_37 | AC | 57 ms
13,916 KB |
testcase_38 | AC | 57 ms
13,276 KB |
testcase_39 | AC | 58 ms
13,912 KB |
testcase_40 | AC | 55 ms
13,408 KB |
testcase_41 | AC | 57 ms
13,280 KB |
testcase_42 | AC | 61 ms
14,168 KB |
testcase_43 | AC | 57 ms
14,044 KB |
testcase_44 | AC | 58 ms
13,792 KB |
testcase_45 | AC | 59 ms
14,044 KB |
testcase_46 | AC | 57 ms
13,660 KB |
testcase_47 | AC | 140 ms
19,308 KB |
testcase_48 | AC | 138 ms
19,196 KB |
testcase_49 | AC | 148 ms
19,320 KB |
testcase_50 | AC | 67 ms
18,820 KB |
testcase_51 | AC | 146 ms
19,304 KB |
testcase_52 | AC | 106 ms
16,608 KB |
testcase_53 | AC | 109 ms
16,576 KB |
testcase_54 | AC | 118 ms
16,476 KB |
testcase_55 | AC | 107 ms
16,584 KB |
testcase_56 | AC | 108 ms
16,616 KB |
testcase_57 | AC | 71 ms
21,236 KB |
testcase_58 | AC | 95 ms
20,404 KB |
evil_aftercontest.txt | AC | 203 ms
37,500 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #include <atcoder/all> using namespace atcoder; // input and output of modint istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); } istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } template<int m> istream &operator>>(istream &is, static_modint<m> &a) { long long v; is >> v; a = v; return is; } template<int m> ostream &operator<<(ostream &os, const static_modint<m> &a) { return os << a.val(); } template<int m> istream &operator>>(istream &is, dynamic_modint<m> &a) { long long v; is >> v; a = v; return is; } template<int m> ostream &operator<<(ostream &os, const dynamic_modint<m> &a) { return os << a.val(); } #define rep_(i, a_, b_, a, b, ...) for (int i = (a), lim##i = (b); i < lim##i; ++i) #define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define drep_(i, a_, b_, a, b, ...) for (int i = (a)-1, lim##i = (b); i >= lim##i; --i) #define drep(i, ...) drep_(i, __VA_ARGS__, __VA_ARGS__, __VA_ARGS__, 0) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #ifdef LOCAL void debug_out() { cerr << endl; } template <class Head, class... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); } #define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif template<class T> using V = vector<T>; using ll = long long; using ld = long double; using Vi = V<int>; using VVi = V<Vi>; using Vl = V<ll>; using VVl = V<Vl>; using Vd = V<ld>; using VVd = V<Vd>; using Vb = V<bool>; using VVb = V<Vb>; template<class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>; template<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); } template<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); } template<class T> inline int sz(const T &x) { return x.size(); } template<class T> inline bool chmin(T &a, const T b) { if (a > b) { a = b; return true; } return false; } template<class T> inline bool chmax(T &a, const T b) { if (a < b) { a = b; return true; } return false; } template<class T1, class T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template<class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; } template<class T, size_t n> istream &operator>>(istream &is, array<T, n> &v) { for (auto &e : v) is >> e; return is; } template<class T, size_t n> ostream &operator<<(ostream &os, const array<T, n> &v) { for (auto &e : v) os << e << ' '; return os; } template<class T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; } template<class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; } template<class T> inline void deduplicate(vector<T> &a) { sort(all(a)); a.erase(unique(all(a)), a.end()); } template<class T> inline int count_between(const vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r) inline ll ceil_div(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y) inline int floor_log2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x)) inline int ceil_log2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x)) inline int popcount(const ll x) { return __builtin_popcountll(x); } inline void fail() { cout << -1 << '\n'; exit(0); } struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; // const int INF = (1<<30) - 1; const ll INFll = (1ll<<60) - 1; // const ld EPS = 1e-10; // const ld PI = acos(-1.0); // using mint = modint998244353; // using mint = modint1000000007; // using mint = modint; // using Vm = V<mint>; using VVm = V<Vm>; template<typename T> struct edge { int v; T w; edge(int v, T w) : v(v), w(w) {} }; template<typename T> using Graph = vector<vector<edge<T>>>; template<typename T> vector<T> dijkstra(const Graph<T> &G, int s) { int n = G.size(); const auto INF_T = numeric_limits<T>::max() / 2 - 1; vector<T> dist(n, INF_T); using PTi = pair<T, int>; priority_queue<PTi, vector<PTi>, function<bool(PTi, PTi)>> pq( [] (auto x, auto y) { return x.first > y.first; } ); dist[s] = 0; pq.emplace(dist[s], s); while (!pq.empty()) { auto [d, u] = pq.top(); pq.pop(); if (dist[u] < d) continue; for (auto &[v, w] : G[u]) if (chmin(dist[v], d + w)) pq.emplace(dist[v], v); } return dist; } ll solve() { int n, m; cin >> n >> m; Graph<ll> G(n); int N = n; rep(_, m) { int k, c; cin >> k >> c; auto id = make_vec(2, 0, 0); rep(i, k) { int s; cin >> s; --s; id[s&1].push_back(s); } G.resize(N+4); for (auto u : id[0]) { G[u].emplace_back(N, u/2); G[N+2].emplace_back(u, u/2); } for (auto u : id[1]) { G[u].emplace_back(N+1, u/2); G[N+3].emplace_back(u, u/2); } rep(i, 2) rep(j, 2) { int w = c+1; if (i + j) ++w; G[N+i].emplace_back(N+2+j, w); } N += 4; } auto dist = dijkstra(G, 0); ll ans = dist[n-1]; if (ans > INFll) ans = -1; return ans; } int main() { cout << solve() << '\n'; }