Pagini recente » Cod sursa (job #2871696) | Cod sursa (job #2160674) | Cod sursa (job #2885297) | Cod sursa (job #1590248) | Cod sursa (job #2838499)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("castel.in");
ofstream cout ("castel.out");
int n,m,k,ans,v[22600],a[22600];
vector <int> c[22600];
void castel(int i)
{
int j;
if (v[i]!=0)
return;
v[i]=1;
ans++;
if (i%m!=0 && v[a[i-1]]!=0)
castel(i-1);
if (i%m!=m-1 && v[a[i+1]]!=0)
castel(i+1);
if (i+m<n*m && v[a[i+m]]!=0)
castel(i+m);
if (i-m>=0 && v[a[i-m]]!=0)
castel(i-m);
for (j=0; j<c[i].size(); j++)
if ((c[i][j]%m!=0 && v[c[i][j]-1]!=0) || (c[i][j]%m!=m-1 && v[c[i][j]+1]!=0) || (c[i][j]+m<n*m && v[c[i][j]+m]!=0) || (c[i][j]-m>=0 && v[c[i][j]-m]!=0))
castel(c[i][j]);
}
int main()
{
int i;
cin>>n>>m>>k;
for (i=1; i<=n*m; i++)
{
cin>>a[i];
c[a[i]].push_back(i);
}
castel(k);
cout<<ans;
return 0;
}