forked from larissalages/code_problems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdfs_Batman.cpp
More file actions
53 lines (52 loc) · 1.1 KB
/
dfs_Batman.cpp
File metadata and controls
53 lines (52 loc) · 1.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include<bits/stdc++.h>
#define ll long long
using namespace std;
#define N 251
pair<ll,ll>mm[]{{-1,-1},{-1,0},{0,0},{0,1},{1,0},{1,1},{-1,1},{1,-1},{0,-1}};
bool isvalid(ll i,ll j,ll n,ll m)
{
return(i>=0&&j>=0&&i<n&&j<m);
}
void dfs(ll adj[N][N],ll vis[N][N],ll n,ll m,ll i,ll j,ll &cnt)
{
vis[i][j]=1;
cnt++;
for(pair<ll,ll> x:mm)
{
ll nx=i+x.first,ny=j+x.second;
if(isvalid(nx,ny,n,m)&&vis[nx][ny]==0&&adj[nx][ny]==1)
dfs(adj,vis,n,m,nx,ny,cnt);
}
}
int main()
{
ll t;
cin>>t;
while(t--)
{
ll n,m;
cin>>n>>m;
ll adj[N][N];
ll vis[N][N];
for(ll i=0;i<n;i++)
{
for(ll j=0;j<m;j++)
{
cin>>adj[i][j];
vis[i][j]=0;
}
}
ll ans=0;
for(ll i=0;i<n;i++)
{
for(ll j=0;j<m;j++)
{
ll cnt=0;
if(vis[i][j]==0&&adj[i][j]==1)
dfs(adj,vis,n,m,i,j,cnt);
ans=max(ans,cnt);
}
}
cout<<ans<<"\n";
}
}