結果
問題 | No.2039 Copy and Avoid |
ユーザー |
![]() |
提出日時 | 2022-08-12 22:14:00 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,137 ms / 2,000 ms |
コード長 | 4,472 bytes |
コンパイル時間 | 2,548 ms |
コンパイル使用メモリ | 221,996 KB |
最終ジャッジ日時 | 2025-01-30 21:12:51 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 31 |
ソースコード
#include "bits/stdc++.h"#include <random>#define ALL(x) (x).begin(), (x).end()#define RALL(x) (x).rbegin(), (x).rend()#define SZ(x) ((lint)(x).size())#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)#define endk '\n'using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedefpair<ld, ld> pld;struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(10); }; } fast_ios_;template<class T> auto add = [](T a, T b) -> T { return a + b; };template<class T> auto mul = [](T a, T b) -> T { return a * b; };template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };template<class T> using V = vector<T>;using Vl = V<lint>; using VVl = V<Vl>; using VVVl = V<V<Vl>>;template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");return os;}template< typename T >istream& operator>>(istream& is, vector< T >& v) {for (T& in : v) is >> in;return is;}template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }template <class T>T div_floor(T a, T b) {if (b < 0) a *= -1, b *= -1;return a >= 0 ? a / b : (a + 1) / b - 1;}template <class T>T div_ceil(T a, T b) {if (b < 0) a *= -1, b *= -1;return a > 0 ? (a - 1) / b + 1 : a / b;}template <class F> struct rec {F f;rec(F&& f_) : f(std::forward<F>(f_)) {}template <class... Args> auto operator()(Args &&... args) const {return f(*this, std::forward<Args>(args)...);}};lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }lint digit(lint a) { return (lint)log10(a); }lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a >= limit / b; } // a * b > c => truevoid Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e18;lint dx[8] = { 0, 1, 0, -1, 1, -1, 1, -1 }, dy[8] = { 1, 0, -1, 0, -1, -1, 1, 1 };bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }struct Edge {lint from, to;lint cost, t;Edge() {}Edge(lint u, lint v, lint c, lint _t) {cost = c;from = u;to = v;t = _t;}bool operator<(const Edge& e) const {return cost < e.cost;}};struct WeightedEdge {lint to;lint cost;WeightedEdge(lint v, lint c) {to = v;cost = c;}bool operator<(const WeightedEdge& e) const {return cost < e.cost;}};using WeightedGraph = V<V<WeightedEdge>>;typedef pair<lint, plint> tlint;typedef pair<ld, ld> pld;typedef pair<plint, plint> qlint;typedef pair<char, lint> vstr;typedef pair<lint, Vl> valv;vector< int64_t > divisor(int64_t n) {vector< int64_t > ret;for (int64_t i = 1; i * i <= n; i++) {if (n % i == 0) {ret.push_back(i);if (i * i != n) ret.push_back(n / i);}}sort(begin(ret), end(ret));return (ret);}int main() {lint N, M, A, B;cin >> N >> M >> A >> B;Vl arr(M);cin >> arr;map<lint, Vl> vs;set<lint> st;REP(i, M) {auto div = divisor(arr[i]);for (lint v : div) {vs[v].push_back(arr[i]);st.insert(v);}}for (lint v : st) sort(ALL(vs[v]));map<lint, lint> dp;auto dfs = [&](auto&& dfs, lint curr) -> lint {if (curr == 1) return 0;if (dp.count(curr)) return dp[curr];lint _res = INF;auto div = divisor(curr);for (lint v : div) {if (v == curr) continue;if (lower_bound(ALL(vs[v]), v) != lower_bound(ALL(vs[v]), curr + 1)) continue;chmin(_res, dfs(dfs, v) + A * ((curr / v) - 1) + B);}return dp[curr] = _res;};lint res = dfs(dfs, N) - B;if (res == INF - B) res = -1;cout << res << endk;}