結果

問題 No.1480 Many Complete Graphs
ユーザー tokusakurai
提出日時 2021-04-16 20:58:45
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 289 ms / 2,000 ms
コード長 2,856 bytes
コンパイル時間 3,420 ms
コンパイル使用メモリ 205,812 KB
最終ジャッジ日時 2025-01-20 19:10:40
ジャッジサーバーID
(参考情報)
judge1 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 57
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#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';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0