POJ 3087 Shuffle'm Up(字符串处理,模拟)

POJ 3087 Shuffle’m Up(字符串处理,模拟)

A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C chips. Each stack may contain chips of several different colors.

The actual shuffle operation is performed by interleaving a chip from S1 with a chip from S2 as shown below for C = 5:
这里写图片描述
The single resultant stack, S12, contains 2 * C chips. The bottommost chip of S12 is the bottommost chip from S2. On top of that chip, is the bottommost chip from S1. The interleaving process continues taking the 2nd chip from the bottom of S2 and placing that on S12, followed by the 2nd chip from the bottom of S1 and so on until the topmost chip from S1 is placed on top of S12.

After the shuffle operation, S12 is split into 2 new stacks by taking the bottommost C chips from S12 to form a new S1 and the topmost C chips from S12 to form a new S2. The shuffle operation may then be repeated to form a new S12.

For this problem, you will write a program to determine if a particular resultant stack S12 can be formed by shuffling two stacks some number of times.

Input

The first line of input contains a single integer N, (1 ≤ N ≤ 1000) which is the number of datasets that follow.

Each dataset consists of four lines of input. The first line of a dataset specifies an integer C, (1 ≤ C ≤ 100) which is the number of chips in each initial stack (S1 and S2). The second line of each dataset specifies the colors of each of the C chips in stack S1, starting with the bottommost chip. The third line of each dataset specifies the colors of each of the C chips in stack S2 starting with the bottommost chip. Colors are expressed as a single uppercase letter (A through H). There are no blanks or separators between the chip colors. The fourth line of each dataset contains 2 * C uppercase letters (A through H), representing the colors of the desired result of the shuffling of S1 and S2 zero or more times. The bottommost chip’s color is specified first.

Output

Output for each dataset consists of a single line that displays the dataset number (1 though N), a space, and an integer value which is the minimum number of shuffle operations required to get the desired resultant stack. If the desired result can not be reached using the input for the dataset, display the value negative 1 (−1) for the number of shuffle operations.

Sample Input

2
4
AHAH
HAHA
HHAAAAHH
3
CDE
CDE
EEDDCC

Sample Output

1 2
2 -1

解题思路

1.题目主要内容是模拟洗牌的过程:
如样例输入字符串s1,s2,s
s1=AHAH,s2=HAHA
一次变换后的序列 s12=HAAHHAAH
如果s和s12相等则输出变换次数
如果不相等,s12的前半部分作为s1,后半部分作为s2,重复上述过程。

2.很容易可以想到循环模拟此过程,并维护一个集合(代码中用的set容器,其实使用map更好),将每次生成好的s12与s比较,相等则输出变换次数,不相等则查询是否在集合中,如果在则说明不能最终变换成s(后边的重复了),如果不在集合中则加入集合。

#include<iostream>
#include<stack>
#include<string>
#include<cstring>
#include<cstdlib>
#include<sstream>
#include<set>
#include<memory.h>
#define INF 0x7fffffff
using namespace std;
string s1;
string s2;
string s12;
string s;
set<string>r;//用map更好一点
int main(){
    int t;
    cin>>t;
    for(int k=1;k<=t;k++){
        int n;
        int num=1;
        cin>>n;
        cin>>s1>>s2>>s;
        s12.clear();//注意要清空(变量的生存周期问题)
        for(int i=0;i<n;i++){
            s12=s12+s2[i];
            s12=s12+s1[i];
        }
        /*
        这里对s12赋值的时候要采用
        s12=s12+s2[i];(string类里‘+’运算符可以自动分配内存)
        而不能采用
        s12[inx++]=s2[i];(未分配内存)
        (有点类似于java中只声明了对象而没有分配内存)
        可以先使s12=s;然后再赋值,就不用考虑内存了。
        */
        if(s12==s){
            cout<<k<<" "<<num<<endl;
            continue;
        }
        else{
            r.insert(s12);
        }
        int flag=0;
        while(flag==0){
            int inx=0;
            num++;
            for(int i=0;i<n;i++){//s12的前半部分作为s1,后半部分作为s2
                s1[inx]=s12[i];
                s2[inx]=s12[i+n];
                inx++;
            }
            inx=0;
            for(int i=0;i<n;i++){//变换一次,生成新的s12
                s12[inx++]=s2[i];
                s12[inx++]=s1[i];
                //这里可以采用这种方式赋值,因为s12在前边已分配过内存
            }
            if(s12==s){
                cout<<k<<" "<<num<<endl;
                break;
            }
            else if(r.count(s12)){//查询是否在集合中
                flag=1;
                break;
            }
            else{
                r.insert(s12);
            }
        }
        if(flag==1){
            cout<<k<<" "<<-1<<endl;
        }
        r.clear();
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值