Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define black 1
- #define white 2
- #define none 0
- #define MAX 10000000
- #define dbg cout << "DEBUG IS SHOWING " << endl;
- int dx[] = { +1, -1, -0 , +0 };
- int dy[] = { +0, -0, +1, -1 };
- using namespace std;
- long n,m,xi,yi,isLost = false, lostx,losty ;
- char iDir;
- int grid[100][100]; bool flag[100][100];
- char dir[] = { 'N', 'E', 'S', 'W' };
- bool isok( int x, int y ){
- return (x >= 0 && x<=n && y>=0 && y<=m);
- }
- bool isSafe( int x, int y ){
- if( flag[x][y] == 0) return 1;
- return 0;
- }
- int main(){
- #ifndef ONLINE_JUDGE
- freopen( "in.txt","rt",stdin );
- #endif
- cin >> n >> m;
- for( int i=0; i<=n; i++ ){
- for( int j=0; j<=m; j++ ){
- flag[i][j] = 0;
- }
- }
- while( scanf( "%ld %ld %c",&xi,&yi, &iDir ) != EOF ){
- // cout << xi << " " << yi << " " << iDir << endl;
- char cmd[1024];
- scanf("%s",cmd);
- int curDir = 0;
- for( int i=0; i<4; i++ ) {
- if( dir[i] == iDir ){
- curDir = i; break;
- }
- }
- cout << dir[curDir] << endl;
- int tx,ty;
- for( int i=0; cmd[i]; i++ ){
- tx = xi; ty = yi;
- if( cmd[i] == 'R' ){
- curDir = (curDir+1)%4;
- }
- else if( cmd[i] == 'L' ){
- curDir = ( (curDir-1) >= 0 ) ? curDir-1 : 3;
- }
- else if ( cmd[i] == 'F' ){
- if( curDir == 0 ) yi++;
- else if ( curDir == 1 ) xi++;
- else if ( curDir == 2 ) yi--;
- else if( curDir == 3 ) xi--;
- //
- // cout << " T " << xi << " " << yi << endl;
- if( flag[yi][xi] == 1) {
- xi = tx; yi = ty;
- cout << xi << " " << yi << endl;
- continue;
- }
- if( ((xi > n || yi > m) && !flag[xi][yi]) || (xi < 0 || yi < 0 )){
- cout << tx << " " << ty << " " << dir[curDir] << " LOST" << endl;
- isLost = true;
- if( xi >= 0 && yi >= 0 )flag[yi][xi] = 1;
- break;
- }
- }
- cout << cmd[i] << " " << xi << " " << yi << " " << dir[curDir] <<endl;
- }
- if( !isLost )
- cout << xi << " " << yi << " " << dir[curDir] << endl;
- isLost = false;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement