Acwing 5379. 旋转和翻转+Atcoder 332D - Swapping Puzzle

最新推荐文章于 2024-09-26 12:00:11 发布

顾客言

最新推荐文章于 2024-09-26 12:00:11 发布

阅读量359

点赞数 8

文章标签： c++ 暴力 bfs

本文链接：https://blog.csdn.net/m0_73673533/article/details/135322481

版权

本文介绍了如何使用翻转搜索模板解决字符串在二维空间中顺时针和逆时针旋转的问题，涉及get_next和flip函数，以及使用BFS算法进行遍历和优化路径长度。

摘要由CSDN通过智能技术生成

题目链接

翻转搜索模板题

int n;
string get_next(string s)
{
    string t(n * n, ' ');
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
            t[(n - j - 1) * n + i] = s[i * n + j];
    }
    return t;
}
string flip(string s, int t)//注意下表从0开始
{
    string p(n * n, ' ');
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (t)
                p[i * n + n - j - 1] = s[i * n + j];//左右翻转
            else
                p[(n - i - 1) * n + j] = s[i * n + j];//上下翻转
        }
    }
    // cout << p << endl;
    return p;
}
void solve()
{
    cin >> n;
    string start, end, line;
    for (int i = 1; i <= n; i++)
    {
        cin >> line;
        start += line;
    }
    for (int i = 1; i <= n; i++)
    {
        cin >> line;
        end += line;
    }
    unordered_map<string, int> d;
    d[start] = 0;
    queue<string> q;
    q.push(start);
    while (q.size())
    {
        string t = q.front();
        q.pop();
        string tt = t;
        if (t == end)
        {
            d[tt] = 1;
            break;
        }
        for (int i = 0; i < 5; i++)
        {
            if (i < 3)//每次转90度，这里是顺时针，和逆时针一样，就是顺寻不一样
                tt = get_next(tt);
            else
                tt = flip(t, i & 1);
            if (d.count(tt))
                continue;
            q.push(tt);
            d[tt] = d[t] + 1;
        }
    }
    if (d[end])
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}

题目链接

int n, m;
int bfs()
{
    vector<int> a(n * m);
    vector<int> b(n * m);
    for (int i = 0; i < n * m; i++)
        cin >> a[i];
    for (int i = 0; i < n * m; i++)
        cin >> b[i];
    map<vector<int>, int> d;
    queue<vector<int>> q;
    q.push(a);
    d[a] = 0;
    while (q.size())
    {
        auto t = q.front();
        q.pop();
        if (t == b)
            return d[b];
        auto tt = t;
        // 换行
        for (int i = 0; i < n - 1; i++)
        {
            for (int k = 0; k < m; k++)
            {
                int j = i + 1;
                int r1 = i * m + k, r2 = j * m + k;
                swap(tt[r1], tt[r2]);
            }
            if (!d.count(tt) || d[tt] > d[t] + 1)
            {
                d[tt] = d[t] + 1;
                q.push(tt);
            }
            tt = t;
        }
        for (int i = 0; i < m - 1; i++)
        {
            for (int k = 0; k < n; k++)
            {
                int j = i + 1;
                int r1 = k * m + i, r2 = k * m + j;
                swap(tt[r1], tt[r2]);
            }
            if (!d.count(tt) || d[tt] > d[t] + 1)
            {
                d[tt] = d[t] + 1;
                q.push(tt);
            }
            tt = t;
        }
    }
    return -1;
}
void solve()
{
    cin >> n >> m;
    cout << bfs() << endl;
}