Pagini recente » Cod sursa (job #1924398) | Cod sursa (job #1625817) | Cod sursa (job #1009055) | Cod sursa (job #1535672) | Cod sursa (job #876191)
Cod sursa(job #876191)
#include <fstream>
#include <iostream>
#include<string.h>
using namespace std;
ifstream in("rj.in");
ofstream out("rj.out");
int n,m,x1,x2,y1,y2;
const int dx[]={0,1,1,1,0,-1,-1};
const int dy[]={1,1,0,-1,-1,-1,0};
int mat[102][102];
struct c
{
int px[10404];
int py[10404];
}c;
void citire()
{
int i,j;
char v[102];
in>>n>>m;
for(i=0;i<=n;i++)
{
in.getline(v,m+1);
for(j=1;j<=m;j++)
{
if(v[j-1]=='R')
{
mat[i][j]=1;
x1=i;
y1=j;
}
if(v[j-1]=='J')
{
mat[i][j]=0;
x2=i;
y2=j;
}
if(v[j-1]=='X')mat[i][j]=-1;
if(v[j-1]==' ') mat[i][j]=0;
}
}
}
void bordare()
{
int i,j;
for (i=0;i<=n+1;i++)
{
mat[0][i]=-1;
mat[m+1][i]=-1;
}
for(i=0;i<=m;i++)
{
mat[i][0]=-1;
mat[i][n+1]=-1;
}
}
void lee()
{
int a,b,k,prim=0,ultim=0;
c.px[prim]=x1;
c.py[prim]=y1;
while (prim<=ultim&&mat[x2][y2]==0)
{
a=c.px[prim];
b=c.py[prim];
//out<<a<<" "<<b;
for(k=0;k<8;k++)
{
if( (mat[a+dx[k]][b+dy[k]]==0)&& (mat[a+dx[k]][b+dy[k]]!=-1) )
{
cout<<a+dx[k]<<" "<<b+dy[k]<<"\n";
ultim++;
c.px[ultim]=a+dx[k];
c.py[ultim]=b+dy[k];
mat[a+dx[k]][b+dy[k]]=mat[a][b]+1;
}
}
prim++;
}
}
int main()
{
int i,j;
citire();
bordare();
lee();
// out<<x1<<" "<<y1<<" "<<x2<<" "<<y2;
for(i=0;i<=n+1;i++)
{
for(j=0;j<=m+1;j++)
{
out<<mat[i][j]<<" ";
}
out<<"\n";
}
/*for(i=0;i<100;i++)
{
out<<c.px[i]<<" "<<c.py[i]<<"\n";
}
*/
in.close();
out.close();
return 0;
}