Pagini recente » Cod sursa (job #531462) | Cod sursa (job #216417) | Cod sursa (job #1647720) | Cod sursa (job #2117900) | Cod sursa (job #2159586)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
int n,m,i,j,pi,ps,l,cool,x1,k;
ifstream f("rj.in");
ofstream g("rj.out");
char a[100];
int di[9]={0,-1,-1,-1,0,0,1,1,1};
int dj[9]={0,-1,0,1,-1,1,-1,0,1};
int dmin=999999;
struct
{
int nr,t;
}v[101][101];
struct
{
int lin,col;
}c[10201];
int main()
{
f>>n>>m;
f.get();
for(i=1;i<=n;i++)
{
f.get(a,100);
f.get();
for(j=0;j<m;j++)
{
if(a[j]=='X')
v[i][j+1].nr=-1;
if(a[j]=='R')
{
pi++;
v[i][j+1].nr=1;
v[i][j+1].t=1;
c[pi].lin=i;
c[pi].col=j+1;
}
if(a[j]=='J')
{
pi++;
v[i][j+1].nr=1;
v[i][j+1].t=2;
c[pi].lin=i;
c[pi].col=j+1;
}
}
}
ps=1;
while(ps<=pi)
{
for(i=1;i<=8;i++)
{
if(c[ps].lin+di[i]>0&&c[ps].lin+di[i]<=n&&c[ps].col+dj[i]>0&&c[ps].col+dj[i]<=m)
{
k=c[ps].lin+di[i];
l=c[ps].col+dj[i];
if(v[k][l].nr==0)
{
pi++;
c[pi].lin=k;
c[pi].col=l;
v[k][l].nr=v[c[ps].lin][c[ps].col].nr+1;
v[k][l].t=v[c[ps].lin][c[ps].col].t;
}
else
{
if(v[k][l].t!=v[c[ps].lin][c[ps].col].t&&v[k][l].nr==v[c[ps].lin][c[ps].col].nr+1&&v[k][l].nr!=-1)
{
if(v[k][l].nr<dmin)
{
dmin=v[k][l].nr;
x1=k;
cool=l;
}
else
{
if(v[k][l].nr==dmin)
{
if(k<x1)
{
x1=k;
cool=l;
}
else
{
if(k==l)
{
if(l<cool)
cool=l;
}
}
}
}
}
}
}
}
ps++;
}
g<<dmin<<" "<<x1<<" "<<cool;
return 0;
}