結果
問題 |
No.2744 Power! or +1
|
ユーザー |
|
提出日時 | 2024-04-21 09:18:21 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,998 bytes |
コンパイル時間 | 3,672 ms |
コンパイル使用メモリ | 253,524 KB |
実行使用メモリ | 26,068 KB |
最終ジャッジ日時 | 2024-10-13 08:11:14 |
合計ジャッジ時間 | 7,301 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 7 WA * 2 |
ソースコード
# include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;const double pi = acos(-1);template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }template<class T>constexpr T hinf() { return inf<T>() / 2; }template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }template<class T> bool is_sqare(T a) { if(floor(sqrt(a)) * floor(sqrt(a)) == a){ return true; }return false; }int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;# define all(qpqpq) (qpqpq).begin(),(qpqpq).end()# define UNIQUE(wpwpw) (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())# define LOWER(epepe) transform(all((epepe)),(epepe).begin(),TL<char>)# define UPPER(rprpr) transform(all((rprpr)),(rprpr).begin(),TU<char>)# define rep(i,upupu) for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)# define reps(i,opopo) for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)# define len(x) ((ll)(x).size())# define bit(n) (1LL << (n))# define pb push_back# define exists(c, e) ((c).find(e) != (c).end())#ifdef LOCAL# include "_debug_print.hpp"# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else# define debug(...) (static_cast<void>(0))#endifstruct INIT{INIT(){std::ios::sync_with_stdio(false);std::cin.tie(0);cout << fixed << setprecision(20);}}INIT;void solve(){ll n, a, b, c;cin >> n >> a >> b >> c;vector<ll> fact(2*n);fact[0] = fact[1] = 1;for(int i = 2;i < 2*n;i++){fact[i] = i*fact[i-1];fact[i] %= (2*n);}vector<ll> dis(2*n, hinf<ll>());dis[1] = 0;dijk<pair<ll, int>> pq;pq.push({0, 1});while(not pq.empty()){auto [cst, p] = pq.top();pq.pop();if(dis[p] < cst)continue;//debug(cst, p);//sleep(1);{int q = (p+1)%(2*n);if(chmin(dis[q], dis[p]+a)){pq.push({dis[q], q});}}{ll b_cst = b;ll q = p;while(true){if(chmin(dis[q], dis[p]+b_cst)){pq.push({dis[q], q});}if(b_cst>1e18/b)break;b_cst *= b;q *= p;q %= 2*n;}}{if(chmin(dis[fact[p]], dis[p]+c)){pq.push({dis[fact[p]], fact[p]});}}}cout << min(dis[0], dis[n]) << endl;}int main(){int t = 1;//cin >> t;while(t--)solve();}