Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define ll long long
- #define test int t; cin>>t; for(int cs=1;cs<=t;cs++)
- ll n,m;
- char a[508][508];
- bool v[600][600];
- char ss;
- bool check(ll i,ll j)
- {
- if(i>=0 && i<n && j>=0 && j<m && a[i][j]==ss && v[i][j]==0) return true;
- return false;
- }
- void dfs(ll i,ll j)
- {
- v[i][j]=1;
- if(check(i+1,j)) dfs(i+1,j);
- if(check(i-1,j)) dfs(i-1,j);
- if(check(i,j+1)) dfs(i,j+1);
- if(check(i,j-1)) dfs(i,j-1);
- }
- bool cmp(pair<char,ll>a,pair<char,ll>b)
- {
- return (a.second>b.second || (a.second==b.second && a.first<b.first));
- }
- int main()
- {
- ios_base::sync_with_stdio(0);
- cin.tie(0);cout.tie(0);
- test
- {
- ll i,j,k,l;
- cin>>n>>m;
- for(i=0;i<n;i++)
- {
- for(j=0;j<m;j++)
- {
- cin>>a[i][j];
- }
- }
- map<char,ll>f;
- for(i=0;i<n;i++)
- {
- for(j=0;j<m;j++)
- {
- if(v[i][j]==0)
- {
- ss=a[i][j];
- dfs(i,j);
- f[a[i][j]]++;
- }
- }
- }
- vector<pair<char,ll>>x;
- for(char w='a';w<='z';w++)
- {
- if(f[w]>0)
- {
- x.push_back({w,f[w]});
- }
- }
- sort(x.begin(),x.end(),cmp);
- cout<<"World #"<<cs<<endl;
- for(i=0;i<x.size();i++)
- {
- cout<<x[i].first<<": "<<x[i].second<<endl;
- }
- memset(v,0,sizeof v);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement