Cod sursa(job #2704312)

Utilizator DauCuDalta43Diaconu Razvan DauCuDalta43 Data 10 februarie 2021 11:40:56
Problema Barbar Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.4 kb
#include <bits/stdc++.h>
using namespace std;

ifstream fin("barbar.in");
ofstream fout("barbar.out");

int n,m;
char a[1005][1005];
int parlit[1005][1005];
int nudauinapoi[1005][1005];
int ddragon[1005][1005];
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};


queue< pair<int,int> >q;

void CitireSoieiSEbi()
{
    fin>>n>>m;
    fin.get();
    for(int i=1;i<=n;i++)
        fin.getline(a[i]+1);
}

void TemnitaArePereri()
{
    int i,j;
    for(i=0;i<=n+1;i++)
        a[i][0]=a[i][m+1]='*';
    for(j=0;j<=m+1;j++)
        a[0][j]=a[n+1][j]='*';
}

void IntrunTimpIndepartat()
{
    int i,j;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            ddragon[i][j]==nudauinapoi[i][j]=1e9;
}

void ImagineDragons()
{
    int i,j,k,x,y;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            if(a[i][j]=='D')
    {
        q.push({i,j});
        ddragon[i][j]=0;
    }
    while(!q.empty())
    {
        x=q.front().first;
        y=q.front().second;
        for(k=0;k<4;k++)
        {
            i=x+dx[k];
            j=y+dy[k];
            if(ddragon[i][j]>ddragon[x][y]+1)
            {
                ddragon[i][j]=ddragon[x][y]+1;
                q.push({i,j});
            }
        }
    }
}

void FISkemaLL()
{

}

int main()
{
    CitireSoieiSEbi();
    TemnitaArePereri();
    IntrunTimpIndepartat();
    ImagineDragons();
    return 0;
}