汉诺塔问题的第M步

思路讲解

https://www.hello-algo.com/chapter_divide_and_conquer/hanota_problem/#2

主要dfs代码。

void dfs(ll rem,vll &src,vll &buf,vll &tar,char s,char b,char t){
    if(ok) return;
    if(rem==1){
        move(src,tar);
        if(tot==M){
            cout<<s<<"--"<<t<<"\n";
            ok=true;
            return;
        }
        return;
    }
    // 利用B，将A移动至C
    dfs(rem-1,src,tar,buf,s,t,b);
    move(src,tar);
    if(tot==M){
        cout<<s<<"--"<<t<<"\n";
        ok=true;
        return;
    }
    dfs(rem-1,buf,src,tar,b,s,t);
}

AC代码

源代码

// by Gospel_rock
#include <algorithm>
#include <bits/stdc++.h>
#include <utility>
#define all(vec) vec.begin(),vec.end()
#define PB push_back
#define EB emplace_back
#define EM emplace
#define FI first
#define SE second
#define pct __builtin_popcountll
#define ctz __builtin_ctzll
#define SZ(a) ((long long) a.size())
#define FOR(i, a, b) for (long long i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (long long i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define cend cerr<<"\n-----------\n"
#define lson(var) (var<<1)
#define rson(var) (var<<1|1)
#define fsp(x) fixed<<setprecision(x)
#define minn(vec) *min_element(vec.begin(),vec.end())
#define maxx(vec) *max_element(vec.begin(),vec.end())
using namespace std;
#ifdef LOCAL
template<typename T> void _print(T x) { cerr << x; }
// 可以打印多层数组，但是格式不是很好
template<typename T> void _print(vector<T> v) { cerr << "[ "; for (T i : v) _print(i), cerr << " "; cerr << "]"; }
template<typename T> void _print(set<T> s) { cerr << "{ "; for (T i : s) _print(i), cerr << " "; cerr << "}"; }
template<typename T, typename U> void _print(pair<T, U> p) { cerr << "{"; _print(p.first); cerr << ", "; _print(p.second); cerr << "}"; }
template<typename T, typename U> void _print(map<T, U> m) { cerr << "{ "; for (auto &p : m) _print(p), cerr << " "; cerr << "}"; }
// 打印两层数组，格式好一些
template<typename T> void _print(vector<vector<T>> v){cerr<<"{\n";for (auto i : v) _print(i), cerr << "\n";cerr<<" }";}
#endif

using  ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
// using i128 = __int128;
using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;using vll=vector<ll>;using vb=vector<bool>;
using tll = tuple<ll,ll,ll>;using vii=vector<int>;
using vpll = vector<pll>;using vtll = vector<tll>;
using vdb = vector<DB>;using vc=vector<char>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
using CD=complex<double>;
static constexpr ll MAXN=(ll)1e6+10,INF=(ll)1e17+3; // 1e17+3是素数 1e18+9是素数
static constexpr ll mod=(ll)1e9+7; // 998244353;
static constexpr double eps=1e-8;const double pi=acos(-1.0);
ll N,M,Q,X,K,T,lT;

inline void __();
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    
    // cin>>lT;
    while(cin>>N>>M)
        __();
    return 0;
}
/*

*/
ll tot=0;
bool ok=false;
void move(vll &a,vll &b){
    b.EB(a.back());
    a.pop_back();
    ++tot;
}
void dfs(ll rem,vll &src,vll &buf,vll &tar,char s,char b,char t){
    if(ok) return;
    if(rem==1){
        move(src,tar);
        if(tot==M){
            cout<<s<<"--"<<t<<"\n";
            ok=true;
            return;
        }
        return;
    }
    dfs(rem-1,src,tar,buf,s,t,b);
    move(src,tar);
    if(tot==M){
        cout<<s<<"--"<<t<<"\n";
        ok=true;
        return;
    }
    dfs(rem-1,buf,src,tar,b,s,t);
}
inline void __(){
    // cin>>N;
    tot=0;
    vll a,b,c;
    ok=false;
    ROF(i,N,1){
        a.EB(i);
    }
    dfs(N,a,b,c,'A','B','C');
    if(!ok){
        cout<<"none\n";
    }
}
/*

*/

心路历程（WA，TLE，MLE……）