結果

問題 No.1330 Multiply or Divide
ユーザー ningenMeningenMe
提出日時 2021-01-08 22:17:39
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,963 bytes
コンパイル時間 3,800 ms
コンパイル使用メモリ 229,456 KB
実行使用メモリ 12,180 KB
最終ジャッジ日時 2024-11-16 12:49:15
合計ジャッジ時間 13,281 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 313 ms
7,528 KB
testcase_02 WA -
testcase_03 AC 2 ms
5,248 KB
testcase_04 WA -
testcase_05 AC 2 ms
5,248 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 387 ms
9,368 KB
testcase_09 AC 437 ms
9,960 KB
testcase_10 AC 386 ms
9,620 KB
testcase_11 AC 345 ms
8,260 KB
testcase_12 AC 387 ms
9,492 KB
testcase_13 AC 3 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 315 ms
7,460 KB
testcase_19 AC 316 ms
7,524 KB
testcase_20 AC 316 ms
7,404 KB
testcase_21 AC 314 ms
7,528 KB
testcase_22 AC 314 ms
7,400 KB
testcase_23 AC 318 ms
7,528 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 3 ms
5,248 KB
testcase_32 AC 2 ms
5,248 KB
testcase_33 AC 2 ms
5,248 KB
testcase_34 AC 237 ms
7,524 KB
testcase_35 AC 66 ms
5,248 KB
testcase_36 AC 210 ms
7,528 KB
testcase_37 AC 186 ms
5,348 KB
testcase_38 AC 118 ms
5,352 KB
testcase_39 AC 82 ms
5,248 KB
testcase_40 AC 98 ms
5,248 KB
testcase_41 AC 50 ms
5,248 KB
testcase_42 AC 172 ms
5,476 KB
testcase_43 AC 200 ms
5,356 KB
testcase_44 WA -
testcase_45 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using int128  = __int128_t;
using int64   = long long;
using int32   = int;
using uint128 = __uint128_t;
using uint64  = unsigned long long;
using uint32  = unsigned int;

#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr int64 MOD = 1'000'000'000LL + 7; //'
constexpr int64 MOD2 = 998244353;
constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL;
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //'
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;}
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b)
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

/**
 * @url 
 * @est
 */ 
int main() {
    cin.tie(0);ios::sync_with_stdio(false);
    int N; int64 M,P; cin >> N >> M >> P;
    vector<pair<int64,int64>> A,B;

    for(int i=0;i<N;++i) {
        int a,b;
        cin >> a; b = a;
        int64 cost = 1;
        while(b%P==0) b /= P, cost += 1;
        if(cost > 1) A.emplace_back(b,1);
        if(a > 1) B.emplace_back(a,cost);
    }
    int L = 600;
    vector<int64> dp(L+30,0);
    dp[0]=1;
    for(int i=0;i<L;++i) {
        for(auto& p:B) {
            int cost = p.second;
            int64 next = min(M+1,dp[i]*p.first);
            if(i+cost<L)chmax(dp[i+cost],next);
        }
    }
    for(int i=L-1;0<=i;--i) {
        for(auto& p:A) {
            int cost = p.second;
            int64 next = min(M+1,dp[i]*p.first);
            if(i+cost<L)chmax(dp[i+cost],next);
        }
    }
    int ans = L;
    for(int i=0;i<L;++i) if(dp[i]>M) chmin(ans,i);
    if(ans == L) ans = -1;
    cout << ans << endl;
    return 0;
}
0