#649054 (C++17) No.1480 Many Complete Graphs

提出ソース

結果

問題	No.1480 Many Complete Graphs
ユーザー	opt
提出日時	2021-04-16 23:40:59
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	134 ms / 2,000 ms
コード長	5,766 bytes
コンパイル時間	4,792 ms
コンパイル使用メモリ	275,788 KB
実行使用メモリ	21,176 KB
最終ジャッジ日時	2023-09-16 03:24:11
合計ジャッジ時間	9,927 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,376 KB
testcase_01	AC	1 ms 4,376 KB
testcase_02	AC	1 ms 4,376 KB
testcase_03	AC	2 ms 4,380 KB
testcase_04	AC	2 ms 4,380 KB
testcase_05	AC	2 ms 4,376 KB
testcase_06	AC	1 ms 4,376 KB
testcase_07	AC	2 ms 4,380 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,380 KB
testcase_12	AC	2 ms 4,380 KB
testcase_13	AC	15 ms 8,428 KB
testcase_14	AC	10 ms 5,972 KB
testcase_15	AC	27 ms 8,604 KB
testcase_16	AC	15 ms 7,776 KB
testcase_17	AC	16 ms 7,580 KB
testcase_18	AC	6 ms 7,572 KB
testcase_19	AC	16 ms 6,844 KB
testcase_20	AC	23 ms 6,952 KB
testcase_21	AC	17 ms 7,240 KB
testcase_22	AC	10 ms 5,352 KB
testcase_23	AC	32 ms 11,532 KB
testcase_24	AC	32 ms 8,728 KB
testcase_25	AC	51 ms 11,564 KB
testcase_26	AC	60 ms 12,344 KB
testcase_27	AC	34 ms 8,712 KB
testcase_28	AC	54 ms 14,484 KB
testcase_29	AC	56 ms 14,400 KB
testcase_30	AC	52 ms 14,560 KB
testcase_31	AC	51 ms 13,964 KB
testcase_32	AC	53 ms 14,676 KB
testcase_33	AC	51 ms 12,928 KB
testcase_34	AC	53 ms 14,284 KB
testcase_35	AC	49 ms 13,232 KB
testcase_36	AC	49 ms 13,224 KB
testcase_37	AC	50 ms 14,720 KB
testcase_38	AC	49 ms 13,336 KB
testcase_39	AC	49 ms 13,712 KB
testcase_40	AC	50 ms 14,372 KB
testcase_41	AC	50 ms 13,600 KB
testcase_42	AC	52 ms 15,104 KB
testcase_43	AC	51 ms 14,696 KB
testcase_44	AC	52 ms 13,572 KB
testcase_45	AC	54 ms 14,460 KB
testcase_46	AC	52 ms 14,912 KB
testcase_47	AC	130 ms 20,152 KB
testcase_48	AC	126 ms 20,532 KB
testcase_49	AC	129 ms 20,168 KB
testcase_50	AC	64 ms 19,764 KB
testcase_51	AC	134 ms 20,196 KB
testcase_52	AC	92 ms 16,564 KB
testcase_53	AC	92 ms 16,596 KB
testcase_54	AC	90 ms 16,596 KB
testcase_55	AC	90 ms 16,560 KB
testcase_56	AC	92 ms 16,536 KB
testcase_57	AC	66 ms 21,176 KB
testcase_58	AC	84 ms 21,108 KB
evil_aftercontest.txt	AC	178 ms 40,440 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

yukicoder

結果

テストケース

ソースコード