UVa 10881 - Piotr's Ants
2014-02-04 17:35
351 查看
Piotr's Ants
Time Limit: 2 seconds
Piotr likes playing with ants. He has n of them on a horizontal pole L cm long. Each ant is facing either left or right and walks at a constant speed of 1 cm/s. When two ants bump into each other, they both turn around (instantaneously) and start walking
in opposite directions. Piotr knows where each of the ants starts and which direction it is facing and wants to calculate where 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 containing 3 integers: L , T and n (0 <= n <= 10000). The next n lines give the locations of the n ants (measured in cm from the left end of the pole)
and the direction they are facing (L or R).OutputFor each test case, output one line containing "Case #x:" followed by n lines describing the locations and directions of 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 the pole before T seconds, print "Fell off" for that ant. Print an empty line after each test case.Sample Input Sample Output210 1 41 R5 R3 L10 R10 2 34 R5 L8 RCase
#1:2 Turning6 R2 TurningFell offCase #2:3 L6 R10 R
Time Limit: 2 seconds
Piotr likes playing with ants. He has n of them on a horizontal pole L cm long. Each ant is facing either left or right and walks at a constant speed of 1 cm/s. When two ants bump into each other, they both turn around (instantaneously) and start walking
in opposite directions. Piotr knows where each of the ants starts and which direction it is facing and wants to calculate where 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 containing 3 integers: L , T and n (0 <= n <= 10000). The next n lines give the locations of the n ants (measured in cm from the left end of the pole)
and the direction they are facing (L or R).OutputFor each test case, output one line containing "Case #x:" followed by n lines describing the locations and directions of 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 the pole before T seconds, print "Fell off" for that ant. Print an empty line after each test case.Sample Input Sample Output210 1 41 R5 R3 L10 R10 2 34 R5 L8 RCase
#1:2 Turning6 R2 TurningFell offCase #2:3 L6 R10 R
#include <stdio.h> #include <algorithm> using namespace std; struct Ant { int id; //输入顺序 int p; //位置 int d; //朝向。-1:左;0:转身中;1:右 bool operator < (const Ant& a) const { return p < a.p; } }; const int maxn = 10000 + 5; const char dirName[][10] = {"L", "Turning", "R"}; int order[maxn]; //输入的第i只蚂蚁是终态中左数第order[i]只蚂蚁 Ant before[maxn], after[maxn]; int main() { int K; scanf("%d", &K); for (int k=1; k<=K; k++) { int L, T, n; printf("Case #%d:\n", k); scanf("%d%d%d", &L, &T, &n); for (int i=0; i<n; i++) { int p, d; char c; scanf("%d %c", &p, &c); d = (c == 'L' ? -1 : 1); before[i] = (Ant){i, p, d}; after[i] = (Ant){0, p+T*d, d}; //这里的id是未知的 } sort(before, before+n); for (int i = 0; i < n; i++) order[before[i].id] = i; sort(after, after + n); for (int i = 0; i < n - 1; i++) //修改碰撞中的蚂蚁的方向 if (after[i].p == after[i + 1].p) after[i].d = after[i + 1].d = 0; for (int i = 0; i < n; i++) { int a = order[i]; if (after[a].p < 0 || after[a].p > L) printf("Fell off\n"); else printf("%d %s\n", after[a].p, dirName[after[a].d + 1]); } printf("\n"); } return 0; }
相关文章推荐
- UVA 10881 - Piotr's Ants(思维题)
- 物联网学习笔记——构建RESTFul平台1
- 物联网
- 关于物联网框架的实践
- 基于电力线载波的物联网智能家居控制系统研究方案
- 为智能设备提供web端
- 有源信号 无源信号 模拟量 开关量 解释
- 物联网
- 物联网 毕业设计——社交物联网系统的思考
- WunderBar:零硬件开发基础也能接入物联网!
- 物联网需要自己的专有操作系统
- ORA-00600: internal error code, arguments: [kfioTranslateIO03], [], [], [], [], [], [], [], [], [],
- 学习AudioToolbox.framework之Converter Services
- 中国移动:物联网项目实战开发企业级应用(ssp框架应用、EXTJS4.2、GoogleMap、JPA)
- 云计算融合物联网促产业爆发
- 谷歌以32亿美金收购iPod之父的创业公司Nest 物联网时代来临
- Uva 10881 Piotr's Ants (模拟+思维)
- 模拟 uva 10881 - Piotr's Ants
- 高通公司AllJoyn推动全球物联网发展--关于AllJoyn
- 物联网