https://www.luogu.org/problemnew/show/P1518
题解:模拟
/*
*@Author: STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=10+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v,cx,cy,ct,fx,fy,ft;
int ans,cnt,flag,temp,sum;
bool vis[N][N][4][N][N][4];
char str[N][N];
int dir[4][2]= {-1,0,0,1,1,0,0,-1};
int main()
{
#ifdef DEBUG
freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
#endif
//ios::sync_with_stdio(false);
//cin.tie(0);
//cout.tie(0);
//scanf("%d",&t);
//while(t--){
//scanf("%d",&n);
n=10;
for(int i=1;i<=10;i++){
scanf("%s",str[i]+1);
for(int j=1;j<=n;j++){
if(str[i][j]=='C'){
cx=i;
cy=j;
}else if(str[i][j]=='F'){
fx=i;
fy=j;
}
}
}
int x,y;
while(1){
if(cx==fx&&cy==fy){
ans=cnt;
break;
}
if(vis[cx][cy][ct][fx][fy][ft])
break;
cnt++;
//cout<<cnt<<endl;
vis[cx][cy][ct][fx][fy][ft]=1;
//cout<<cx<<" "<<cy<<endl;
x=cx+dir[ct][0];
y=cy+dir[ct][1];
if(1<=x&&x<=n&&1<=y&&y<=n&&str[x][y]!='*'){
cx=x;
cy=y;
}else{
ct++;
ct%=4;
}
//cout<<fx<<" "<<fy<<endl;
x=fx+dir[ft][0];
y=fy+dir[ft][1];
if(1<=x&&x<=n&&1<=y&&y<=n&&str[x][y]!='*'){
fx=x;
fy=y;
}else{
ft++;
ft%=4;
}
}
cout<<ans<<endl;
//}
#ifdef DEBUG
printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
//cout << "Hello world!" << endl;
return 0;
}