結果

問題 No.2147 ハノイの塔のおもちゃ
ユーザー TKTYITKTYI
提出日時 2022-12-23 22:00:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 1,984 bytes
コンパイル時間 4,534 ms
コンパイル使用メモリ 369,800 KB
最終ジャッジ日時 2024-11-15 03:13:45
合計ジャッジ時間 4,913 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
In file included from /boost_git/boost/config/detail/suffix.hpp:572,
                 from /boost_git/boost/config.hpp:61,
                 from /boost_git/boost/multiprecision/detail/standalone_config.hpp:18,
                 from /boost_git/boost/multiprecision/cpp_int.hpp:17,
                 from main.cpp:20:
/boost_git/boost/math/constants/constants.hpp: In static member function 'static constexpr T boost::math::constants::detail::constant_half<T>::get(std::integral_constant<int, 1>)':
/boost_git/boost/math/constants/constants.hpp:246:3: error: unable to find numeric literal operator 'operator""first'
  246 |   BOOST_DEFINE_MATH_CONSTANT(half, 5.000000000000000000000000000000000000e-01, "5.00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e-01")
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~
/boost_git/boost/math/constants/constants.hpp: At global scope:
/boost_git/boost/math/constants/constants.hpp:246:3: error: unable to find numeric literal operator 'operator""first'
  246 |   BOOST_DEFINE_MATH_CONSTANT(half, 5.000000000000000000000000000000000000e-01, "5.00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e-01")
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~
/boost_git/boost/math/constants/constants.hpp: In static member function 'static constexpr T boost::math::constants::detail::constant_third<T>::get(std::integral_constant<int, 1>)':
/boost_git/boost/math/constants/constants.hpp:247:3: error: unable to find numeric literal operator 'operator""first'
  247 |   BOOST_DEFINE_MATH_CONSTANT(third, 3.333333333333333333333333333333333333e-01, "3.33333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333e-01")
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~
/boost_git/boost/math/constants/constants.hpp: At global scope:
/boost_git/boost/math/constants/constants.hpp:247:3: error: unable to find numeric literal operator 'operat

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define PA pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");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,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
void YN(bool x){cout<<(x?"Yes":"No")<<endl;}
/*
using mint=modint998244353;
const ll mod=998244353;
//*/
//*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}

string S;
mint solve(ll v,char c){
  if(v==0){
    if(S[v]==c)return 0;
    S[v]=c;return 1;
  }
  if(S[v]==c)return solve(v-1,c);
  char d='A'+'B'+'C'-c-S[v];
  mint res=solve(v-1,d);
  REP(i,v+1)S[i]=c;
  return res+pow_mod(2,v,mod);
}
int main(){
  ll N;cin>>N>>S;
  cout<<solve(N-1,'A').val()<<endl;
  return 0;
}
0