Flipper (栈模拟)
来源:互联网 发布:西安交通网络教育学院 编辑:程序博客网 时间:2024/06/05 20:17
Flipper
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 68 Accepted Submission(s): 54Problem Description
Little Bobby Roberts (son of Big Bob, of Problem G) plays this solitaire memory game called Flipper. He starts with n cards, numbered 1 through n, and lays them out in a row with the cards in order left-to-right. (Card 1 is on the far left; card n is on the far right.) Some cards are face up and some are face down. Bobby then performs n - 1 flips — either right flips or left flips. In a right flip he takes the pile to the far right and flips it over onto the card to its immediate left. For example, if the rightmost pile has cards A, B, C (from top to bottom) and card D is to the immediate left, then flipping the pile over onto card D would result in a pile of 4 cards: C, B, A, D (from top to bottom). A left flip is analogous.
The very last flip performed will result in one pile of cards — some face up, some face down. For example, suppose Bobby deals out 5 cards (numbered 1 through 5) with cards 1 through 3 initially face up and cards 4 and 5 initially face down. If Bobby performs 2 right flips, then 2 left flips, the pile will be (from top to bottom) a face down 2, a face up 1, a face up 4, a face down 5, and a face up 3.
Now Bobby is very sharp and you can ask him what card is in any position and he can tell you!!! You will write a program that matches Bobby’s amazing feat.
The very last flip performed will result in one pile of cards — some face up, some face down. For example, suppose Bobby deals out 5 cards (numbered 1 through 5) with cards 1 through 3 initially face up and cards 4 and 5 initially face down. If Bobby performs 2 right flips, then 2 left flips, the pile will be (from top to bottom) a face down 2, a face up 1, a face up 4, a face down 5, and a face up 3.
Now Bobby is very sharp and you can ask him what card is in any position and he can tell you!!! You will write a program that matches Bobby’s amazing feat.
Input
Each test case will consist of 4 lines. The first line will be a positive integer n (2 ≤ n ≤ 100) which is the number of cards laid out. The second line will be a string of ncharacters. A character U indicates the corresponding card is dealt face up and a character D indicates the card is face down. The third line is a string of n - 1 characters indicating the order of the flips Bobby performs. Each character is either R, indicating a right flip, or L, indicating a left flip. The fourth line is of the form m q1 q2 . . . qm, where m is a positive integer and 1 ≤ qi ≤ n. Each qi is a query on a position of a card in the pile (1 being the top card, n being the bottom card). A line containing 0 indicates end of input.
Output
Each test case should generate m + 1 lines of output. The first line is of the form
For instance, in the above example with 5 cards, if qi = 3, then the answer would be
Pile twhere t is the number of the test case (starting at 1). Each of the next m lines should be of the form
Card qi is a face up k.or
Card qi is a face down k.accordingly, for i = 1, ..,m, where k is the number of the card.
For instance, in the above example with 5 cards, if qi = 3, then the answer would be
Card 3 is a face up 4.
Sample Input
5UUUDDRRLL5 1 2 3 4 510UUDDUUDDUULLLRRRLRL4 3 7 6 10
Sample Output
Pile 1Card 1 is a face down 2.Card 2 is a face up 1.Card 3 is a face up 4.Card 4 is a face down 5.Card 5 is a face up 3.Pile 2Card 3 is a face down 1.Card 7 is a face down 9.Card 6 is a face up 7.Card 1 is a face down 5.
题意:一排卡片,R指令就从右往左翻,L指令就从左往右翻,知道合为一摞,然后查询
每翻一次,卡片相应的face就要反转一次,so
#include <stdio.h>#include <iostream>#include <algorithm>#include <cmath>#include <string>#include <vector>#include <string.h>#include <memory>#include <queue>#include <stack>using namespace std;const int MAX = 110;struct S { char pos; int num;}s[MAX];int main () { stack<S> stk[MAX]; char str[MAX]; int n, m; int ca = 1; while (cin >> n && n) { int left = 1; int right = n; //栈清空 for (int i = 0; i < MAX; ++i) { while (!stk[i].empty()) { stk[i].pop(); } } cin >> str; for (int i = 1; i <= n; ++i) { S temp; temp.pos = str[i-1]; temp.num = i; stk[i].push(temp); } cin >> str; for (int i = 1; i < n; ++i) { if (str[i-1] == 'R') { while (!stk[right].empty()) { S temp = stk[right].top(); stk[right].pop(); temp.pos = (temp.pos == 'U' ? 'D' : 'U'); stk[right - 1].push(temp); } right--; } else { while (!stk[left].empty()) { S temp = stk[left].top(); stk[left].pop(); temp.pos = (temp.pos == 'U' ? 'D' : 'U'); stk[left + 1].push(temp); } left++; } } for (int i = 1; i <= n; ++i) { s[i] = stk[left].top(); stk[left].pop(); } cin >> m; cout << "Pile " << ca++ << endl; while (m--) { int shit; cin >> shit; cout << "Card " << shit << " is a face " << (s[shit].pos == 'D' ? "down" : "up") << " " << s[shit].num << "." <<endl; } } }
0 0
- Flipper (栈模拟)
- HDU 3328 Flipper(栈模拟)
- hdu Flipper (用栈模拟)
- HDU-3328-Flipper(栈模拟)
- hdu 3328 Flipper(栈模拟)
- Flipper(杭电3328)(模拟栈)
- Flipper(栈)
- hdu 3328 Flipper(栈)
- HDU 3328 Flipper [模拟]
- hdu3328(Flipper)经典栈类
- hdu 3328 Flipper 模拟题
- Flipper
- Flipper
- Flipper
- UVALive4536 POJ3824 HDU3328 Flipper【模拟+堆栈】
- HDU 3328 Flipper (stack)
- HDU 3328 Flipper 栈的应用
- HDU 3328 Flipper(优先队列)
- [DP]暗黑破坏神
- Java中 == 和 equlas() 的区别
- MyFlag Step3: 界面设计初步
- 乐学成语
- lca的tarjan算法(离线)
- Flipper (栈模拟)
- 搭建SSM框架
- NVIDIA Jetson TX1 系列开发教程之二:刷机与开发前准备
- php获取文件扩展名的6种方法
- 快速理解和使用 ES7 await/async
- OpenOffice设置命令
- 算法练习
- android实现简单底部导航条
- Dell服务器R920配置小结