【POJ 3087】Shuffle'm Up

最新推荐文章于 2024-09-26 21:10:57 发布

「已注销」

最新推荐文章于 2024-09-26 21:10:57 发布

阅读量90

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/core1998/article/details/105243654

版权

#include <cstdio>
#include <map>
#include <cstring>
using namespace std;
struct ptrCmp
{
    bool operator()(const char * s1, const char * s2) const
    {
        return strcmp(s1, s2) < 0;
    }
};
map<char*, int, ptrCmp> mp;
int cs, c, cnt;
char s1[105], s2[105], s12[210], des[210];
inline void merge() {
    for(int i = 1; i <= c; i++) s12[2 * i - 1] = s2[i], s12[2 * i] = s1[i];
}
inline void sep() {
    for(int i = 1; i <= c; i++) s1[i] = s12[i], s2[i] = s12[2 * c - i + 1];
}
bool search() {
    merge();
    cnt = 0;
    s12[2 * c + 1] = '\0';
    mp[s12 + 1]++;
    while(mp[s12 + 1] != 2) {
        sep();
        merge();
        cnt += 2;
        if(strcmp(s12 + 1, des + 1) == 0) return true;
        mp[s12 + 1]++;
    }
    return false;
}
int main() {
    scanf("%d", &cs);
    for(int k = 1; k <= cs; k++) {
        mp.clear();
        scanf("%d", &c);
        scanf("%s%s%s", s1 + 1, s2 + 1, des + 1);
         printf("%d %d", k, search() ? cnt : -1);
    }
    return 0;
}