結果

問題 No.1330 Multiply or Divide
ユーザー ir5
提出日時 2024-06-21 19:08:17
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
MLE  
実行時間 -
コード長 4,779 bytes
コンパイル時間 2,175 ms
コンパイル使用メモリ 163,856 KB
実行使用メモリ 727,704 KB
最終ジャッジ日時 2024-06-21 19:08:24
合計ジャッジ時間 6,717 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 1 MLE * 1 -- * 44
権限があれば一括ダウンロードができます

ソースコード

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

#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;
class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};
template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; 
    }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; 
    }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; 
    return os << "}"; }
template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; }
#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif
using EdgeCost = ll;
struct E {
  int fr, to, eid;
  EdgeCost cost;
  E(int fr_, int to_, int eid_, EdgeCost cost_) : fr(fr_), to(to_), eid(eid_), cost(cost_) {}
  friend ostream &operator<<(ostream &os, const E &e) { os << "(" << e.fr << " -> " << e.to << ")"; return os; }
};
using V = vector<E>;
struct G {
  int n, e_count;
  vector<V> adj;
  vector<V> rev;
  G(int n_) : n(n_), e_count(0), adj(n), rev(n) {}
  void add_directed_edge(int fr, int to, EdgeCost cost = (EdgeCost)1) {
    int eid = e_count;
    adj[fr].push_back(E(fr, to, eid, cost));
    rev[to].push_back(E(fr, to, eid, cost));
    e_count++;
  }
  void add_undirected_edge(int fr, int to, EdgeCost cost = (EdgeCost)1) {
    int eid = e_count;
    adj[fr].push_back(E(fr, to, eid, cost));
    rev[to].push_back(E(fr, to, eid, cost));
    adj[to].push_back(E(to, fr, eid, cost));
    rev[fr].push_back(E(to, fr, eid, cost));
    e_count++;
  }
};
EdgeCost shortest_path(G& g, int src, int dst) {
  vector<char> vis(g.n, 0);
  priority_queue<pair<EdgeCost, int>> q;
  q.push(make_pair((EdgeCost)0, src));
  while (!q.empty()) {
    EdgeCost curr_cost = -q.top().first;
    int idx = q.top().second;
    q.pop();
    if (vis[idx])
      continue;
    vis[idx] = 1;
    if (idx == dst) {
      return curr_cost;
    }
    for (auto it : g.adj[idx]) {
      if (vis[it.to])
        continue;
      q.push({-(curr_cost + it.cost), it.to});
    }
  }
  return (EdgeCost)-1; // impossible
}
namespace solver {
template<typename T1, typename T2> struct In2 {
  T1 a; T2 b;
  friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; }
};
template<typename T1, typename T2, typename T3> struct In3 {
  T1 a; T2 b; T3 c;
  friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; }
};
ll n, m, p;
vector<ll> vs;
void read() {
  cin >> n >> m >> p;
  take(vs, n);
}
template<typename T>
void vec_unique(vector<T>& v) {
  ranges::sort(v);
  auto result = ranges::unique(v);
  v.erase(result.begin(), result.end());
}
template<typename T>
ll vec_index(vector<T>& v, T val) {
  auto it = ranges::lower_bound(v, val);
  return it - v.begin();
}
using RetType = ll;
RetType run() {
  vector<ll> kinds;
  for (ll d = 1; d * d <= m; ++d) {
    kinds.push_back(d);
    kinds.push_back(m / d);
  }
  vec_unique(kinds);
  vec_unique(vs);
  ll n_kinds = kinds.size();
  G g(n_kinds + 1);
  for (int i : range(n)) {
    ll a = vs[i];
    ll cost = 1;
    while (a % p == 0) a /= p, cost++;
    if (a == 1) continue;
    for (auto upper : kinds) {
      g.add_directed_edge(vec_index(kinds, upper), vec_index(kinds, upper / a), cost);
    }
  }
  ll maxval = *ranges::max_element(vs);
  for (auto upper : kinds) {
    if (upper < maxval) g.add_directed_edge(vec_index(kinds, upper), n_kinds, 1);
  }
  return shortest_path(g, n_kinds - 1, n_kinds);
}
}  // namespace
template <typename F>
void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }
int main(int argc, char** argv) {
  cerr << fixed << setprecision(12);
  cout << fixed << setprecision(12);
  int testcase = 1;
  if (argc > 1) testcase = atoi(argv[1]);
  while (testcase--) {
    solver::read();
  }
  run(solver::run);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0