Cod sursa(job #2125763)

Utilizator cipri321Marin Ciprian cipri321 Data 8 februarie 2018 18:28:03
Problema Castel Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.2 kb
#include <fstream>
#include <vector>
#define DIM 155
using namespace std;
ifstream fi("castel.in");
ofstream fo("castel.out");
int m,n,k;
int A[DIM][DIM];
int dl[]={-1,0,1,0},dc[]={0,1,0,-1};
vector<pair<int,int> > V;
int G[DIM*DIM];
int VIZ[DIM][DIM];
bool ok;
int rez;
int li,ci,poz;
bool ins(int l,int c)
{
    return 1<=l&&l<=m&&1<=c&&c<=n;
}
void gaseste(int l,int c)
{
    for(int d=0;d<4;d++)
    {
        int ln=l+dl[d],cn=c+dc[d];
        if(ins(ln,cn))
            if(!VIZ[ln][cn]&&G[A[ln][cn]])
            {
                V.push_back(make_pair(ln,cn));
                VIZ[ln][cn]=1;
                G[(ln-1)*n+cn]=1;
                ok=true;
            }
    }
}
int main()
{
    fi>>m>>n>>k;
    G[k]=1;
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
        {
            fi>>A[i][j];
            poz++;
            if(poz==k)
                li=i,ci=j;
        }
    V.push_back(make_pair(li,ci));
    VIZ[li][ci]=1;
    int p=0;
    do
    {
        ok=false;
        p++;
        for(int i=0;i<V.size();i++)
            gaseste(V[i].first,V[i].second);
    }while(ok);
    fo<<V.size();
    fi.close();
    fo.close();
    return 0;
}