Uva 10881 - Piotr's Ants
来源:互联网 发布:淘宝一件代发平台 编辑:程序博客网 时间:2024/06/05 03:09
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 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
Output
For 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 Tseconds, print "Fell off" for that ant. Print an empty line after each test case.
210 1 41 R5 R3 L10 R10 2 34 R5 L8 R
Case #1:2 Turning6 R2 TurningFell offCase #2:3 L6 R10 R
#include <iostream>#include <stdio.h>#include <algorithm>#include <cstring>#include <map>using namespace std;const int MAXN = 10010;int L, T, n;struct node{ int l; bool fx; //true为右 int id; }MaYi[MAXN];bool cmp(node a, node b){ return a.l<b.l;}int xb[MAXN];//找到现在的下标 map<int,int>shumu;int main(){ int t, cs, i, j; int l; char c; scanf("%d",&t); //freopen("d:\out.txt","w",stdout); for(cs=1; cs<=t; cs++) { scanf("%d%d%d",&L,&T,&n); for(i=0; i<n; i++) { scanf("%d %c",&l,&c); MaYi[i].l=l; if(c=='R') MaYi[i].fx = true; else MaYi[i].fx = false; MaYi[i].id = i; } sort(MaYi,MaYi+n,cmp); shumu.clear(); //确定原来位置,以及统计现在相对位置 ,再移动蚂蚁 统计每个点的蚂蚁数目 int s = 0; for(i=0; i<n; i++) { xb[MaYi[i].id] = i; //向右 if(MaYi[i].fx) {MaYi[i].l += T; }else{MaYi[i].l -= T; } shumu[MaYi[i].l]++; } sort(MaYi,MaYi+n,cmp); printf("Case #%d:\n",cs); for(i=0; i<n; i++) { int a = xb[i]; int d = MaYi[a].l; if(MaYi[a].fx) { if(d>=0 && d<=L) { if(shumu[d]==1) { printf("%d R\n",d); }else{ printf("%d Turning\n",d); } }else{ printf("Fell off\n"); } }else{ if(d>=0 && d<=L) { if(shumu[d]==1) { printf("%d L\n",d); }else{ printf("%d Turning\n",d); } }else{ printf("Fell off\n"); } } } printf("\n"); } return 0;}
Problemsetter: Igor Naverniouk
Alternate solutions: Frank Pok Man Chu and Yury Kholondyrev
- UVa - 10881 - Piotr's Ants
- uva 10881 - Piotr's Ants
- Uva-10881-Piotr's Ants
- uva 10881 - Piotr's Ants
- UVa 10881 Piotr's Ants
- UVA 10881 Piotr's Ants
- Piotr's ants UVA 10881
- UVa 10881 - Piotr's Ants
- UVa 10881 Piotr's Ants
- UVA - 10881 Piotr's Ants
- uva 10881 Piotr's Ants
- UVA - 10881 Piotr's Ants
- UVa 10881 - Piotr's Ants
- UVa 10881 - Piotr's Ants
- Uva 10881 - Piotr's Ants
- UVA 10881 Piotr's Ants
- UVA 10881 - Piotr's Ants
- 【UVA】10881-Piotr's Ants
- CodeForces 3C Tic-tac-toe 井字棋盘游戏
- Android Studio 发生 Couldn't load jpush175 from loader dalvik.system.PathClassLoader 异常
- 软件乘法
- HOG介绍3
- 获取当前具有输入焦点控件的窗口句柄
- Uva 10881 - Piotr's Ants
- MVC 简单的POST局部刷新
- LeetCode Course Schedule
- 交换机三层转发
- 删除任务栏锁定,任务栏图标的位置,查找可行性文件的方式
- ref和out
- some list operation(#quote from MIT 'introduction to computation and programming using python, Revis
- hdu1181 变形课(vector容器+dfs)
- iOS中,在类的源文件(.m)中,@interface部分的作用?