POJ 3087 Shuffle'm Up
2016-08-27 19:38
274 查看
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 * Cuppercase 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
一道简单的模拟题,只要模拟题目中说的操作看能不能达到即可,如果循环了特判一下。
#include<set>
#include<map>
#include<ctime>
#include<cmath>
#include<stack>
#include<queue>
#include<bitset>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#define rep(i,j,k) for (int i = j; i <= k; i++)
#define per(i,j,k) for (int i = j; i >= k; i--)
#define loop(i,j,k) for (int i = j;i != -1; i = k[i])
#define lson x << 1, l, mid
#define rson x << 1 | 1, mid + 1, r
#define fi first
#define se second
#define mp(i,j) make_pair(i,j)
#define pii pair<int,int>
using namespace std;
typedef long long LL;
const int low(int x) { return x&-x; }
const double eps = 1e-8;
const int INF = 0x7FFFFFFF;
const int mod = 1e9 + 7;
const int N = 1e3 + 10;
const int read()
{
char ch = getchar();
while (ch<'0' || ch>'9') ch = getchar();
int x = ch - '0';
while ((ch = getchar()) >= '0'&&ch <= '9') x = x * 10 + ch - '0';
return x;
}
int T, t = 0, n, m;
char s1
, s2
, s
, g
, loop
;
int main()
{
T = read();
while (T--)
{
scanf("%d%s%s%s", &n, s1, s2, g);
int ans = s[n << 1] = 0;
while (true)
{
int p = 0; ans++;
rep(i, 0, n - 1) { s[p++] = s2[i]; s[p++] = s1[i]; }
if (strcmp(s, g) == 0) break;
if (ans == 1) strcpy(loop, s);
else if (strcmp(loop, s) == 0) { ans = -1; break; }
rep(i, 0, n - 1) s1[i] = s[i];
rep(i, 0, n - 1) s2[i] = s[i + n];
}
printf("%d %d\n", ++t, ans);
}
return 0;
}
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 * Cuppercase 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 22 -1
一道简单的模拟题,只要模拟题目中说的操作看能不能达到即可,如果循环了特判一下。
#include<set>
#include<map>
#include<ctime>
#include<cmath>
#include<stack>
#include<queue>
#include<bitset>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#define rep(i,j,k) for (int i = j; i <= k; i++)
#define per(i,j,k) for (int i = j; i >= k; i--)
#define loop(i,j,k) for (int i = j;i != -1; i = k[i])
#define lson x << 1, l, mid
#define rson x << 1 | 1, mid + 1, r
#define fi first
#define se second
#define mp(i,j) make_pair(i,j)
#define pii pair<int,int>
using namespace std;
typedef long long LL;
const int low(int x) { return x&-x; }
const double eps = 1e-8;
const int INF = 0x7FFFFFFF;
const int mod = 1e9 + 7;
const int N = 1e3 + 10;
const int read()
{
char ch = getchar();
while (ch<'0' || ch>'9') ch = getchar();
int x = ch - '0';
while ((ch = getchar()) >= '0'&&ch <= '9') x = x * 10 + ch - '0';
return x;
}
int T, t = 0, n, m;
char s1
, s2
, s
, g
, loop
;
int main()
{
T = read();
while (T--)
{
scanf("%d%s%s%s", &n, s1, s2, g);
int ans = s[n << 1] = 0;
while (true)
{
int p = 0; ans++;
rep(i, 0, n - 1) { s[p++] = s2[i]; s[p++] = s1[i]; }
if (strcmp(s, g) == 0) break;
if (ans == 1) strcpy(loop, s);
else if (strcmp(loop, s) == 0) { ans = -1; break; }
rep(i, 0, n - 1) s1[i] = s[i];
rep(i, 0, n - 1) s2[i] = s[i + n];
}
printf("%d %d\n", ++t, ans);
}
return 0;
}
相关文章推荐
- E-POJ-3087 Shuffle'm Up
- POJ 3087 Shuffle'm Up (简单模拟)
- POJ 3087 - Shuffle'm Up (模拟)
- Shuffle'm Up POJ - 3087 扑克牌洗牌 记忆化+搜索
- POJ 3087 Shuffle'm Up (模拟)
- 【原】 POJ 3087 Shuffle'm Up 模拟题 解题报告
- poj 3087 Shuffle'm Up
- POJ-3087 Shuffle'm Up(DFS)
- POJ-3087___Shuffle'm Up——解题报告
- POJ 3087 Shuffle'm Up 模拟
- poj 3087 Shuffle'm Up
- POJ 3087 - Shuffle'm Up
- Shuffle'm Up poj 3087 bfs
- POJ 3087 Shuffle'm Up 简单的模拟题
- poj 3087 Shuffle'm Up
- POJ - 3087 Shuffle'm Up(记忆化模拟)
- POJ3087--Shuffle'm Up
- ACM篇:POJ 3087 -- Shuffle'm up
- poj 3087 Shuffle'm Up
- poj 3087 Shuffle'm Up