#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(string a,string b)
{
if(a.size()==b.size())
{
return a<b;
}
return a.size()<b.size();
}
char mat[20][20];
bool vis[20][20];
bool f1(int i,int j)
{
char x=mat[i][j];
if(mat[i+1][j]==x && mat[i][j+1]==x && mat[i+1][j+1]==x)
{
vis[i+1][j]=1;
vis[i][j+1]=1;
vis[i+1][j+1]=1;
return 1;
}
if(mat[i][j-1]==x && mat[i+1][j]==x && mat[i+1][j-1]==x)
{
vis[i+1][j]=1;
vis[i][j-1]=1;
vis[i+1][j-1]=1;
return 1;
}
if(mat[i-1][j]==x && mat[i][j-1]==x && mat[i-1][j-1]==x)
{
vis[i-1][j]=1;
vis[i][j-1]=1;
vis[i-1][j-1]=1;
return 1;
}
if(mat[i][j+1]==x && mat[i-1][j]==x && mat[i-1][j+1]==x)
{
vis[i-1][j]=1;
vis[i][j+1]=1;
vis[i-1][j+1]=1;
return 1;
}
return 0;
}
void solve(){
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>mat[i][j];
}
}
int fg1=0,fg2=0,fg3=0,fg4=0,fg5=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(vis[i][j])continue;
if(f1(i,j))
{
fg1++;
}
}
}
cout<<fg1<<endl<<fg2<<endl<<fg3<<endl<<fg4<<endl<<fg5;
/*
*/
}
int32_t main(){
int t=1;
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//cin>>t;
while(t--){solve();}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |