首页 技术 正文
技术 2022年11月12日
0 收藏 726 点赞 2,346 浏览 3298 个字

http://poj.org/problem?id=1835

宇航员

Time Limit: 2000MS   Memory Limit: 30000K
Total Submissions: 4802   Accepted: 2058

Description

问题描述: 
  宇航员在太空中迷失了方向,在他的起始位置现在建立一个虚拟xyz坐标系,称为绝对坐标系,宇航员正面的方向为x轴正方向,头顶方向为z轴正方向,则宇航员的初始状态如下图所示: 
poj 1835 宇航员
现对六个方向分别标号,x,y,z正方向分别为0,1,2,负方向分别为3,4,5;称它们为绝对方向。宇航员在宇宙中只沿着与绝对坐标系xyz轴平行的方向行走,但是他不知道自己当前绝对坐标和自己面向的绝对方向。

任务描述: 
  请根据宇航员对自己在相对方向上移动的描述确定宇航员最终的绝对坐标和面向的绝对方向。对在相对方向上移动的描述及意义如下: 
forward x  向前走x米。 
back x 先转向后,再走x米。 
left x 先转向左,再走x米。 
right x 先转向右,再走x米。 
up x 先面向上,再走x米。 
down x 先面向下,再走x米。 
其中向上和向下如下图所示: 
poj 1835 宇航员

Input

第一行一个正整数m,表示测试数据的组数。每组测试数据第一行是一个正整数n(1<=n<=10000)表示宇航员行走的次数,下面n行每行输入一次相对行走,格式如上所述,其中( 1 <= x <= 10000 为正整数)。

Output

对于每组输入数据输出一行,x y z p, 中间用空格隔开,x y z是宇航员的位置的绝对坐标,p是宇航员面向的绝对方向编号(0<=p <=5)。

Sample Input

1
6
left 10
right 11
up 12
down 13
forward 14
back 15

Sample Output

23 -10 12 3

Source

qinlu@POJ  分析:暴力模拟每种状态。  AC代码:

 #include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<iostream>
#include<stack>
#include<map>
#include<string>
using namespace std;
int main(){
char ch[];
int n, t, tcase;
scanf("%d", &tcase);
while(tcase--){
scanf("%d", &n);
int face, head, x, y, z, num;
x = y = z = face = ;
head = ;
for(int i = ; i < n; i++){
scanf("%s%d", ch, &num);
if(ch[] == 'f'){
if(face == ) x += num;
if(face == ) y += num;
if(face == ) z += num;
if(face == ) x -= num;
if(face == ) y -= num;
if(face == ) z -= num;
}
else if(ch[] == 'b'){
face = (face+)%;
if(face == ) x += num;
if(face == ) y += num;
if(face == ) z += num;
if(face == ) x -= num;
if(face == ) y -= num;
if(face == ) z -= num;
}
else if(ch[] == 'l'){
if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; if(face == ) x += num;
if(face == ) y += num;
if(face == ) z += num;
if(face == ) x -= num;
if(face == ) y -= num;
if(face == ) z -= num;
}
else if(ch[] == 'r'){
if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ;
else if(face == && head == ) face = ; if(face == ) x += num;
if(face == ) y += num;
if(face == ) z += num;
if(face == ) x -= num;
if(face == ) y -= num;
if(face == ) z -= num;
}
else if(ch[] == 'u'){
t = face;
face = head;
head = (t+)%;
if(face == ) x += num;
if(face == ) y += num;
if(face == ) z += num;
if(face == ) x -= num;
if(face == ) y -= num;
if(face == ) z -= num;
}
else if(ch[] == 'd'){
t = face;
face = (head+)%;
head = t;
if(face == ) x += num;
if(face == ) y += num;
if(face == ) z += num;
if(face == ) x -= num;
if(face == ) y -= num;
if(face == ) z -= num;
}
//printf("%d %d %d %d %d\n", x, y, z, face, head);
}
printf("%d %d %d %d\n", x, y, z, face);
}
return ;
}
相关推荐
python开发_常用的python模块及安装方法
adodb:我们领导推荐的数据库连接组件bsddb3:BerkeleyDB的连接组件Cheetah-1.0:我比较喜欢这个版本的cheeta…
日期:2022-11-24 点赞:878 阅读:8,985
Educational Codeforces Round 11 C. Hard Process 二分
C. Hard Process题目连接:http://www.codeforces.com/contest/660/problem/CDes…
日期:2022-11-24 点赞:807 阅读:5,501
下载Ubuntn 17.04 内核源代码
zengkefu@server1:/usr/src$ uname -aLinux server1 4.10.0-19-generic #21…
日期:2022-11-24 点赞:569 阅读:6,345
可用Active Desktop Calendar V7.86 注册码序列号
可用Active Desktop Calendar V7.86 注册码序列号Name: www.greendown.cn Code: &nb…
日期:2022-11-24 点赞:733 阅读:6,128
Android调用系统相机、自定义相机、处理大图片
Android调用系统相机和自定义相机实例本博文主要是介绍了android上使用相机进行拍照并显示的两种方式,并且由于涉及到要把拍到的照片显…
日期:2022-11-24 点赞:512 阅读:7,763
Struts的使用
一、Struts2的获取  Struts的官方网站为:http://struts.apache.org/  下载完Struts2的jar包,…
日期:2022-11-24 点赞:671 阅读:4,839