結果
問題 | No.1330 Multiply or Divide |
ユーザー | first_vil |
提出日時 | 2021-01-08 21:59:29 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,425 bytes |
コンパイル時間 | 2,234 ms |
コンパイル使用メモリ | 203,468 KB |
最終ジャッジ日時 | 2025-01-17 11:57:06 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 45 WA * 1 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using VI = vector<int>;using VL = vector<ll>;using VS = vector<string>;template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;#define FOR(i,a,n) for(int i=(a);i<(n);++i)#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)#define SORT(a) sort(a.begin(),a.end())#define rSORT(a) sort(a.rbegin(),a.rend())#define fSORT(a,f) sort(a.begin(),a.end(),f)#define all(a) a.begin(),a.end()#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))#define tp(a,i) get<i>(a)#ifdef _DEBUG#define line cout << "-----------------------------\n"#define stop system("pause")#define debug(x) print(x)#endifconstexpr ll INF = 1000000000;constexpr ll LLINF = 1LL << 60;constexpr ll mod = 1000000007;constexpr ll MOD = 998244353;constexpr ld eps = 1e-10;constexpr ld pi = 3.1415926535897932;template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }template<class T>inline void print(const T& a) { cout << a << "\n"; }template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }template<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }template<class T>inline void END(T s) { print(s); exit(0); }void END() { exit(0); }ll m, Max;VL cost(31, -1);map<int, int> dp;int solve(ll x) {if (dp.count(x))return dp[x];int ans = INF;if (x * Max > m)ans = 1;eFOR(i, 1, 30) {if (cost[i] == -1)continue;if (x * cost[i] > m)chmin(ans, i);else chmin(ans, solve(x * cost[i]) + i);}return dp[x] = ans;}int main() {init();int n; ll p; cin >> n >> m >> p;VL a(n); cin >> a;VI b(n, 1);Max = *max_element(all(a));bool ng = true;FOR(i, 0, n) {while (a[i] % p == 0) {a[i] /= p;++b[i];}if (1 < a[i])ng = false;}if (ng)END(-1);FOR(i, 0, n)if (a[i] != 1)chmax(cost[b[i]], a[i]);print(solve(1));return 0;}