結果
| 問題 | No.2744 Power! or +1 |
| ユーザー |
 i_am_noob
|
| 提出日時 | 2024-04-25 01:12:38 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 930 ms / 3,000 ms |
| コード長 | 6,419 bytes |
| コンパイル時間 | 4,670 ms |
| コンパイル使用メモリ | 259,908 KB |
| 最終ジャッジ日時 | 2025-02-21 08:50:27 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 9 |
ソースコード
#include<bits/stdc++.h>using namespace std;#define all(a) a.begin(),a.end()#define pb push_back#define sz(a) ((int)a.size())using ll=long long;using u32=unsigned int;using u64=unsigned long long;using i128=__int128;using u128=unsigned __int128;using f128=__float128;using pii=pair<int,int>;using pll=pair<ll,ll>;template<typename T> using vc=vector<T>;template<typename T> using vvc=vc<vc<T>>;template<typename T> using vvvc=vc<vvc<T>>;using vi=vc<int>;using vll=vc<ll>;using vvi=vc<vi>;using vvll=vc<vll>;#define vv(type,name,n,...) \vector<vector<type>> name(n,vector<type>(__VA_ARGS__))#define vvv(type,name,n,m,...) \vector<vector<vector<type>>> name(n,vector<vector<type>>(m,vector<type>(__VA_ARGS__)))template<typename T> using min_heap=priority_queue<T,vector<T>,greater<T>>;template<typename T> using max_heap=priority_queue<T>;// https://trap.jp/post/1224/#define rep1(n) for(ll i=0; i<(ll)(n); ++i)#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))#define cut4(a,b,c,d,e,...) e#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)#define rep_subset(i,s) for(ll i=(s); i>=0; i=(i==0?-1:(i-1)&(s)))template<typename T, typename S> constexpr T ifloor(const T a, const S b){return a/b-(a%b&&(a^b)<0);}template<typename T, typename S> constexpr T iceil(const T a, const S b){return ifloor(a+b-1,b);}template<typename T>void sort_unique(vector<T> &vec){sort(vec.begin(),vec.end());vec.resize(unique(vec.begin(),vec.end())-vec.begin());}template<typename T, typename S> constexpr bool chmin(T &a, const S b){if(a>b) return a=b,true; return false;}template<typename T, typename S> constexpr bool chmax(T &a, const S b){if(a<b) return a=b,true; return false;}template<typename T, typename S> istream& operator >> (istream& i, pair<T,S> &p){return i >> p.first >> p.second;}template<typename T, typename S> ostream& operator << (ostream& o, const pair<T,S> &p){return o << p.first << ' ' << p.second;}#ifdef i_am_noob#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}template<typename T> void _do(T && x) {cerr << x << endl;}template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}#else#define bug(...) 777771449#endiftemplate<typename T> void print(vector<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}template<typename T> void print(set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}template<typename T> void print(unordered_set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}template<typename T> void print(T && x) {cout << x << "\n";}template<typename T, typename... S> void print(T && x, S&&... y) {cout << x << ' ';print(y...);}template<typename T> istream& operator >> (istream& i, vector<T> &vec){for(auto &x: vec) i >> x; return i;}vvi read_graph(int n, int m, int base=1){vvi adj(n);for(int i=0,u,v; i<m; ++i){cin >> u >> v,u-=base,v-=base;adj[u].pb(v),adj[v].pb(u);}return adj;}vvi read_tree(int n, int base=1){return read_graph(n,n-1,base);}template<typename T, typename S> pair<T,S> operator + (const pair<T,S> &a, const pair<T,S> &b){return {a.first+b.first,a.second+b.second};}template<typename T> constexpr T inf=0;template<> constexpr int inf<int> = 0x3f3f3f3f;template<> constexpr ll inf<ll> = 0x3f3f3f3f3f3f3f3f;template<typename T> vector<T> operator += (vector<T> &a, int val){for(auto &i: a) i+=val; return a;}template<typename T> T isqrt(const T &x){T y=sqrt(x+2); while(y*y>x) y--; return y;}#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())#include<atcoder/all>using namespace atcoder;using mint=modint998244353;//using mint=modint1000000007;template<typename T>vector<T> dijkstra(int s, vector<vector<pair<int,T>>> adj){int n=sz(adj);vector<T> dis(n,inf<T>);vector<int> vis(n);priority_queue<pair<T,int>,vector<pair<T,int>>,greater<pair<T,int>>> pq;dis[s]=0,pq.push({0,s});while(!pq.empty()){auto [d,u]=pq.top(); pq.pop();bug(d,u);if(vis[u]) continue;vis[u]=1;for(auto &[v,w]: adj[u]) if(d+w<dis[v]){dis[v]=d+w;pq.push({dis[v],v});}}return dis;}void ahcorz(){int n,a,b,c; cin >> n >> a >> b >> c;vvc<pii> adj(n*2);rep(n){adj[i].pb({(i+1)%n,a});for(int p: {2,3,5,7,11,13,17,19}){double tmp=pow(b,p);if(tmp<1e7){int de=1,cur=1;rep(j,p) de*=b,cur=1ll*cur*i%n;adj[i].pb({cur,de});}}adj[i].pb({0,c});}ll cur_fac=1;bool f=0;rep(i,1,n+1){if(i+1>n) adj[n-1+i].pb({(i+1)%n,a});else adj[n-1+i].pb({n-1+i+1,a});for(int p: {2,3,5,7,11,13,17,19}){double tmp=pow(b,p);if(tmp<1e7){int de=1;ll cur=1;bool g=0;rep(j,p){de*=b;if(g) cur=1ll*cur*i%n;else cur=1ll*cur*i;if(cur>n) g=1;}if(g) adj[n-1+i].pb({cur%n,de});else adj[n-1+i].pb({n-1+cur,de});}}if(f) cur_fac=1ll*cur_fac*i%n;else cur_fac*=i;if(f||cur_fac>n) adj[n-1+i].pb({cur_fac%n,c}),f=1;else adj[n-1+i].pb({n-1+cur_fac,c});}vi dis=dijkstra(n,adj);int res=dis[0];rep(i,1,n+1) if(i%n==0) chmin(res,dis[n-1+i]);print(res);}signed main(){ios_base::sync_with_stdio(0),cin.tie(0);cout << fixed << setprecision(20);int t=1;//cin >> t;while(t--) ahcorz();}