結果
問題 | No.1480 Many Complete Graphs |
ユーザー | tokusakurai |
提出日時 | 2021-04-16 20:58:45 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 96 ms / 2,000 ms |
コード長 | 2,856 bytes |
コンパイル時間 | 2,232 ms |
コンパイル使用メモリ | 211,820 KB |
実行使用メモリ | 18,980 KB |
最終ジャッジ日時 | 2023-09-16 02:52:20 |
合計ジャッジ時間 | 6,736 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 17 ms
9,424 KB |
testcase_14 | AC | 12 ms
7,532 KB |
testcase_15 | AC | 25 ms
10,688 KB |
testcase_16 | AC | 15 ms
8,876 KB |
testcase_17 | AC | 15 ms
8,040 KB |
testcase_18 | AC | 6 ms
6,216 KB |
testcase_19 | AC | 16 ms
8,100 KB |
testcase_20 | AC | 23 ms
9,408 KB |
testcase_21 | AC | 18 ms
9,644 KB |
testcase_22 | AC | 11 ms
6,740 KB |
testcase_23 | AC | 41 ms
15,708 KB |
testcase_24 | AC | 36 ms
13,912 KB |
testcase_25 | AC | 57 ms
15,480 KB |
testcase_26 | AC | 57 ms
16,348 KB |
testcase_27 | AC | 35 ms
13,960 KB |
testcase_28 | AC | 44 ms
16,588 KB |
testcase_29 | AC | 42 ms
16,516 KB |
testcase_30 | AC | 42 ms
16,100 KB |
testcase_31 | AC | 42 ms
16,060 KB |
testcase_32 | AC | 44 ms
16,576 KB |
testcase_33 | AC | 43 ms
15,972 KB |
testcase_34 | AC | 45 ms
16,632 KB |
testcase_35 | AC | 44 ms
16,104 KB |
testcase_36 | AC | 44 ms
15,976 KB |
testcase_37 | AC | 44 ms
16,076 KB |
testcase_38 | AC | 44 ms
15,956 KB |
testcase_39 | AC | 43 ms
16,076 KB |
testcase_40 | AC | 42 ms
16,096 KB |
testcase_41 | AC | 44 ms
15,980 KB |
testcase_42 | AC | 44 ms
16,772 KB |
testcase_43 | AC | 45 ms
16,588 KB |
testcase_44 | AC | 44 ms
15,972 KB |
testcase_45 | AC | 46 ms
16,808 KB |
testcase_46 | AC | 44 ms
16,064 KB |
testcase_47 | AC | 93 ms
18,732 KB |
testcase_48 | AC | 96 ms
18,856 KB |
testcase_49 | AC | 92 ms
18,680 KB |
testcase_50 | AC | 50 ms
18,284 KB |
testcase_51 | AC | 81 ms
18,980 KB |
testcase_52 | AC | 61 ms
18,496 KB |
testcase_53 | AC | 61 ms
18,332 KB |
testcase_54 | AC | 61 ms
18,436 KB |
testcase_55 | AC | 68 ms
18,404 KB |
testcase_56 | AC | 72 ms
18,372 KB |
testcase_57 | AC | 45 ms
17,752 KB |
testcase_58 | AC | 48 ms
18,132 KB |
evil_aftercontest.txt | AC | 97 ms
34,816 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; template<typename T, bool directed = false> struct Weighted_Graph{ struct edge{ int to; T cost; int id; edge(int to, T cost, int id) : to(to), cost(cost), id(id) {} }; vector<vector<edge>> es; const T INF_T; const int n; int m; vector<T> d; vector<int> pre_v; Weighted_Graph(int n) : es(n), INF_T(numeric_limits<T>::max()/2), n(n), m(0), d(n), pre_v(n) {} void add_edge(int from, int to, T cost){ es[from].emplace_back(to, cost, m); if(!directed) es[to].emplace_back(from, cost, m); m++; } T dijkstra(int s, int t = 0){ fill(begin(d), end(d), INF_T); using P = pair<T, int>; priority_queue<P, vector<P>, greater<P> > que; que.emplace(d[s] = 0, s); while(!que.empty()){ auto [p, i] = que.top(); que.pop(); if(p > d[i]) continue; for(auto &e: es[i]){ if(d[i]+e.cost < d[e.to]){ pre_v[e.to] = i, que.emplace(d[e.to] = d[i]+e.cost, e.to); } } } return d[t]; } vector<int> shortest_path(int s, int t){ if(dijkstra(s, t) == INF_T) return {}; vector<int> ret; for(int now = t; now != s; now = pre_v[now]) ret.push_back(now); ret.push_back(s), reverse(begin(ret), end(ret)); return ret; } }; int main(){ int N, M; cin >> N >> M; Weighted_Graph<ll, true> G(N+M*2); rep(i, M){ int K; ll c; cin >> K >> c; rep(j, K){ int u; cin >> u; if(u%2 == 0) G.add_edge(u-1, N+2*i, c+u/2), G.add_edge(N+2*i, u-1, u/2), G.add_edge(N+2*i+1, u-1, u/2+1); else G.add_edge(u-1, N+2*i+1, c+u/2), G.add_edge(N+2*i, u-1, u/2+1), G.add_edge(N+2*i+1, u-1, u/2+1); } } ll ans = G.dijkstra(0, N-1); cout << (ans >= INF? -1 : ans) << '\n'; }