結果

問題 No.141 魔法少女コバ
ユーザー h-izuh-izu
提出日時 2022-06-26 22:18:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 7,314 bytes
コンパイル時間 5,204 ms
コンパイル使用メモリ 288,192 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-04-28 18:23:11
合計ジャッジ時間 7,888 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 2 ms
6,944 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 2 ms
6,940 KB
testcase_14 AC 2 ms
6,944 KB
testcase_15 AC 2 ms
6,944 KB
testcase_16 AC 2 ms
6,944 KB
testcase_17 AC 2 ms
6,944 KB
testcase_18 AC 2 ms
6,940 KB
testcase_19 AC 2 ms
6,944 KB
testcase_20 AC 2 ms
6,944 KB
testcase_21 AC 2 ms
6,940 KB
testcase_22 AC 2 ms
6,944 KB
testcase_23 AC 2 ms
6,940 KB
testcase_24 AC 2 ms
6,940 KB
testcase_25 AC 2 ms
6,940 KB
testcase_26 AC 2 ms
6,944 KB
testcase_27 AC 2 ms
6,944 KB
testcase_28 AC 2 ms
6,944 KB
testcase_29 AC 2 ms
6,944 KB
testcase_30 AC 2 ms
6,940 KB
testcase_31 AC 2 ms
6,944 KB
testcase_32 AC 2 ms
6,944 KB
testcase_33 AC 2 ms
6,940 KB
testcase_34 AC 2 ms
6,944 KB
testcase_35 AC 2 ms
6,944 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 2 ms
6,940 KB
testcase_38 AC 2 ms
6,940 KB
testcase_39 AC 2 ms
6,944 KB
testcase_40 AC 2 ms
6,940 KB
testcase_41 AC 2 ms
6,944 KB
testcase_42 AC 2 ms
6,944 KB
testcase_43 AC 2 ms
6,940 KB
testcase_44 AC 2 ms
6,940 KB
testcase_45 AC 2 ms
6,944 KB
testcase_46 AC 2 ms
6,944 KB
testcase_47 AC 2 ms
6,940 KB
testcase_48 AC 2 ms
6,940 KB
testcase_49 AC 2 ms
6,944 KB
testcase_50 AC 2 ms
6,940 KB
testcase_51 AC 2 ms
6,940 KB
testcase_52 AC 2 ms
6,940 KB
testcase_53 AC 2 ms
6,944 KB
testcase_54 AC 2 ms
6,940 KB
testcase_55 AC 2 ms
6,944 KB
testcase_56 AC 2 ms
6,944 KB
testcase_57 AC 2 ms
6,944 KB
testcase_58 AC 2 ms
6,940 KB
testcase_59 AC 2 ms
6,940 KB
testcase_60 AC 2 ms
6,940 KB
testcase_61 AC 2 ms
6,944 KB
testcase_62 AC 2 ms
6,940 KB
testcase_63 AC 2 ms
6,940 KB
testcase_64 AC 2 ms
6,940 KB
testcase_65 AC 2 ms
6,944 KB
testcase_66 AC 2 ms
6,940 KB
testcase_67 AC 2 ms
6,944 KB
testcase_68 AC 2 ms
6,940 KB
testcase_69 AC 2 ms
6,940 KB
testcase_70 AC 2 ms
6,944 KB
testcase_71 AC 2 ms
6,944 KB
testcase_72 AC 2 ms
6,944 KB
testcase_73 AC 2 ms
6,940 KB
testcase_74 AC 2 ms
6,940 KB
testcase_75 AC 2 ms
6,940 KB
testcase_76 AC 2 ms
6,944 KB
testcase_77 AC 2 ms
6,940 KB
testcase_78 AC 2 ms
6,940 KB
testcase_79 AC 2 ms
6,940 KB
testcase_80 AC 2 ms
6,944 KB
testcase_81 AC 2 ms
6,940 KB
testcase_82 AC 2 ms
6,940 KB
testcase-evil-0.txt AC 2 ms
6,944 KB
testcase-evil-1.txt AC 2 ms
6,940 KB
testcase-evil-2.txt AC 2 ms
6,944 KB
testcase-evil-3.txt AC 2 ms
6,944 KB
testcase-evil-4.txt AC 2 ms
6,940 KB
testcase-evil-5.txt AC 2 ms
6,944 KB
testcase-evil-6.txt AC 2 ms
6,944 KB
testcase-evil-7.txt AC 2 ms
6,944 KB
testcase-evil-8.txt AC 2 ms
6,944 KB
testcase-evil-9.txt AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#include <atcoder/all>
using namespace std;
using namespace atcoder;

typedef unsigned long long ull;
typedef long long ll;

const double PI = 3.14159265358979323846;

#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)

// a^p
// 2^3 = 2 * 2^2
// 2^2 = 2 * (2^1)
// 2^1 = 2
ll modpow(ll a, ll p, ll mod) {
  if (p == 0) return 1;

  if (p % 2 == 0) {
    ll half = modpow(a, p / 2, mod) % mod;
    return half * half % mod;
  } else {
    return a * modpow(a, p - 1, mod) % mod;
  }
}

// a^p
ll powpow(ll a, ll p) {
  if (p == 0) return 1;

  if (p % 2 == 0) {
    ll half = pow(a, p / 2);
    return half * half;
  } else {
    return a * pow(a, p - 1);
  }
}

// a/b
// https://qiita.com/drken/items/3b4fdf0a78e7a138cd9a
ll moddiv(ll a, ll b, ll mod) { return a * modpow(b, mod - 2, mod); }

// nCa を求める
ll modCombination(ll n, ll a, ll mod) {
  if (n < 0 || a < 0 || n < a) return 0;
  if (n - a < a) {
    return modCombination(n, n - a, mod);
  }

  ll denominator = 1;  // 分母
  ll numerator = 1;    // 分子

  for (ll i = 0; i < a; i++) {
    denominator *= a - i;
    numerator *= n - i;
    denominator %= mod;
    numerator %= mod;
  }

  return numerator * modpow(denominator, mod - 2, mod) % mod;
}

vector<vector<ll>> combination(ll n) {
  vector<vector<ll>> C(n + 1, vector<ll>(n + 1));
  C[0][0] = 1;
  rep(i, n) rep(j, i + 1) {
    C[i + 1][j + 1] += C[i][j];
    C[i + 1][j] += C[i][j];
  }

  return C;
}

// ref. https://drken1215.hatenablog.com/entry/2018/06/08/210000
class ModCombinationTale {
 private:
  ll n;
  ll mod;
  vector<ll> fac, finv, inv;

 public:
  ModCombinationTale(ll n, ll mod) : n(n), mod(mod) {
    fac.resize(n + 1);
    finv.resize(n + 1);
    inv.resize(n + 1);

    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;

    for (ll i = 2; i <= n; i++) {
      fac[i] = fac[i - 1] * i % mod;
      inv[i] = mod - inv[mod % i] * (mod / i) % mod;
      finv[i] = finv[i - 1] * inv[i] % mod;
    }
  }

  ll operator()(ll n, ll k) {
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
  }
};

class UnionFind {
 private:
  vector<ll> parents;

 public:
  UnionFind(ll n) : parents(n, -1) {}

  bool issame(ll x, ll y) { return root(x) == root(y); }

  bool merge(ll x, ll y) {
    if (issame(x, y)) return false;

    ll rx = root(x);
    ll ry = root(y);
    if (parents[rx] > parents[ry]) swap(rx, ry);
    // サイズ情報を更新
    parents[rx] += parents[ry];
    // yの親を更新
    parents[ry] = rx;

    return true;
  }

  ll size(ll x) { return -parents[root(x)]; }

  ll root(ll x) {
    if (parents[x] < 0) return x;
    // 根の親の値に木の(-)サイズの情報を入れる
    return parents[x] = root(parents[x]);
  }
};

// cf. https://qiita.com/drken/items/a14e9af0ca2d857dad23
vector<ll> enum_divisors(ll n) {
  vector<ll> res;
  // sqrt(n)まで試し割り
  for (ll i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      res.push_back(i);
      // 重複しないならばiの相方であるn/iも約数
      // e.g. n=25のときのi=5は重複
      if (n / i != i) res.push_back(n / i);
    }
  }

  sort(res.begin(), res.end());
  return res;
}

// cf. https://qiita.com/drken/items/a14e9af0ca2d857dad23
map<ll, ll> prime_factors(ll n) {
  map<ll, ll> res;
  // sqrt(n)まで試し割り
  for (ll a = 2; a * a <= n; a++) {
    if (n % a != 0) continue;

    // nで割れる限り割る
    while (n % a == 0) {
      res[a]++;
      n /= a;
    }
  }
  if (n != 1) res[n]++;

  return res;
}

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }

// cf. https://qiita.com/drken/items/56a6b68edef8fc605821
class AccumSum2D {
 private:
  vector<vector<ll>> sum;
  ll H;
  ll W;

 public:
  AccumSum2D(vector<vector<ll>> &A) {
    H = (ll)A.size();
    W = (ll)A[0].size();
    sum.resize(H + 1, vector<ll>(W + 1));

    for (ll i = 0; i < H; i++) {
      for (ll j = 0; j < W; j++) {
        sum[i + 1][j + 1] = sum[i][j + 1] + sum[i + 1][j] - sum[i][j] + A[i][j];
      }
    }
  }

  // クエリ [x1, x2) × [y1, y2) の長方形区域の和
  ll Sum(ll x1, ll x2, ll y1, ll y2) {
    return sum[x2][y2] - sum[x1][y2] - sum[x2][y1] + sum[x1][y1];
  }
};

// p/q
struct fraction {
  ll p, q;
  fraction(ll _p = 0, ll _q = 1) : p(_p), q(_q) {
    if (q == 0) {
      p = 1;
      return;
    }
    if (q < 0) {
      p = -p;
      q = -q;
    }

    ll g = gcd(p, q);
    p /= g;
    q /= g;
  }

  bool operator<(const fraction &other) const {
    return p * other.q < q * other.p;
  }

  bool operator<=(const fraction &other) const {
    return p * other.q <= q * other.p;
  }

  bool operator==(const fraction &other) const {
    return p == other.p && q == other.q;
  }
};

// res[i][c] := i 文字目以降で最初に文字 c が登場する index (存在しないときは n)
vector<vector<ll>> calcNext(const string &S) {
  ll n = (ll)S.size();
  vector<vector<ll>> res(n + 1, vector<ll>(26, n));
  for (ll i = n - 1; i >= 0; --i) {
    for (ll j = 0; j < 26; ++j) res[i][j] = res[i + 1][j];
    res[i][S[i] - 'a'] = i;
  }
  return res;
}

// ref. https://algo-logic.info/bridge-lowlink/
struct LowLink {
  vector<vector<ll>> G;
  vector<ll> ord, low;
  vector<bool> visited;
  vector<pair<ll, ll>> bridges;

  LowLink(const vector<vector<ll>> &G) : G(G) {
    visited.resize(G.size(), false);
    ord.resize(G.size(), 0);
    low.resize(G.size(), 0);
    ll k = 0;
    rep(i, (ll)G.size()) {
      if (visited[i]) continue;
      k = dfs(i, k);
    }
  }

  ll dfs(ll node, ll k, ll parent = -1) {
    visited[node] = true;
    ord[node] = k;
    low[node] = k;
    k++;
    for (auto g : G[node]) {
      if (!visited[g]) {
        k = dfs(g, k, node);
        low[node] = min(low[node], low[g]);
        if (ord[node] < low[g]) {
          bridges.emplace_back(node, g);
        }
      } else if (g != parent) {
        low[node] = min(low[node], ord[g]);
      }
    }

    return k;
  }
};

using P = pair<ll, ll>;

int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(15);

  ll M, N;
  cin >> M >> N;

  ll g = gcd(M, N);
  M /= g;
  N /= g;

  if (N == 1) {
    cout << M - N << endl;
    return 0;
  }

  queue<P> q;
  q.push({M, N});
  map<pair<ll, ll>, ll> dist;
  dist[{M, N}] = 0;
  while (q.size()) {
    ll m = q.front().first;
    ll n = q.front().second;
    ll d = dist[{m, n}];
    // cout << m << "/" << n << " -> " << d << endl;
    q.pop();
    if (m > n) {
      if (dist.find({m - n, n}) == dist.end()) {
        if (n != 1) {
          ll cost = m / n;
          m %= n;
          dist[{m, n}] = d + cost;
          q.push({m, n});
        } else {
          ll cost = m - 1;
          ll m = 1;
          dist[{m, n}] = d + cost;
          q.push({m, n});
        }
      }
    } else if (m < n) {
      swap(m, n);
      if (dist.find({m, n}) == dist.end()) {
        dist[{m, n}] = d + 1;
        q.push({m, n});
      }
    } else {
      // m==n
      break;
    }
  }

  if (dist.find({1, 1}) == dist.end()) {
    cout << -1 << endl;
  } else {
    cout << dist[{1, 1}] << endl;
  }

  return 0;
}
0