Pagini recente » Borderou de evaluare (job #491434) | Borderou de evaluare (job #678082) | Cod sursa (job #2653659) | Borderou de evaluare (job #2364983) | Cod sursa (job #2231980)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("castel.in");
ofstream out("castel.out");
int n,m,k,v[22501],a[22501],s;
vector <int> c[22501];
void castel(int i)
{ if(v[i])
return;
v[i]=1;
s++;
if(i%m!=0 && v[a[i-1]])
castel(i-1);
if(i%m!=m-1 && v[a[i+1]])
castel(i+1);
if(i+m<n*m && v[a[i+m]])
castel(i+m);
if(i-m>=0 && v[a[i-m]])
castel(i-m);
for(int j=0;j<c[i].size();j++)
if(((c[i][j]%m!=0 && v[c[i][j]-1]) || (c[i][j]%m!=m-1 && v[c[i][j]+1]) || (c[i][j]+m<n*m && v[c[i][j]+m]) || (c[i][j]-m>=0 && v[c[i][j]-m])))
castel(c[i][j]);
}
int main()
{ in>>n>>m>>k;
for(int i=1;i<=n*m;i++)
{ in>>a[i];
c[a[i]].push_back(i);
}
castel(k);
out<<s;
in.close();
out.close();
return 0;
}