2015 HUAS Summer Training#2~B
2015-07-22 14:37
399 查看
Description
Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a "war"-like card game.
The rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins.
You have to calculate how many fights will happen and who will win the game, or state that game won't end.
Input
First line contains a single integer n (2 ≤ n ≤ 10), the number of cards.
Second line contains integer k1 (1 ≤ k1 ≤ n - 1), the number of the first soldier's cards. Then follow k1 integers that are the values on the first soldier's cards, from top to bottom of his stack.
Third line contains integer k2 (k1 + k2 = n), the number of the second soldier's cards. Then follow k2 integers that are the values on the second soldier's cards, from top to bottom of his stack.
All card values are different.
Output
If somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.
If the game won't end and will continue forever output - 1.
Sample Input
Input
Output
Input
Output
#include<cstdio>
#include<queue>
using namespace std;
int main()
{
int n,x,i,t;
queue<int>A,B;
scanf("%d",&n);
if(n>=2&&n<=10)
{
scanf("%d",&x);
for(i=1;i<=x;i++)
{
int k;
scanf("%d",&k);
A.push(k);
}
scanf("%d",&t);
for(i=1;i<=t;i++)
{
int k;
scanf("%d",&k);
B.push(k);
}
int count=0;
while(!A.empty()&&!B.empty())
{
if(count>1000) break;
else
{
int a=A.front();
int b=B.front();
if(a>b)
{
A.pop();
B.pop();
A.push(b);
A.push(a);
count++;
}
else
{
A.pop();
B.pop();
B.push(a);
B.push(b);
count++;
}
}
}
if(A.empty()) printf("%d 2\n",count);
else if(B.empty()) printf("%d 1\n",count);
else printf("-1\n");
}
return 0;
}
Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a "war"-like card game.
The rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins.
You have to calculate how many fights will happen and who will win the game, or state that game won't end.
Input
First line contains a single integer n (2 ≤ n ≤ 10), the number of cards.
Second line contains integer k1 (1 ≤ k1 ≤ n - 1), the number of the first soldier's cards. Then follow k1 integers that are the values on the first soldier's cards, from top to bottom of his stack.
Third line contains integer k2 (k1 + k2 = n), the number of the second soldier's cards. Then follow k2 integers that are the values on the second soldier's cards, from top to bottom of his stack.
All card values are different.
Output
If somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.
If the game won't end and will continue forever output - 1.
Sample Input
Input
4 2 1 3 2 4 2
Output
6 2
Input
3 1 2 2 1 3
Output
-1 解题思路:本题其实是一个队列问题,输入数据后将它们各自放入自己的队列中,然后一一拿出来进行比较,哪一方的数字比较大就把数字放进哪一个队列中,需要注意的是要先将对方的数放进去再放自己的。当不能判断胜负时又是另一种输出。还要注意的是判断循环继续的条件时要将条件放大点。 程序代码:
#include<cstdio>
#include<queue>
using namespace std;
int main()
{
int n,x,i,t;
queue<int>A,B;
scanf("%d",&n);
if(n>=2&&n<=10)
{
scanf("%d",&x);
for(i=1;i<=x;i++)
{
int k;
scanf("%d",&k);
A.push(k);
}
scanf("%d",&t);
for(i=1;i<=t;i++)
{
int k;
scanf("%d",&k);
B.push(k);
}
int count=0;
while(!A.empty()&&!B.empty())
{
if(count>1000) break;
else
{
int a=A.front();
int b=B.front();
if(a>b)
{
A.pop();
B.pop();
A.push(b);
A.push(a);
count++;
}
else
{
A.pop();
B.pop();
B.push(a);
B.push(b);
count++;
}
}
}
if(A.empty()) printf("%d 2\n",count);
else if(B.empty()) printf("%d 1\n",count);
else printf("-1\n");
}
return 0;
}
相关文章推荐
- 2015 Multi-University Training Contest 1 - 1002 Assignment
- Hdu 2015 Multi-University Training Contest1
- tail 命令
- RAID选项
- PEM (Privacy Enhanced Mail) Encoding
- 跨进程调用Service(AIDL Service)
- HDU 5293 TREE CHAIN PROBLEM LCT+树形DP
- 最高分辨率行间转移CCD图像传感器 - KAI-47051 演示视频
- 【图论】2015 Multi-University Training Contest 1 1007
- POJ 3250 Bad Hair Day(单调栈)
- hdu 5299 Circles Game 2015 Multi-University Training Contest 1 计算几何+博弈SG函数 圆的扫描线
- uva 11374 Airport Express (Dijkstra)
- hdu 5289 Assignment(2015 Multi-University Training Contest 1)
- hdoj 2473 Junk-Mail Filter 【并查集的删除 】
- Rails中的使用者验证:Devise
- Snail—OC学习之可变数组NSMutableArray
- Snail—OC学习之数组NSArray
- 2015 Multi-University Training Contest 1 Tricks Device
- Constraint.constant动画效果
- AIX 5L 系统管理技术 —— 存储管理——卷组