#601624 (C++17) No.1330 Multiply or Divide

• 問題: No.1330 Multiply or Divide
• ユーザー: minato
• 提出日時: 2021-01-09 00:05:12
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 3,848 bytes
• コンパイル時間: 2,444 ms
• コンパイル使用メモリ: 207,732 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-16 19:12:06
• 合計ジャッジ時間: 5,503 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	AC	28 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	1 ms; 5,248 KB
testcase_06	AC	21 ms; 5,248 KB
testcase_07	AC	531 ms; 5,248 KB
testcase_08	AC	37 ms; 5,248 KB
testcase_09	AC	42 ms; 5,248 KB
testcase_10	AC	37 ms; 5,248 KB
testcase_11	AC	34 ms; 5,248 KB
testcase_12	AC	37 ms; 5,248 KB
testcase_13	AC	2 ms; 5,248 KB
testcase_14	AC	2 ms; 5,248 KB
testcase_15	AC	2 ms; 5,248 KB
testcase_16	AC	2 ms; 5,248 KB
testcase_17	AC	2 ms; 5,248 KB
testcase_18	AC	25 ms; 5,248 KB
testcase_19	AC	25 ms; 5,248 KB
testcase_20	AC	25 ms; 5,248 KB
testcase_21	AC	25 ms; 5,248 KB
testcase_22	AC	25 ms; 5,248 KB
testcase_23	AC	32 ms; 5,248 KB
testcase_24	AC	2 ms; 5,248 KB
testcase_25	AC	2 ms; 5,248 KB
testcase_26	AC	2 ms; 5,248 KB
testcase_27	AC	2 ms; 5,248 KB
testcase_28	AC	2 ms; 5,248 KB
testcase_29	AC	2 ms; 5,248 KB
testcase_30	AC	2 ms; 5,248 KB
testcase_31	AC	2 ms; 5,248 KB
testcase_32	AC	2 ms; 5,248 KB
testcase_33	AC	2 ms; 5,248 KB
testcase_34	AC	19 ms; 5,248 KB
testcase_35	AC	6 ms; 5,248 KB
testcase_36	AC	17 ms; 5,248 KB
testcase_37	AC	16 ms; 5,248 KB
testcase_38	AC	10 ms; 5,248 KB
testcase_39	AC	8 ms; 5,248 KB
testcase_40	AC	9 ms; 5,248 KB
testcase_41	AC	5 ms; 5,248 KB
testcase_42	AC	15 ms; 5,248 KB
testcase_43	AC	17 ms; 5,248 KB
testcase_44	AC	100 ms; 5,248 KB
testcase_45	AC	143 ms; 5,248 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
istream& operator>>(istream& is, __int128_t& x) {
    x = 0;
    string s;
    is >> s;
    int n = int(s.size()), it = 0;
    if (s[0] == '-') it++;
    for (; it < n; it++) x = (x * 10 + s[it] - '0');
    if (s[0] == '-') x = -x;
    return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
    if (x == 0) return os << 0;
    if (x < 0) os << '-', x = -x;
    deque<int> deq;
    while (x) deq.emplace_front(x % 10), x /= 10;
    for (int e : deq) os << e;
    return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
    return os << "(" << p.first << ", " << p.second << ")";
}
template<class T> 
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    for (int i = 0; i < int(v.size()); i++) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "}";
}
template<class Container> inline int SZ(Container& v) { return int(v.size()); }
template<class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}
template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}
inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(ull x) { return __builtin_popcountll(x); }
inline int kthbit(ull x, int k) { return (x>>k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; }
inline void print() { cout << "\n"; }
template<class T>
inline void print(const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        if (i) cout << " ";
        cout << v[i];
    }
    print();
}
template<class T, class... Args>
inline void print(const T& x, const Args& ... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
inline void debug_out() { cerr << endl; }
template <class T, class... Args>
inline void debug_out(const T& x, const Args& ... args) {
    cerr << " " << x;
    debug_out(args...);
}
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    ll N,M,P; cin >> N >> M >> P;
    vec<ll> A(N);
    rep(i,N) cin >> A[i];

    ll L = *max_element(all(A));
    if (L > M) {
        cout << 1 << ln;
        return 0;
    }

    ll ans = 1e18;
    rep(i,N) {
        ll a = A[i];
        while (a%P==0) a /= P;
        if (a==1) continue;
        ll tmp = 1;
        int cnt = 0;
        while (true) {
            if (tmp%P==0) {
                tmp /= P;
                cnt++;
            } else {
                if (tmp * L > M) {
                    cnt++;
                    break;
                } else {
                    tmp *= A[i];
                    cnt++;
                }
            }
        }

        chmin(ans,cnt);
    }

    cout << (ans==1e18 ? -1 : ans) << ln;
}