// "Say:He is the Most Merciful,We have believed in him and upon him we have relied" [67:29]
//#pragma GCC optimize ("Ofast")
//#pragma GCC target ("avx2")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
*/
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<ll> vll;
typedef vector<int> vii;
typedef map<int,int> mpi;
typedef map<ll,ll> mpl;
typedef unordered_map<int,int> umpi;
typedef unordered_map<ll,ll> umpl;
#define ump unordered_map
#define mod 1000000007
#define inf 1000000000000000006
#define infi 1000000009
#define ff first
#define ss second
#define pb push_back
#define all(v) v.begin(), v.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
#define pi acos(-1.0)
#define dec(n) fixed << setprecision(n)
#define N 200005
//#define int long long
int n,m,cc;
string s[1005];
int fx[]={+1,-1,0,0};
int fy[]={0,0,-1,+1};
bool isval(int x,int y){
if(x>=0 && x<n && y>=0 && y<m) return 1;
return 0;
}
void dfs(int x,int y){
char c=s[x][y];
s[x][y]='*';
for(int i=0;i<4;i++){
if(isval(x+fx[i],y+fy[i]) && s[x+fx[i]][y+fy[i]]==c) dfs(x+fx[i],y+fy[i]);
}
return;
}
void solve(){
cin >> n >> m;
for(int i=0;i<n;i++) cin >> s[i];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(s[i][j]!='*'){
dfs(i,j);
cc++;
}
}
}
cout << cc << endl;
}
signed main(){
fastio;
//srand(chrono::steady_clock::now().time_since_epoch().count());
int T=1,cs=0;
//cin >> T;
while(T--){
//cout << "Case " << ++cs << ":" << " " ;
solve();
}
}
Compilation message
zoo.cpp: In function 'int main()':
zoo.cpp:80:13: warning: unused variable 'cs' [-Wunused-variable]
80 | int T=1,cs=0;
| ^~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |