Pagini recente » Cod sursa (job #1529864) | Cod sursa (job #407772) | Cod sursa (job #741356) | Cod sursa (job #1543448) | Cod sursa (job #714880)
Cod sursa(job #714880)
#include<fstream>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
int i,j,n,m,z,ok,k,y,tmin,a[103][103],b[103][103];
char x;
int main()
{f>>n>>m;
f.get();
for (i=1;i<=n;i++)
{for (j=1;j<=m;j++)
{f.get(x);
if (x=='X')
{a[i][j]=-1;
b[i][j]=-1;}
else
if (x=='J')
b[i][j]=1;
else
if (x=='R')
a[i][j]=1;}
f.get();}
for (i=0;i<=n+1;i++)
{a[i][0]=-1;
b[i][0]=-1;
a[i][m+1]=-1;
b[i][m+1]=-1;}
for (j=0;j<=m+1;j++)
{a[0][j]=-1;
b[0][j]=-1;
a[n+1][j]=-1;
b[n+1][j]=-1;}
ok=1;
k=1;
while (ok)
{ok=0;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
if (a[i][j]==k)
{if (a[i-1][j]==0)
{a[i-1][j]=k+1;
ok=1;}
if (a[i-1][j+1]==0)
{a[i-1][j+1]=k+1;
ok=1;}
if (a[i][j+1]==0)
{a[i][j+1]=k+1;
ok=1;}
if(a[i+1][j+1]==0)
{a[i+1][j+1]=k+1;
ok=1;}
if (a[i+1][j]==0)
{a[i+1][j]=k+1;
ok=1;}
if (a[i+1][j-1]==0)
{a[i+1][j-1]=k+1;
ok=1;}
if (a[i][j-1]==0)
{a[i][j-1]=k+1;
ok=1;}
if (a[i-1][j-1]==0)
{a[i-1][j-1]=k+1;
ok=1;}}
k++;}
k=1;
ok=1;
while (ok)
{ok=0;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
if (b[i][j]==k)
{if (b[i-1][j]==0)
{b[i-1][j]=k+1;
ok=1;}
if (b[i-1][j+1]==0)
{b[i-1][j+1]=k+1;
ok=1;}
if (b[i][j+1]==0)
{b[i][j+1]=k+1;
ok=1;}
if(b[i+1][j+1]==0)
{b[i+1][j+1]=k+1;
ok=1;}
if (b[i+1][j]==0)
{b[i+1][j]=k+1;
ok=1;}
if (b[i+1][j-1]==0)
{b[i+1][j-1]=k+1;
ok=1;}
if (b[i][j-1]==0)
{b[i][j-1]=k+1;
ok=1;}
if (b[i-1][j-1]==0)
{b[i-1][j-1]=k+1;
ok=1;}}
k++;}
tmin=32000;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
if (a[i][j]==b[i][j] && a[i][j]<tmin && a[i][j]>0)
{tmin=a[i][j];
z=i;
y=j;}
g<<tmin<<" "<<z<<" "<<y;
f.close();
g.close();
return 0;}