Pagini recente » Cod sursa (job #365528) | Cod sursa (job #289525) | Cod sursa (job #2902846) | Cod sursa (job #815320) | Cod sursa (job #3334362)
#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
using namespace std;
int n,m,i,j,b,c;
int viz[10001];
vector<int>v[10001];
vector<int>l;
vector<int>r;
map<pair<int,int>,int>fr;
int a[101][101];
int dx[]={-1,0,1,0};
int dy[]={0,1,0,-1};
bool inside(int x, int y)
{
return x>=1 && x<=n && y>=1 && y<=m;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
int cnt=0;
for(i=1;i<=n;++i)
{
for(j=1;j<=m;++j)
{
cin>>a[i][j];
fr[{i,j}]=++cnt;
}
}
for(i=1;i<=n;++i)
{
for(j=1;j<=m;++j)
{
if(a[i][j]==1 && (i+j)%2==0)
{
l.push_back(fr[{i,j}]);
for(int =0;k<4;++k)
{
int inou=i+dx[k];
int jnou=j+dy[k];
if(a[inou][jnou]==1 && inside(inou,jnou))
{
r.push_back(fr[{inou,jnou}]);
}
}
}
}
}
return 0;
}