Border
洛谷UVA320 点这里查看原题
难度:入门
题目描述
输入格式
输出格式
题面翻译
给定一个(x,y)二维坐标系,有t个询问,每个询问有一个初始位置和一个行走指令串(由“N”,“S”,“W”,“E”构成,“N”表示向上走,“S”表示向下走,“W”表示向左走,“E”表示向右走)。求每个询问的行走格边的外围(用“X”表示)是怎样的(见题目描述里的图),输出一个(32,32)的矩阵,每个询问之间空一行。
样例 #1
样例输入 #1
1
2 1
EENNWNENWWWSSSES.
样例输出 #1
Bitmap #1
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
................................
.XXX............................
X...X...........................
X..X............................
X...X...........................
.X..X...........................
..XX............................
答案
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
int t,x,y;
char c,a[35][35];
cin >> t;
for (int k=1;k<=t;k++){
cout << "Bitmap #" << k << endl;
memset(a,'.',sizeof(a));
cin >> x >> y;
cin >> c;
while(c!='.'){
if(c=='N'){
a[y][x]='X';
y++;
}
if(c=='S'){
a[y-1][x-1]='X';
y--;
}
if(c=='W'){
a[y][x-1]='X';
x--;
}
if(c=='E'){
a[y-1][x]='X';
x++;
}
cin >> c;
}
for (int i=31;i>=0;i--){
for (int j=0;j<=31;j++){
cout << a[i][j];
}
cout << endl;
}
cout << endl;
}
return 0;
}