Pagini recente » Cod sursa (job #835373) | Cod sursa (job #2622172) | Cod sursa (job #2622293) | Cod sursa (job #2606088) | Cod sursa (job #820793)
Cod sursa(job #820793)
#include<fstream>
#define NMAX 105
using namespace std;
ifstream f("rj.in"); ofstream g("rj.out");
int n, m, x[NMAX][NMAX];
char c;
int dl[8] = {-1 , -1, -1, 0, 0, 1, 1, 1};
int dc[8] = {0, -1, 1, -1, 1, 0 , -1, 1};
struct punct
{
int l;
int c;
}q[NMAX * NMAX];
int main()
{
f>>n>>m;
int lj , cj;
for(int i = 0; i <= n + 1; ++i) x[i][0] = x[i][m + 1] = -1;
for(int j = 0; j <= m + 1; ++j) x[0][j] = x[n + 1][j] = -1;
f.get(c);
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= m; ++j)
{
f.get(c);
switch(c)
{
case 'R': q[0].l = i, q[0].c = j, x[i][j] = 1;break;
case 'X': x[i][j] = -1;break;
case 'J': lj = i, cj = j;break;
}
}
if(c != '\n') f.get(c);
}
int p = 0, u = 1;
while(p < u)
{
int l = q[p].l;
int c = q[p].c;
for(int k = 0; k < 8; ++k)
{
int ll = l + dl[k];
int cc = c + dc[k];
if(!x[ll][cc])
{
q[u].l = ll;
q[u].c = cc;
x[ll][cc] = x[l][c] + 1;
++u;
}
}
++p;
}
int nr_p = x[lj][cj];
g<<(nr_p/2) + 1<<' '<<q[(nr_p/2) + 1].l <<' '<<q[(nr_p / 2) + 1].c<<'\n';
g.close();
return 0;
}