ACM: 简单题 uva 10881
来源:互联网 发布:电脑网络连接显示未知 编辑:程序博客网 时间:2024/06/01 08:43
the ants will soon be here. And I, for one, welcome our
new insect overlords."Kent Brockman
Piotr likes playing with ants. He has n of them on ahorizontal pole L cm long. Each ant is facing either left orright and walks at a constant speed of 1 cm/s. When two ants bumpinto each other, they both turn around (instantaneously) and startwalking in opposite directions. Piotr knows where each of the antsstarts and which direction it is facing and wants to calculatewhere the ants will end up T seconds from now.
Input
The first line of input gives the number of cases, N.N test cases follow. Each one starts with a line containing3 integers: L , T and n
Output
For each test case, output one line containing "Case #x:"followed by n lines describing the locations and directionsof the n ants in the same format and order as in the input.If two or more ants are at the same location, print "Turning"instead of "L" or "R" for their direction. If an ant falls off thepole before T seconds, print "Fell off" for that ant.Print an empty line after each test case.
Sample Input
2
10 1 4
1 R
5 R
3 L
10 R
10 2 3
4 R
5 L
8 R
Sample Output
Case #1:
2 Turning
6 R
2 Turning
Fell off
Case #2:
3 L
6 R
10 R
题意: 有n只蚂蚁在一根长为L厘米的木棍上爬, 方向只有左右, 每1s行走1厘米, 蚂蚁相碰时会同时转向.
解题思路:
代码:
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
#define MAX 10005
struct node
{
};
char dire[3][10] = {"L", "Turning", "R"};
int L, T, n;
int order[MAX];
int main()
{
//