poj3087
2016-07-29 16:10
246 查看
Shuffle'm Up
Description
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
Sample Output
判重是关键,用map,模拟就行了
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<map>
#include<string>
using namespace std;
int main(){
int time;
int kase;
scanf("%d",&kase);
time=0;
while(kase--){
char a[105];
char b[105];
char s[210];
int c;
time++;
scanf("%d",&c);
memset(a,'\0',sizeof(a));
memset(b,'\0',sizeof(b));
memset(s,'\0',sizeof(s));
scanf("%s",a);
scanf("%s",b);
scanf("%s",s);
map<string,bool>vis;
vis[s]=true;
int step;
step=0;
int i;
while(true){
char tmp[210];
int ptmp=0;
for(i=0;i<c;i++){
tmp[ptmp]=b[i];
ptmp++;
tmp[ptmp]=a[i];
ptmp++;
}
tmp[ptmp]='\0';
step++;
if(strcmp(s,tmp)==0){
printf("%d %d\n",time,step);
break;
}
else if(vis[tmp]&&strcmp(s,tmp)!=0){
printf("%d -1\n",time);
break;
}
vis[tmp]=true;
for(i=0;i<c;i++){
a[i]=tmp[i];
}
a[i]='\0';
int k;
for(k=0;i<2*c;k++,i++){
b[k]=tmp[i];
}
b[k]='\0';
}
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 9339 | Accepted: 4285 |
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
判重是关键,用map,模拟就行了
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<map>
#include<string>
using namespace std;
int main(){
int time;
int kase;
scanf("%d",&kase);
time=0;
while(kase--){
char a[105];
char b[105];
char s[210];
int c;
time++;
scanf("%d",&c);
memset(a,'\0',sizeof(a));
memset(b,'\0',sizeof(b));
memset(s,'\0',sizeof(s));
scanf("%s",a);
scanf("%s",b);
scanf("%s",s);
map<string,bool>vis;
vis[s]=true;
int step;
step=0;
int i;
while(true){
char tmp[210];
int ptmp=0;
for(i=0;i<c;i++){
tmp[ptmp]=b[i];
ptmp++;
tmp[ptmp]=a[i];
ptmp++;
}
tmp[ptmp]='\0';
step++;
if(strcmp(s,tmp)==0){
printf("%d %d\n",time,step);
break;
}
else if(vis[tmp]&&strcmp(s,tmp)!=0){
printf("%d -1\n",time);
break;
}
vis[tmp]=true;
for(i=0;i<c;i++){
a[i]=tmp[i];
}
a[i]='\0';
int k;
for(k=0;i<2*c;k++,i++){
b[k]=tmp[i];
}
b[k]='\0';
}
}
return 0;
}
相关文章推荐
- 初学ACM - 组合数学基础题目PKU 1833
- POJ ACM 1001
- POJ ACM 1002
- 1611:The Suspects
- POJ1089 区间合并
- POJ 2159 Ancient Cipher
- POJ 2635 The Embarrassed Cryptographe
- POJ 3292 Semi-prime H-numbers
- POJ 2773 HAPPY 2006
- POJ 3090 Visible Lattice Points
- POJ-2409-Let it Bead&&NYOJ-280-LK的项链
- POJ-1695-Magazine Delivery-dp
- POJ1523 SPF dfs
- POJ-1001 求高精度幂-大数乘法系列
- POJ-1003 Hangover
- POJ-1004 Financial Management
- [数论]poj2635__The Embarrassed Cryptographer
- [二分图匹配]poj2446__Chessboard
- POJ1050 最大子矩阵和
- 用单调栈解决最大连续矩形面积问题