学步园

直接模拟就能过，不过刚开始看错题了。。。。

code：

/*
    ID:yueqi
    LANG:C++
    TASK:ttwo
*/
#include <set>
#include <map>
#include <ctime>
#include <queue>
#include <cmath>
#include <stack>
#include <limits.h>
#include <vector>
#include <bitset>
#include <string>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <string.h>
#include <iostream>
#include <algorithm>
#define Si set<int>
#define LL long long
#define pb push_back
#define PS printf(" ")
#define Vi vector<int>
#define LN printf("\n")
#define lson l,m,rt << 1
#define rson m+1,r,rt<<1|1
#define SD(a) scanf("%d",&a)
#define PD(a) printf("%d",a)
#define SET(a,b) memset(a,b,sizeof(a))
#define FF(i,a) for(int i(0);i<(a);i++)
#define FD(i,a) for(int i(a);i>=(1);i--)
#define FOR(i,a,b) for(int i(a);i<=(b);i++)
#define FOD(i,a,b) for(int i(a);i>=(b);i--)
#define readf freopen("ttwo.in","r",stdin)
#define writef freopen("ttwo.out","w",stdout)
const int maxn = 101;
const long long BigP=999983;
const long long  INF = 0x5fffffff;
const int dx[]={-1,0,1,0};
const int dy[]={0,1,0,-1};
const double pi = acos(-1.0);
const double eps= 1e-7;
using namespace std;
//注意dx,dy是按照顺时针的顺序排好的
int fstep,cstep;
int fx,fy,cx,cy,fdir,cdir,ans;
bool Map[12][12];
void read(){
	char buf[20];
	FOR(i,1,10){
		scanf("%s",buf);
		FOR(j,1,10){
			switch(buf[j-1]){
				case '.':
					Map[i][j]=1;break;
				case '*':
					Map[i][j]=0;break;
				case 'F':
					fx=i;fy=j;Map[i][j]=1;break;
				case 'C':
					cx=i;cy=j;Map[i][j]=1;break;
			}
		}
	}
}
void move(int &x,int &y,int &dir){
    if(Map[x+dx[dir]][y+dy[dir]]==1){
        x+=dx[dir];y+=dy[dir];
    }else dir=(dir+1)%4;
}
void solve(){
    int ans=0;

    while(!(fx==cx&&fy==cy) && ans<100000){
        //printf("stert fx:%d fy:%d cx:%d cy:%d\n",fx,fy,cx,cy);
        move(fx,fy,fdir);
        move(cx,cy,cdir);
        //printf("end   fx:%d fy:%d cx:%d cy:%d\n",fx,fy,cx,cy);
        ans++;
    }
    if(ans!=100000){ PD(ans);LN;
    }else puts("0");
}
int main(){
    readf;
    writef;
    read();
    solve();
    return 0;
}