結果

問題 No.1480 Many Complete Graphs
ユーザー akuaakua
提出日時 2022-11-14 08:29:50
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 190 ms / 2,000 ms
コード長 7,670 bytes
コンパイル時間 2,023 ms
コンパイル使用メモリ 149,320 KB
実行使用メモリ 64,896 KB
最終ジャッジ日時 2024-09-15 11:31:19
合計ジャッジ時間 10,331 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
34,560 KB
testcase_01 AC 31 ms
34,432 KB
testcase_02 AC 32 ms
34,432 KB
testcase_03 AC 33 ms
34,432 KB
testcase_04 AC 31 ms
34,560 KB
testcase_05 AC 32 ms
34,472 KB
testcase_06 AC 32 ms
34,420 KB
testcase_07 AC 32 ms
34,536 KB
testcase_08 AC 33 ms
34,552 KB
testcase_09 AC 33 ms
34,688 KB
testcase_10 AC 32 ms
34,788 KB
testcase_11 AC 32 ms
34,424 KB
testcase_12 AC 32 ms
34,480 KB
testcase_13 AC 46 ms
40,448 KB
testcase_14 AC 43 ms
38,528 KB
testcase_15 AC 56 ms
41,600 KB
testcase_16 AC 46 ms
39,608 KB
testcase_17 AC 47 ms
39,144 KB
testcase_18 AC 35 ms
37,352 KB
testcase_19 AC 47 ms
39,168 KB
testcase_20 AC 55 ms
40,320 KB
testcase_21 AC 51 ms
40,684 KB
testcase_22 AC 41 ms
37,760 KB
testcase_23 AC 67 ms
46,336 KB
testcase_24 AC 68 ms
44,640 KB
testcase_25 AC 84 ms
45,916 KB
testcase_26 AC 89 ms
46,712 KB
testcase_27 AC 70 ms
44,800 KB
testcase_28 AC 87 ms
48,500 KB
testcase_29 AC 90 ms
48,616 KB
testcase_30 AC 86 ms
48,624 KB
testcase_31 AC 87 ms
48,496 KB
testcase_32 AC 86 ms
48,620 KB
testcase_33 AC 85 ms
48,624 KB
testcase_34 AC 87 ms
48,760 KB
testcase_35 AC 85 ms
48,624 KB
testcase_36 AC 85 ms
48,624 KB
testcase_37 AC 85 ms
48,628 KB
testcase_38 AC 85 ms
48,620 KB
testcase_39 AC 84 ms
48,628 KB
testcase_40 AC 85 ms
48,632 KB
testcase_41 AC 85 ms
48,628 KB
testcase_42 AC 85 ms
48,628 KB
testcase_43 AC 87 ms
48,624 KB
testcase_44 AC 87 ms
48,620 KB
testcase_45 AC 86 ms
48,624 KB
testcase_46 AC 86 ms
48,756 KB
testcase_47 AC 190 ms
60,268 KB
testcase_48 AC 188 ms
60,160 KB
testcase_49 AC 187 ms
60,160 KB
testcase_50 AC 103 ms
59,564 KB
testcase_51 AC 187 ms
60,160 KB
testcase_52 AC 142 ms
53,488 KB
testcase_53 AC 153 ms
53,492 KB
testcase_54 AC 140 ms
53,624 KB
testcase_55 AC 139 ms
53,464 KB
testcase_56 AC 138 ms
53,508 KB
testcase_57 AC 111 ms
64,896 KB
testcase_58 AC 131 ms
61,308 KB
evil_aftercontest.txt AC 254 ms
88,312 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#include <atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
using namespace std;  
//using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;  
using graph = vector<vector<int> > ;
using P= pair<ll,ll>;  
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>; 
using vvll=vector<vll>;
using vp=vector<P>;
using vpp=vector<vp>;
using vd=vector<double>;
using vvd =vector<vd>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++17 -I .  
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);
const double PI = acos(-1);
 
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
 
ll pow_pow(ll x,ll n,ll mod){
    if(n==0) return 1; 
    x%=mod;
    ll res=pow_pow(x*x%mod,n/2,mod);
    if(n&1)res=res*x%mod;
    return res;
}
 struct UnionFind { vector<int> par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x;
        else return par[x] = root(par[x]);
    }
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false; 
        if (siz[x] < siz[y]) swap(x, y);
        par[y] = x;
        siz[x] += siz[y];
        return true;
    }
    int size(int x) {
        return siz[root(x)];
    }
};
 
ll gcd(ll x,ll y){
    if(y==0)return x;
    return gcd(y,x%y);
}
 
ll lcm(ll x,ll y){
    return ll(x/gcd(x,y))*y;
}
template<class T> bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}
template<class T> bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else return false;
}
 
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const ll mod =998244353;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    //assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
  mint p(int n, int k) {
    return fact[n]*ifact[n-k];
  }
} c(2000005);
using vm=vector<mint> ;
using vvm=vector<vm> ;
 
 
ll sqrt_(ll x) {
  ll l = 0, r = ll(3e9)+1;
  while (l+1<r) {
    ll c = (l+r)/2;
    if (c*c <= x) l = c; else r = c;
  }
  return l;
}
 
 
int valid(int x,int y,int h,int w){
  if(x>=0 && y>=0 && x<h && y<w)return 1;
  else return 0;
}
 
 
 
 
ll comb[301][301];
 
void init_comb(int M){
  comb[0][0]=1;
  for(int i=1; i<=300; i++){
    for(int j=0; j<=i; j++){
      if(j==0 || j==i)comb[i][j]=1;
      else comb[i][j]=(comb[i-1][j]+comb[i-1][j-1])%M;
    }
  }
}
 
ll nCk(int n,int k){
  return comb[n][k];
}
 
struct edge{
  int to; ll cost;
  edge(int to,ll cost) : to(to),cost(cost) {}
};
 
//snuke
template<typename T>
struct Matrix {
  int h, w;
  vector<vector<T> > d;
  Matrix() {}
  Matrix(int h, int w, T val=0): h(h), w(w), d(h, vector<T>(w,val)) {}
  Matrix& unit() {
    //assert(h == w);
    rep(i,h) d[i][i] = 1;
    return *this;
  }
  const vector<T>& operator[](int i) const { return d[i];}
  vector<T>& operator[](int i) { return d[i];}
  Matrix operator*(const Matrix& a) const {
    //assert(w == a.h);
    Matrix r(h, a.w);
    rep(i,h)rep(k,w)rep(j,a.w) {
      r[i][j] += d[i][k]*a[k][j];
    }
    return r;
  }
  Matrix pow(ll t) const {
  //  assert(h == w);
    if (!t) return Matrix(h,h).unit();
    if (t == 1) return *this;
    Matrix r = pow(t>>1);
    r = r*r;
    if (t&1) r = r*(*this);
    return r;
  }
};
//g++ main.cpp -std=c++17 -I .


map<ll,ll>d;
void comp(vector<int>&a){
  set<int>s(a.begin(),a.end());
  int cnt=0;
  for(auto y:s)d[y]=cnt++;
  for(auto&y:a)y=d[y];
}   
int main(){cin.tie(0);ios::sync_with_stdio(false);
  int n,m; cin >> n >> m;
  int n2=n+m*8;
  vector<vector<edge> > g(n2);
  int now=n;
  rep(i,m){
    int k; cin >> k;
    int w; cin >> w;
    vi vs(k);
    rep(j,k)cin >> vs[j],vs[j]--;
    g[now].push_back(edge(now+1,w+1));
   // g[now+1].push_back(edge(now,w+1));
    g[now+2].push_back(edge(now+3,w));
   // g[now+3].push_back(edge(now+2,w));
    g[now+4].push_back(edge(now+5,w+1));
   // g[now+5].push_back(edge(now+4,w+1));
    g[now+7].push_back(edge(now+6,w+1));
    rep(j,k){
      if(vs[j]%2==0){
        int cost=(vs[j]+1)/2;
        g[vs[j]].push_back(edge(now,cost));
      //  g[now].push_back(edge(vs[j],cost));
      //  g[vs[j]].push_back(edge(now+1,cost));
        g[now+1].push_back(edge(vs[j],cost));
        g[vs[j]].push_back(edge(now+4,cost));
     //   g[now+4].push_back(edge(vs[j],cost));
        g[now+6].push_back(edge(vs[j],cost));
      }
      else {
        int cost=(vs[j]+1)/2;
        g[vs[j]].push_back(edge(now+2,cost));
     //   g[now+2].push_back(edge(vs[j],cost));
     //   g[vs[j]].push_back(edge(now+3,cost));
        g[now+3].push_back(edge(vs[j],cost));
       // g[vs[j]].push_back(edge(now+5,cost));
        g[now+5].push_back(edge(vs[j],cost));
        g[vs[j]].push_back(edge(now+7,cost));
      }
    }
    now+=8;
  }
  vll dist(n2,inf);
  int s = 0;
  priority_queue<P, vector<P>, greater<P> > q;
  dist[s] = 0;
  q.push(P(dist[s], s));
  while (!q.empty()){
    int v = q.top().second;
    ll d = q.top().first;
    q.pop();
    if(dist[v] < d)continue;
    for (auto u : g[v]){
      if (chmin(dist[u.to], dist[v] + u.cost)){
        q.push(P(dist[u.to], u.to));
      }
    }
  } 
  ll ans=dist[n-1];
  if(ans==inf)ans=-1;
  cout << ans << endl;
}
0