Cod sursa(job #2125725)

Utilizator cipri321Marin Ciprian cipri321 Data 8 februarie 2018 18:00:04
Problema Castel Scor 30
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.23 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;
bool ins(int l,int c)
{
    return 1<=l&&l<=m&&1<=c&&c<=n;
}
bool gaseste(int l,int c)
{
    bool rez=false;
    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;
                rez=true;
            }
    }
    return rez;
}
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];
    V.push_back(make_pair(k/n+1,(k-1)%n+1));
    VIZ[k/n+1][(k-1)%n+1]=1;
    while(true)
    {
        ok=false;
        for(auto it:V)
            ok|=gaseste(it.first,it.second);
        if(!ok)
            break;

    }
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
            rez+=VIZ[i][j];
    fo<<rez;
    fi.close();
    fo.close();
    return 0;
}