Lehmät

#include<bits/stdc++.h>
using namespace std;
typedef long long ll; 
 
 
int n, m, cnt=0, cnt2=0;
vector<vector<char>>g; 
int vis[100][100]; 
int hori[]={1,-1,0,0}, vert[]={0,0,1,-1};
 
 
void dfs(int x, int y){
vis[x][y]=1; 
for(int i=0; i<4; ++i){
		int dx=x+hori[i], dy=y+vert[i]; 
		if(g[x][y]=='@'){
			cnt2++;
		if(0<=dx && dx<n && 0<=dy && dy< m && !vis[dx][dy]) dfs(dx, dy); 
 
	}
}
cout << cnt2 << "\n"; 
}
 
 
int main(){
cin>>n>>m;
 
 
for(int i=0; i<n; ++i){
	for(int j=0; j<m; ++j){
		if(cnt==0 || cnt==2)vis[i][j]=1; 
		cin>>g[i][j];
		if(g[i][j]=='*'){cnt++; vis[i][j]=1;}
		
	
}
}
 
for(int i=0; i<n; ++i){
	for(int j=0; j<m; ++j){
		if(!vis[i][j]) dfs(i,j); 
	}
}
}

Test 1

Group: 1, 2

Verdict: RUNTIME ERROR

Test 2

Group: 1, 2

Verdict: RUNTIME ERROR

Test 3

Group: 1, 2

Verdict: RUNTIME ERROR

Test 4

Group: 1, 2

Verdict: RUNTIME ERROR

Test 5

Group: 1, 2

Verdict: RUNTIME ERROR

Test 6

Group: 2

Verdict: RUNTIME ERROR

Test 7

Group: 2

Verdict: RUNTIME ERROR

Test 8

Group: 2

Verdict: RUNTIME ERROR

Test 9

Group: 2

Verdict: RUNTIME ERROR