#863354 (C++17) No.2287 ++ -- *=a /=a

提出ソース

結果

問題	No.2287 ++ -- *=a /=a
ユーザー	cureskol
提出日時	2023-04-27 23:36:21
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,404 ms / 2,000 ms
コード長	11,346 bytes
コンパイル時間	3,450 ms
コンパイル使用メモリ	241,712 KB
実行使用メモリ	6,824 KB
最終ジャッジ日時	2024-11-17 19:22:11
合計ジャッジ時間	11,676 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	3 ms 6,816 KB
testcase_03	AC	2 ms 6,820 KB
testcase_04	AC	2 ms 6,820 KB
testcase_05	AC	3 ms 6,820 KB
testcase_06	AC	226 ms 6,816 KB
testcase_07	AC	226 ms 6,816 KB
testcase_08	AC	231 ms 6,816 KB
testcase_09	AC	80 ms 6,824 KB
testcase_10	AC	59 ms 6,820 KB
testcase_11	AC	50 ms 6,816 KB
testcase_12	AC	45 ms 6,816 KB
testcase_13	AC	42 ms 6,820 KB
testcase_14	AC	39 ms 6,816 KB
testcase_15	AC	38 ms 6,816 KB
testcase_16	AC	36 ms 6,820 KB
testcase_17	AC	34 ms 6,820 KB
testcase_18	AC	1,404 ms 6,820 KB
testcase_19	AC	919 ms 6,816 KB
testcase_20	AC	753 ms 6,816 KB
testcase_21	AC	647 ms 6,820 KB
testcase_22	AC	574 ms 6,820 KB
testcase_23	AC	529 ms 6,820 KB
testcase_24	AC	487 ms 6,820 KB
testcase_25	AC	465 ms 6,820 KB
testcase_26	AC	439 ms 6,816 KB
testcase_27	AC	7 ms 6,816 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma region template
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
 
using ll=long long;
using ld=long double;
using vi=vector<int>;
using vll=vector<ll>;
using pi=pair<int,int>;
using pll=pair<ll,ll>;
 
#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 TYPE1(T) template<typename T>
#define TYPE2(T,U) template<typename T,typename U>
#define TYPE(...) overload2(__VA_ARGS__,TYPE2,TYPE1)(__VA_ARGS__)
#define TYPES1(T) template<typename... T>
#define TYPES2(H,T) template<typename H,typename... T>
#define TYPES(...) overload2(__VA_ARGS__,TYPES2,TYPES1)(__VA_ARGS__)
 
#define REP4(i,s,n,d) for(int i=(s);i<(n);i+=(d))
#define REP3(i,s,n) REP4(i,s,n,1)
#define REP2(i,n) REP3(i,0,n)
#define REP1(n) REP2(tomato,n)
#define REP(...) overload4(__VA_ARGS__,REP4,REP3,REP2,REP1)(__VA_ARGS__)
 
#define RREP4(i,n,s,d) for(int i=(n)-1;i>=(s);i-=(d))
#define RREP3(i,n,s) RREP4(i,n,s,1)
#define RREP2(i,n) RREP3(i,n,0)
#define RREP1(n) RREP2(tomato,n)
#define RREP(...) overload4(__VA_ARGS__,RREP4,RREP3,RREP2,RREP1)(__VA_ARGS__)

#define FOR4(a,b,c,d,v) for(auto [a,b,c,d]:v)
#define FOR3(a,b,c,v) for(auto [a,b,c]:v)
#define FOR2(a,b,v) for(auto [a,b]:v)
#define FOR1(a,v) for(auto a:v)
#define FOR(...) overload5(__VA_ARGS__,FOR4,FOR3,FOR2,FOR1)(__VA_ARGS__)

#define AFOR4(a,b,c,d,v) for(auto&[a,b,c,d]:v)
#define AFOR3(a,b,c,v) for(auto&[a,b,c]:v)
#define AFOR2(a,b,v) for(auto&[a,b]:v)
#define AFOR1(a,v) for(auto&a:v)
#define AFOR(...) overload5(__VA_ARGS__,AFOR4,AFOR3,AFOR2,AFOR1)(__VA_ARGS__)

#define CFOR4(a,b,c,d,v) for(const auto&[a,b,c,d]:v)
#define CFOR3(a,b,c,v) for(const auto&[a,b,c]:v)
#define CFOR2(a,b,v) for(const auto&[a,b]:v)
#define CFOR1(a,v) for(const auto&a:v)
#define CFOR(...) overload5(__VA_ARGS__,CFOR4,CFOR3,CFOR2,CFOR1)(__VA_ARGS__)

#define PFOR(v) for(bool f=true; (f ? exchange(f,false) : next_permutation(v));)
 
#define ALL(v) v.begin(),v.end()
#define RALL(v) v.rbegin(),v.rend()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define REVERSE(v) reverse(ALL(v))
#define UNIQUE(v) SORT(v),v.erase(unique(ALL(v)),v.end())
#define SZ(v) int(v.size())
 
TYPES(T) void input(T&... a){ (cin>>...>>a); }
#define DECLARE(T,...) T __VA_ARGS__;input(__VA_ARGS__);
#define INT(...) DECLARE(int,__VA_ARGS__)
#define STR(...) DECLARE(string,__VA_ARGS__)
#define LL(...) DECLARE(long long,__VA_ARGS__)
#define CHR(...) DECLARE(char,__VA_ARGS__)
#define DBL(...) DECLARE(double,__VA_ARGS__)
#define VI(n,v) vi v(n);cin>>v;
#define VLL(n,v) vll v(n);cin>>v;
#define VS(n,s) vector<string> s(n);cin>>s;
 
TYPE(T) istream&operator>>(istream&is,vector<T>&v){
  for(auto&a:v)cin>>a;
  return is;
}
TYPE(T) ostream&operator<<(ostream&os,const vector<T>&v){
  if(&os==&cerr)os<<"[";
  REP(i,v.size()){
    os<<v[i];
    if(i+1<v.size())os<<(&os==&cerr?",":" ");
  }
  if(&os==&cerr)os<<"]";
  return os;
}
TYPE(T,S) istream&operator>>(istream&is,pair<T,S>&p){
  cin>>p.first>>p.second;
  return is;
}

#ifdef __DEBUG
 #include <debug>
#else
 #define debug(...) void(0)
#endif

void print(){ cout << '\n'; }
TYPES(T,Ts) void print(const T& a,const Ts&... b){
  cout<<a;
  (cout<<...<<(cout<< ' ',b));
  cout << '\n';
}
 
TYPE(T) using pq=priority_queue<T>;
TYPE(T) using pqg=priority_queue<T,vector<T>,greater<T>>;
TYPE(T) T pick(queue<T>& que){assert(que.size()); T a=que.front();que.pop();return a;}
TYPE(T) T pick(pq<T>& que){assert(que.size()); T a=que.top();que.pop();return a;}
TYPE(T) T pick(pqg<T>& que){assert(que.size()); T a=que.top();que.pop();return a;}
TYPE(T) T pick(stack<T>& sta){assert(sta.size()); T a=sta.top();sta.pop();return a;}
TYPE(T) void clear(T&v){ v=decltype(v)(); }
 
string YES(bool f=true){return (f?"YES":"NO");}
string Yes(bool f=true){return (f?"Yes":"No");}
string yes(bool f=true){return (f?"yes":"no");}
 
constexpr int INF=1e9+7;
constexpr ll LINF=ll(9e18);
constexpr ld EPS=1e-10;
 
vi iota(int n){vi a(n);iota(ALL(a),0);return a;}
TYPE(T) vector<pair<T,int>> query_sort(const vector<T>&v){
  vector<pair<T,int>> res(v.size());
  REP(i,v.size())res[i]={v[i],i};
  SORT(res);
  return res;
}
TYPE(T) void add(vector<T>&v,T a=1){ AFOR(p,v)p+=a; }
TYPE(T) T rev(T a){ REVERSE(a);return a; }
TYPE(T) void fin(T a){cout<<a<<'\n';exit(0);}
TYPE(T) bool chmax(T &a,T b){return (a<b&&(a=b,true));}
TYPE(T) bool chmin(T &a,T b){return (a>b&&(a=b,true));}
TYPES(T,Ns) auto make_vector(T x,int n,Ns ...ns){
  if constexpr(sizeof...(ns)==0)return vector<T>(n,x);
  else return vector(n,make_vector<T>(x,ns...));
}
bool in(const ll S,const int a){return (S>>a)&1;}
int popcount(const ll S){return __builtin_popcountll(S);}
int digit(char c){ return (c>='0' and c<='9' ? c-'0' : -1);}
ll sqrtll(ll a){ 
  for(ll b=sqrt(a);b*b<=a;b++)if(b*b==a)return b;
  for(ll b=sqrt(a);b>=0 and b*b>=a;b--)if(b*b==a)return b;
  return -1;
}
#pragma endregion template

#define ALL_(v) v.begin(),v.end()
template<typename T,bool Sentinel=false>
class Compress{
  vector<T> v;
  bool prepared;
public:
  Compress():prepared(false){
    if constexpr(Sentinel){
      static_assert(std::numeric_limits<T>::is_specialized,"cannot use Sentinel");
      v={numeric_limits<T>::min(),numeric_limits<T>::max()};
    }
  }
  Compress(const vector<T>&w):v(w),prepared(false){
    if constexpr(Sentinel){
      static_assert(std::numeric_limits<T>::is_specialized,"cannot use Sentinel");
      v.push_back(numeric_limits<T>::min());
      v.push_back(numeric_limits<T>::max());
    }
    build();
  }
  
  void add(T a){ 
    assert(!prepared);
    v.push_back(a); 
  }
  void build(){
    assert(!prepared);
    prepared=true;
    sort(ALL_(v));
    v.erase(unique(ALL_(v)),v.end());
  }

  bool is_prepared()const{ return prepared; }

  int operator[](const T&a)const{
    assert(prepared);
    auto it=lower_bound(ALL_(v),a);
    assert(*it==a);
    return distance(v.begin(),it);
  }
  int geq(const T&a)const{
    assert(prepared);
    auto it=lower_bound(ALL_(v),a);
    return distance(v.begin(),it);
  }
  int gt(const T&a)const{
    assert(prepared);
    auto it=upper_bound(ALL_(v),a);
    return distance(v.begin(),it);
  }
  int leq(const T&a)const{
    assert(prepared);
    auto it=--upper_bound(ALL_(v),a);
    return distance(v.begin(),it);
  }
  int lt(const T&a)const{
    assert(prepared);
    auto it=--lower_bound(ALL_(v),a);
    return distance(v.begin(),it);
  }
  T r(int id)const{
    assert(prepared);
    return v[id];
  }
  bool exist(const T&a)const{
    assert(prepared);
    return (*lower_bound(ALL_(v),a))==a;
  }
  int size()const{return v.size();}
  T max()const{ return v.back(); }
  T min()const{ return v[0]; }

  friend ostream&operator<<(ostream&os, const Compress&C){ 
    for(int i=0;i<C.v.size();i++)os<<C.v[i]<<":"<<i<<" ";
    return os;
  }
};
#undef ALL_
template<typename WG,typename T=typename WG::weight_type>
pair<vector<T>,vector<int>> dijkstra(const WG&g,int s=0){
  assert(g.is_prepared());
  vector<T> d(g.n,-1);
  vector<int> pre(g.n,-1);
  priority_queue< pair<T,int>,vector<pair<T,int>>,greater<pair<T,int>>> que;
  d[s]=0;
  que.emplace(0,s);
  while(que.size()){
    auto [now,id]=que.top();que.pop();
    if(d[id]<now)continue;
    for(const auto&e:g[id])
      if(d[e.to]==-1 || d[e.to]>now+e.weight){
        d[e.to]=now+e.weight;
        pre[e.to]=id;
        que.emplace(d[e.to],e.to);
      }
  }
  return {d,pre};
}
template<typename T>
struct WeightedEdge{
  WeightedEdge()=default;
  WeightedEdge(int from,int to,T weight):from(from),to(to),weight(weight){}
  int from,to;
  T weight;
  operator int()const{ return to; }
};

template<typename T>
struct WeightedGraph{
  int n;
  using weight_type=T;
  using edge_type=WeightedEdge<T>;
  vector<edge_type> edges;
protected:
  vector<int> in_deg;
  bool prepared;
  class OutgoingEdges{
    WeightedGraph* g;
    int l,r;
  public:
    OutgoingEdges(WeightedGraph* g,int l,int r):g(g),l(l),r(r){}
    edge_type* begin(){ return &(g->edges[l]); }
    edge_type* end(){ return &(g->edges[r]); }
    edge_type& operator[](int i){ return g->edges[l+i]; }
    int size()const{ return r-l; }
  };
  class ConstOutgoingEdges{
    const WeightedGraph* g;
    int l,r;
  public:
    ConstOutgoingEdges(const WeightedGraph* g,int l,int r):g(g),l(l),r(r){}
    const edge_type* begin()const{ return &(g->edges[l]); }
    const edge_type* end()const{ return &(g->edges[r]); }
    const edge_type& operator[](int i)const{ return g->edges[l+i]; }
    int size()const{ return r-l; }
  };
public:
  OutgoingEdges operator[](int v){
    assert(prepared);
    return { this,in_deg[v],in_deg[v+1] };
  }
  const ConstOutgoingEdges operator[](int v)const{
    assert(prepared);
    return { this,in_deg[v],in_deg[v+1] };
  }

  bool is_prepared()const{ return prepared; }

  WeightedGraph():n(0),in_deg(1,0),prepared(false){}
  WeightedGraph(int n):n(n),in_deg(n+1,0),prepared(false){}
  WeightedGraph(int n,int m,bool directed=false,int indexed=1):
    n(n),in_deg(n+1,0),prepared(false){ scan(m,directed,indexed); }

  void resize(int n){n=n;}

  void add_arc(int from,int to,T weight){
    assert(!prepared);
    assert(0<=from and from<n and 0<=to and to<n);
    edges.emplace_back(from,to,weight);
    in_deg[from+1]++;
  }
  void add_edge(int u,int v,T weight){
    add_arc(u,v,weight);
    add_arc(v,u,weight);
  }
  void add_arc(const edge_type&e){
    add_arc(e.from,e.to,e.weight);
  }
  void add_edge(const edge_type&e){
    add_edge(e.from,e.to,e.weight);
  }

  void scan(int m,bool directed=false,int indexed=1){
    edges.reserve(directed?m:2*m);
    while(m--){
      int u,v;cin>>u>>v;u-=indexed;v-=indexed;
      T weight;cin>>weight;
      if(directed)add_arc(u,v,weight);
      else add_edge(u,v,weight);
    }
    build();
  }

  void build(){
    assert(!prepared);prepared=true;
    for(int v=0;v<n;v++)in_deg[v+1]+=in_deg[v];
    vector<edge_type> new_edges(in_deg.back());
    auto counter=in_deg;
    for(auto&&e:edges)new_edges[ counter[e.from]++ ]=e;
    edges=new_edges;
  }

  void graph_debug()const{
  #ifndef __DEBUG
    return;
  #endif
    assert(prepared);
    for(int from=0;from<n;from++){
      cerr<<from<<";";
      for(int i=in_deg[from];i<in_deg[from+1];i++)
        cerr<<"("<<edges[i].to<<","<<edges[i].weight<<")";
      cerr<<"\n";
    }
  }
};

ll solve(){
  LL(x,y,a);
  if(x==y)return 0;
  if(!y){
    for(int i=0;;i++,x/=a)
      if(!x)return i;
  }
  Compress<ll> C;
  for(ll Y=(LINF/a>y?y*a:y);Y;Y/=a){
    C.add(Y);
    C.add(Y/a);
    C.add(Y/a*a);
    C.add(Y/a+1);
    C.add((Y/a+1)*a);
  }
  for(ll X=x;X;X/=a)
    C.add(X);
  C.build();
  debug(C);
  int n=C.size();
  WeightedGraph<ll> G(n);
  
  auto add_arc=[&](ll u,ll v,ll c=-1){
    if(c<0)c=abs(u-v);
    debug(u,v,c);
    if(u!=v and C.exist(u) and C.exist(v))
      G.add_arc(C[u],C[v],c);
  };

  auto add_arcs=[&](ll u){
    add_arc(u,u/a,1);
    if(LINF/a>=u)add_arc(u,u*a,1);
    if(u!=C.min())add_arc(u, C.r(C.lt(u)), -1);
    if(u!=C.max())add_arc(u, C.r(C.gt(u)), -1);
  };

  for(ll u=0;;u=C.r(C.gt(u))){
    add_arcs(u);
    if(u==C.max())break;
  }

  G.build();
  G.graph_debug();

  auto [d,_]=dijkstra(G,C[x]);
  return d[C[y]];
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int testsize;cin>>testsize;
  while(testsize--)cout<<solve()<<'\n';
}

yukicoder

結果

テストケース

ソースコード