#928336 (C++17) No.2039 Copy and Avoid

• 問題: No.2039 Copy and Avoid
• ユーザー: asaringo
• 提出日時: 2023-11-11 19:33:11
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 99 ms / 2,000 ms
• コード長: 3,479 bytes
• コンパイル時間: 2,606 ms
• コンパイル使用メモリ: 219,328 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-26 02:51:26
• 合計ジャッジ時間: 3,879 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	95 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	3 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	4 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	96 ms; 5,376 KB
testcase_14	AC	96 ms; 5,376 KB
testcase_15	AC	99 ms; 5,376 KB
testcase_16	AC	90 ms; 5,376 KB
testcase_17	AC	3 ms; 5,376 KB
testcase_18	AC	4 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	7 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	1 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	3 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	1 ms; 5,376 KB
testcase_30	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#define overload2(a, b, c, ...) c
#define overload3(a, b, c, d, ...) d
#define overload4(a, b, c, d, e ...) e
#define overload5(a, b, c, d, e, f ...) f
#define overload6(a, b, c, d, e, f, g ...) g
#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
typedef long long ll;
typedef long double ld;
#define chmin(a,b) a = min(a,b);
#define chmax(a,b) a = max(a,b);
#define bit_count(x) __builtin_popcountll(x)
#define leading_zero_count(x) __builtin_clz(x)
#define trailing_zero_count(x) __builtin_ctz(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(...) overload3(__VA_ARGS__, rrep, rep1)(__VA_ARGS__)
#define rep1(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)
#define pt(a) cout << a << endl;
#define print(...) printall(__VA_ARGS__);
#define debug(a) cout << #a << " " << a << endl;
#define all(a) a.begin(), a.end()
#define endl "\n";
#define v1(T,n,a) vector<T>(n,a)
#define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a))
#define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a))
#define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a))
template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;}

void solve(){
    int n, m, a, b;
    cin >> n >> m >> a >> b;
    vector<ll> C(m);
    cin >> C;
    sort(all(C));
    ll N = n;
    vector<ll> V;
    for(ll x = 1; x * x <= N; x++){
        if(N % x == 0){
            V.push_back(x);
            if(x * x != N) V.push_back(n/x);
        }
    }
    sort(all(V));
    int sz = V.size();
    unordered_map<ll,ll> dp;
    rep(i,sz) dp[V[i]] = 1e18;
    rep(i,sz){
        if(V[i] >= C[0]) continue;
        dp[V[i]] = (V[i] - 1) * a;
    }
    rep(i,sz){
        ll x = V[i];
        ll cant = 1e18;
        rep(j,m){
            if(C[j] % x == 0) chmin(cant,C[j]);
        }
        rep(j,sz){
            ll y = V[j];
            ll z = x * y;
            if(n % z != 0) continue;
            if(z >= cant) continue;
            chmin(dp[z],dp[x] + b + (y-1) * a);
        }
    }
    ll res = dp[n] == 1e18 ? -1 : dp[n];
    pt(res);
}

int main(){
    fast_io
    int t = 1;
    // cin >> t;
    rep(i,t) solve();
}