8911 - 거북이

문제 보기


간단한 좌표 문제 였던거 같다.

접힌 상태

펼친 상태

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

#include <bits/stdc++.h> using namespace std; typedef long long LL;   const int dx[]={0,1,0,-1}; const int dy[]={1,0,-1,0};   int main(){     int t;     scanf("%d",&t);     for(;t--;){         char arr[502];         scanf(" %s",arr);         int u=0,d=0,r=0,l=0,x=0,y=0;         int dir=0;                  int n=strlen(arr);                  for(int i=0;i<n;i++){             if(arr[i]=='F'){                 x=x+dx[dir];                 y=y+dy[dir];                                  u=max(u,y);                 r=max(r,x);                 d=min(d,y);                 l=min(l,x);             }             else if(arr[i]=='B'){                 x=x-dx[dir];                 y=y-dy[dir];                                  u=max(u,y);                 r=max(r,x);                 d=min(d,y);                 l=min(l,x);             }             else if(arr[i]=='L'){                 dir=(dir+3)%4;             }             else{                 dir=(dir+1)%4;             }         }                  printf("%d\n",(u-d)*(r-l));     }               return 0; }

cs