#1147225 (C++23) No.3 ビットすごろく

提出ソース
結果

問題	No.3 ビットすごろく
コンテスト
ユーザー	zeta
提出日時	2026-02-07 18:36:11
言語	C++23 (gcc 15.2.0 + boost 1.89.0)
結果	AC
実行時間	29 ms / 5,000 ms
コード長	17,725 bytes
記録記録タグの例: 初AC ショートコード純ショートコード純主流ショートコード最速実行時間
コンパイル時間	4,979 ms
コンパイル使用メモリ	284,424 KB
実行使用メモリ	7,848 KB
最終ジャッジ日時	2026-02-07 18:36:18
合計ジャッジ時間	6,159 ms
ジャッジサーバーID （参考情報）	judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
other	AC * 33
権限があれば一括ダウンロードができます
ソースコード

raw source code
#line 1 "No_3_\u30d3\u30c3\u30c8\u3059\u3054\u308d\u304f.cpp"
#define YRSD
#line 2 "YRS/all.hpp"

#line 2 "YRS/aa/head.hpp"

#include <iostream>
#include <algorithm>

#include <array>
#include <bitset>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>

#include <bit>
#include <chrono>
#include <functional>
#include <iomanip>
#include <utility>
#include <type_traits>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <limits>
#include <ranges>
#include <concepts>

#define TE template <typename T>
#define TES template <typename T, typename ...S>
#define Z auto
#define ep emplace_back
#define eb emplace
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()

#define OV4(a, b, c, d, e, ...) e
#define FOR1(a) for (int _ = 0; _ < (a); ++_)
#define FOR2(i, a) for (int i = 0; i < (a); ++i)
#define FOR3(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (int i = (a); i < (b); i += (c))
#define FOR(...) OV4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR1_R(a) for (int _ = (a) - 1; _ >= 0; --_)
#define FOR2_R(i, a) for (int i = (a) - 1; i >= 0; --i)
#define FOR3_R(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define FOR4_R(i, a, b, c) for (int i = (b) - 1; i >= (a); i -= (c))
#define FOR_R(...) OV4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) for (int t = (s); t > -1; t = (t == 0 ? -1 : (t - 1) & s))

#define sort ranges::sort

using namespace std;

TE using vc = vector<T>;
TE using vvc = vc<vc<T>>;
TE using T1 = tuple<T>;
TE using T2 = tuple<T, T>;
TE using T3 = tuple<T, T, T>;
TE using T4 = tuple<T, T, T, T>;
TE using max_heap = priority_queue<T>;
TE using min_heap = priority_queue<T, vc<T>, greater<T>>;
using u8 = unsigned char; using uint = unsigned int; using ll = long long;      using ull = unsigned long long;
using ld = long double;   using i128 = __int128;     using u128 = __uint128_t;  using f128 = __float128;
using u16 = uint16_t;
using PII = pair<int, int>;   using PLL = pair<ll, ll>;

#ifdef YRSD
constexpr bool dbg = 1;
#else
constexpr bool dbg = 0;
#endif
#line 2 "YRS/IO/IO.hpp"

istream &operator>>(istream &I, i128 &x) {
  static string s;
  I >> s;
  int f = s[0] == '-';
  x = 0;
  const int N = (int)s.size();
  FOR(i, f, N) x = x * 10 + s[i] - '0';
  if (f) x = -x;
  return I;
}
ostream &operator<<(ostream &O, i128 x) {
  static string s;
  s.clear();
  bool f = x < 0;
  if (f) x = -x;
  while (x) s += '0' + x % 10, x /= 10;
  if (s.empty()) s += '0';
  if (f) s += '-';
  reverse(all(s));
  return O << s;
}
istream &operator>>(istream &I, f128 &x) {
  static string s;
  I >> s, x = stold(s);
  return I;
}
ostream &operator<<(ostream &O, const f128 x) { return O << ld(x); }
template <typename ...S> istream &operator>>(istream &I, tuple<S...> &t) {
  return apply([&I](Z &...args) { ((I >> args), ...); }, t), I;
}
template <typename T, typename U>
istream &operator>>(istream &I, pair<T, U> &x) {
  return I >> x.fi >> x.se;
}
template <typename T, typename U>
ostream &operator<<(ostream &O, const pair<T, U> &x) {
  return O << x.fi << ' ' << x.se;
}
template <typename T>
requires requires(T &c) { begin(c); end(c); } and 
                          (not is_same_v<decay_t<T>, string>)
istream &operator>>(istream &I, T &c) {
  for (Z &e : c) I >> e;
  return I;
}
template <typename T>requires requires(const T &c) { begin(c); end(c); } and 
  (not is_same_v<decay_t<T>, const char*>) and 
  (not is_same_v<decay_t<T>, string>) and 
  (not is_array_v<remove_reference_t<T>> or 
   not is_same_v<remove_extent_t<remove_reference_t<T>>, char>)
ostream &operator<<(ostream &O, const T &a) {
  if (a.empty()) return O;
  Z i = a.begin();
  O << *i++;
  for (; i != a.end(); ++i) O << ' ' << *i;
  return O;
}
void IN() {}
TE void IN(T &x, Z &...s) { cin >> x, IN(s...); }
void print() { cout << '\n'; }
TES void print(T &&x, S &&...y) {
  cout << x;
  if constexpr (sizeof...(S)) cout << ' ';
  print(forward<S>(y)...);
}
void put() { cout << ' '; }
TES void put(T &&x, S &&...y) {
  cout << x;
  if constexpr (sizeof...(S)) cout << ' ';
  put(forward<S>(y)...);
}

#define INT(...)  int    __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...)   ll     __VA_ARGS__; IN(__VA_ARGS__)
#define ULL(...)  ull    __VA_ARGS__; IN(__VA_ARGS__)
#define I128(...) i128   __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...)  string __VA_ARGS__; IN(__VA_ARGS__)
#define CH(...)   char   __VA_ARGS__; IN(__VA_ARGS__)
#define REAL(...) re     __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(T, a, n) vc<T> a(n); IN(a)
#define VVEC(T, a, n, m) vvc<T> a(n, vc<T>(m)); IN(a)

void YES(bool o = 1) { print(o ? "YES" : "NO"); }
void Yes(bool o = 1) { print(o ? "Yes" : "No"); }
void yes(bool o = 1) { print(o ? "yes" : "no"); }
void NO(bool o = 1) { YES(not o); }
void No(bool o = 1) { Yes(not o); }
void no(bool o = 1) { yes(not o); }
void ALICE(bool o = 1) { print(o ? "ALICE" : "BOB"); }
void Alice(bool o = 1) { print(o ? "Alice" : "Bob"); }
void alice(bool o = 1) { print(o ? "alice" : "bob"); }
void BOB(bool o = 1) { ALICE(not o); }
void Bob(bool o = 1) { Alice(not o); }
void bob(bool o = 1) { alice(not o); }
void POSSIBLE(bool o = 1) { print(o ? "POSSIBLE" : "IMPOSSIBLE"); }
void Possible(bool o = 1) { print(o ? "Possible" : "Impossible"); }
void possible(bool o = 1) { print(o ? "possible" : "impossible"); }
void IMPOSSIBLE(bool o = 1) { POSSIBLE(not o); }
void Impossible(bool o = 1) { Possible(not o); }
void impossible(bool o = 1) { possible(not o); }
void TAK(bool o = 1) { print(o ? "TAK" : "NIE"); }
void NIE(bool o = 1) { TAK(not o); }
#line 5 "YRS/all.hpp"

#if (__cplusplus >= 202002L)
#include <numbers>
constexpr ld pi = numbers::pi;
#endif
TE constexpr T inf = numeric_limits<T>::max();
template <> constexpr i128 inf<i128> = i128(numeric_limits<ll>::max()) * 2'000'000'000'000'000'000;
template <typename T, typename U>
constexpr pair<T, U> inf<pair<T, U>> = {inf<T>, inf<U>};

TE constexpr static inline int pc(T x) { return popcount(make_unsigned_t<T>(x)); }
constexpr static inline ll len(const Z &a) { return a.size(); }

void reverse(Z &a) { reverse(all(a)); }

void unique(Z &a) {
  sort(a);
  a.erase(unique(all(a)), a.end());
}
TE vc<int> inverse(const vc<T> &a) {
  int N = len(a);
  vc<int> b(N, -1);
  FOR(i, N) if (a[i] != -1) b[a[i]] = i;
  return b;
}

Z QMAX(const Z &a) { return *max_element(all(a)); }
Z QMIN(const Z &a) { return *min_element(all(a)); }
constexpr bool chmax(Z &a, const Z &b) { return (a < b ? a = b, true : false); }
constexpr bool chmin(Z &a, const Z &b) { return (a > b ? a = b, true : false); }

template <typename T, typename U>
constexpr static pair<T, U> operator-(const pair<T, U> &p) {
  return pair<T, U>(-p.fi, -p.se);
}

vc<int> argsort(const Z &a) {
  vc<int> I(len(a));
  iota(all(I), 0);
  sort(I, [&](int i, int k) { return a[i] < a[k] or (a[i] == a[k] and i < k); });
  return I;
}
TE vc<T> rearrange(const vc<T> &a, const vc<int> &I) {
  int N = len(I);
  vc<T> b(N);
  FOR(i, N) b[i] = a[I[i]];
  return b;
}
template <int off = 1, typename T> 
vc<T> pre_sum(const vc<T> &a) {
  int N = len(a);
  vc<T> c(N + 1);
  FOR(i, N) c[i + 1] = c[i] + a[i];
  if constexpr (off == 0) c.erase(c.begin());
  return c;
}

TE constexpr static int topbit(T x) {
  if (x == 0) return - 1;
  if constexpr (sizeof(T) <= 4) return 31 - __builtin_clz(x);
  else return 63 - __builtin_clzll(x);
}
TE constexpr static int lowbit(T x) {
  if (x == 0) return -1;
  if constexpr (sizeof(T) <= 4) return __builtin_ctz(x);
  else return __builtin_ctzll(x);
}

TE constexpr T floor(T x, T y) { return x / y - (x % y and (x ^ y) < 0); }
TE constexpr T ceil(T x, T y) { return floor(x + y - 1, y); }
TE constexpr T bmod(T x, T y) { return x - floor(x, y) * x; }
TE constexpr pair<T, T> divmod(T x, T y) {
  T q = floor(x, y);
  return pair{q, x - q * y};
}
template <typename T = ll>
T SUM(const Z &v) {
  return accumulate(all(v), T(0));
}
int lb(const Z &a, Z x) { return lower_bound(all(a), x) - a.begin(); }
int ub(const Z &a, Z x) { return upper_bound(all(a), x) - a.begin(); }

template <bool ck = true>
ll bina(Z F, ll l, ll r) {
  if constexpr (ck) assert(F(l));
  while (abs(l - r) > 1) {
    ll x = (r + l) >> 1;
    (F(x) ? l : r) = x;
  }
  return l;
}
TE T bina_real(const Z &F, T l, T r, int c = 100) {
  while (c--) {
    T m = (l + r) / 2;
    (F(m) ? l : r) = m;
  }
  return (l + r) / 2;
}

Z pop(Z &s) {
  if constexpr (requires { s.pop_back(); }) {
    Z x = s.back();
    return s.pop_back(), x;
  } else if constexpr (requires { s.top(); }) {
    Z x = s.top();
    return s.pop(), x;
  } else {
    Z x = s.front();
    return s.pop(), x;
  }
}
void setp(int x) { cout << fixed << setprecision(x); }

TE inline void sh(vc<T> &a, int N) {
  a.resize(N, T(0));
}
#line 1 "YRS/debug.hpp"
#ifdef YRSD
void DBG() { cerr << "]" << endl; }
TES void DBG(T &&x, S &&...y) {
  cerr << x;
  if constexpr (sizeof...(S)) cerr << ", ";
  DBG(forward<S>(y)...);
}
#define debug(...) cerr << "[" << __LINE__ << "]: [" #__VA_ARGS__ "] = [", DBG(__VA_ARGS__)
void ERR() { cerr << endl; }
TES void ERR(T &&x, S &&...y) {
  cerr << x;
  if constexpr (sizeof...(S)) cerr << ", ";
  ERR(forward<S>(y)...);
}
#define err(...) cerr << "[" << __LINE__ << "]: ", ERR(__VA_ARGS__)
#define asser assert
#else
#define debug(...) void(0721)
#define err(...)   void(0721)
#define asser(...) void(0721)
#endif
#line 4 "No_3_\u30d3\u30c3\u30c8\u3059\u3054\u308d\u304f.cpp"
// #include "YRS/IO/fast_io.hpp"
// #include "YRS/random/rng.hpp"
#line 2 "YRS/g/Basic.hpp"

#line 2 "YRS/ds/basic/hashmap.hpp"

template <typename T>
struct hash_map {

  hash_map(uint N = 0) { build(N); }

  void build(uint N) {
    uint k = 8;
    while (k < (N << 1)) k <<= 1;
    ls = k >> 1, msk = k - 1;
    ke.resize(k), val.resize(k), vis.assign(k, 0);
  }

  void clear() {
    fill(all(vis), 0);
    ls = (msk + 1) >> 1;
  }

  int size() const { return vis.size() / 2 - ls; }

  int id(ull k) const {
    int i = hash(k);
    while (vis[i] and ke[i] != k) i = (i + 1) & msk;
    return i;
  }

  T &operator[](ull k) {
    if (ls == 0) extend();
    int i = id(k);
    if (not vis[i]) {
      vis[i] = 1;
      ke[i] = k;
      val[i] = T {};
      --ls;
    }
    return val[i];
  }

  T get(ull k, T fail) const {
    int i = id(k);
    return (vis[i] ? val[i] : fail);
  }

  bool contains(ull k) const {
    int i = id(k);
    return vis[i] and ke[i] == k;
  }

  // f(ke, val);
  template <typename F>
  void enumerate_all(F f) const {
    const int N = len(vis);
    FOR(i, N) if (vis[i]) f(ke[i], val[i]);
  }

 private:
  uint ls, msk;
  vc<ull> ke;
  vc<T> val;
  vc<u8> vis;

  ull hash(ull x) const {
    static const ull FIXED_RANDOM =
        std::chrono::steady_clock::now().time_since_epoch().count();
    x += FIXED_RANDOM;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return (x ^ (x >> 31)) & msk;
  }

  void extend() {
    vc<pair<ull, T>> dat;
    const int N = len(vis);
    dat.reserve(N / 2 - ls);
    FOR(i, N) if (vis[i]) dat.ep(ke[i], val[i]);
    build(dat.size() << 1);
    for (Z &[a, b] : dat) (*this)[a] = b;
  }
};
#line 4 "YRS/g/Basic.hpp"

// https://www.luogu.com.cn/problem/P5318

#define TG template <typename GT>

TE struct edge {
  int f, to;
  T w;
  int id;
};
template <typename T = int, bool dir = false>
struct graph {
  static constexpr bool is_dir = dir;
  int N, M;
  using cost_type = T;
  using ee = edge<T>;
  vc<ee> edges;
  vc<int> indptr;
  vc<ee> csr_edges;
  
  vc<int> vec_deg, vec_indeg, vec_outdeg;
  bool prepared;

  struct out_going_edges {
    const graph *G;
    int l, r;
    out_going_edges(const graph *G, int l, int r) : G(G), l(l), r(r) {}
    const ee *begin() const {
      if (l == r) return 0;
      return &G->csr_edges[l];
    }
    const ee *end() const {
      if (l == r) return 0;
      return &G->csr_edges[r];
    }
  };

  bool is_prepared() { return prepared; }

  graph() : N(0), M(0), prepared(false) {}
  graph(int N) : N(N), M(0), prepared(false) {}

  void build(int s) {
    N = s, M = 0, prepared = false;
    edges.clear();
    indptr.clear();
    csr_edges.clear();
    vec_deg.clear();
    vec_indeg.clear();
    vec_outdeg.clear();
  }

  void add(int f, int t, T w = 1, int i = -1) {
    asser(not prepared);
    asser(-1 < f and -1 < t and t < N and f < N);
    if (i == -1) i = M;
    Z e = ee({f, t, w, i});
    edges.ep(e);
    ++M;
  }

  template <bool wt = false, int off = 1>
  void read_tree() {
    read_graph<wt, off>(N - 1);
  }
  template <bool wt = false, int off = 1>
  void read_graph(int M) {
    edges.reserve(M * (dir ? 1 : 2));
    FOR(M) {
      INT(x, y);
      x -= off, y -= off;
      if constexpr (not wt) {
        add(x, y);
      } else {
        T w;
        IN(w);
        add(x, y, w);
      }
    }
    build();
  }

  void build() {
    asser(not prepared);
    prepared = true;
    indptr.assign(N + 1, 0);
    for (Z &&e : edges) {
      indptr[e.f + 1]++;
      if constexpr (not dir) indptr[e.to + 1]++;
    }
    FOR(i, N) indptr[i + 1] += indptr[i];
    Z counter = indptr;
    csr_edges.resize(indptr.back() + 1);
    for (Z &&e : edges) {
      csr_edges[counter[e.f]++] = e;
      if constexpr (not dir) {
        csr_edges[counter[e.to]++] = ee({e.to, e.f, e.w, e.id});
      }
    }
  }

  out_going_edges operator[](int i) const {
    asser(prepared);
    return {this, indptr[i], indptr[i + 1]};
  }

  vc<int> deg_array() {
    if (vec_deg.empty()) calc_dag();
    return vec_deg;
  }

  pair<vc<int>, vc<int>> deg_array_inout() {
    if (vec_indeg.empty()) calc_deg_inout();
    return {vec_indeg, vec_outdeg};
  }

  int deg(int i) {
    if (vec_deg.empty()) calc_dag();
    return vec_deg[i];
  }

  int in_deg(int i) {
    if (vec_indeg.empty()) calc_deg_inout();
    return vec_indeg[i];
  }

  int out_deg(int i) {
    if (vec_outdeg.empty()) calc_deg_inout();
    return vec_outdeg[i];
  }

  vc<int> ni;
  vc<u8> vis;

  // 使G中的顶点V[i]在新图表中为i
  // {G, es}
  // sum（deg(v)）的计算量
  // 注意它可能大于新图表的n+M
  graph<T, dir> rearrange(const vc<int> &v, bool keep_eid = 0) {
    if (len(ni) != N) ni.assign(N, -1);
    int N = len(v);
    FOR(i, N) ni[v[i]] = i;
    graph<T, dir> g(N);
    vc<int> s;
    FOR(i, N) {
      for (Z &&e : (*this)[v[i]]) {
        if (len(vis) <= e.id) vis.resize(e.id + 1);
        if (vis[e.id]) continue;
        int f = e.f, to = e.to;
        if (ni[f] != -1 and ni[to] != -1) {
          s.ep(e.id);
          vis[e.id] = 1;
          int id = (keep_eid ? e.id : -1);
          g.add(ni[f], ni[to], e.w, id);
        }
      }
    }
    FOR(i, N) ni[v[i]] = -1;
    for (int i : s) vis[i] = 0;
    return g.build(), g;
  }

  graph<T, dir> to_directed_tree(int rt = -1) {
    if (rt == -1) rt = 0;
    assert(not is_dir and prepared and M == N - 1);
    graph<T, true> g;
    vc<int> fa(N, -1);
    Z f = [&](Z &f, int n) -> void {
      for (Z &e : (*this)[n]) {
        if (e.to == fa[n]) continue;
        fa[e.to] = n;
        f(f, e.to);
      }
    };
    f(f, rt);
    for (Z &&e : edges) {
      int f = e.f, to = e.to;
      if (fa[f] == to) swap(f, to);
      g.add(f, to, e.w);
    }
    return g.build(), g;
  }

  hash_map<int> mp;
  int get_eid(ull x, ull y) {
    if (mp.size() == 0) {
      mp.build(N - 1);
      for (Z &&e : edges) {
        ull x = e.f, y = e.to;
        ull k = to_eid_key(x, y);
        mp[k] = e.id;
      }
    }
    return mp.get(to_eid_key(x, y), -1);
  }

  ull to_eid_key(ull x, ull y) {
    if (not dir and x > y) swap(x, y);
    return x * N + y;
  }

  graph reverse_graph() const {
    static_assert(dir);
    graph ng(N);
    for (Z &&[f, t, w, id] : edges) ng.add(t, f, w, id);
    return ng;
  }

 private:
  void calc_dag() {
    assert(vec_deg.empty());
    vec_deg.resize(N);
    for (Z &&e : edges) {
      ++vec_deg[e.f];
      ++vec_deg[e.to];
    }
  }
  void calc_deg_inout() {
    assert(vec_indeg.empty());
    vec_indeg.resize(N);
    vec_outdeg.resize(N);
    for (Z &&e : edges) {
      vec_indeg[e.to]++;
      vec_outdeg[e.f]++;
    }
  }
};
#line 3 "YRS/g/dijkstra.hpp"

// https://www.luogu.com.cn/problem/P4779
template <typename T, bool dir>
pair<vc<T>, vc<int>> dijkstra(graph<T, dir> &g, const vc<int> &s) {
  assert(g.prepared);
  int N = g.N;
  vc<T> dis(N, inf<T>);
  vc<int> fa(N, -1);
  
  min_heap<pair<T, int>> q;
  for (int x : s) {
    q.eb(0, x);
    dis[x] = 0;
  }
  while (not q.empty()) {
    Z [d, n] = q.top();
    q.pop();
    if (d > dis[n]) continue;
    for (Z &&e : g[n]) {
      if (chmin(dis[e.to], dis[n] + e.w)) {
        fa[e.to] = n;
        q.eb(dis[e.to], e.to);
      }
    }
  }
  return {dis, fa};
}
template <typename T, bool dir>
pair<vc<T>, vc<int>> dijkstra(graph<T, dir> &g, int s) {
  return dijkstra(g, vc<int>{s});
}
#line 7 "No_3_\u30d3\u30c3\u30c8\u3059\u3054\u308d\u304f.cpp"

#define tests 0
#define fl 0
#define DB 10
void Yorisou() {
  INT(N);
  graph<int, 1> g(N);
  Z add = [&](int f, int t) -> void {
    if (not(t >= 0 and t < N)) return;
    g.add(f, t);
  };
  FOR(i, N) {
    add(i, i + pc(i + 1));
    add(i, i - pc(i + 1));
  }
  g.build();
  int ans = dijkstra(g, 0).fi[N - 1];
  err(dijkstra(g, 0).fi);
  print(ans == inf<int> ? -1 : ans + 1);
}
#line 1 "YRS/aa/main.hpp"
int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int T = 1;
  if (fl) cerr.tie(0);
  if (tests and not fl) IN(T);
  for (int i = 0; i < T or fl; ++i) {
    Yorisou();
    if (fl and i % DB == 0) cerr << "Case: " << i << '\n';
  }
  return 0;
}
#line 28 "No_3_\u30d3\u30c3\u30c8\u3059\u3054\u308d\u304f.cpp"
yukicoder

結果

ソースコード
