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
- void solve(){
- int n,m;
- cin>>n>>m;
- vector<string>s(n);
- int tot=0;
- for(int i=0 ; i<n ; i++){
- cin>>s[i];
- for(int j=0 ; j<m ; j++) tot += s[i][j] == '*';
- }
- for(int i=0 ; i<n ; i++){
- for(int j=0 ; j<m ; j++){
- if(s[i][j]=='*'){
- int cnt = 1;
- int c = 0;
- int k;
- for(k=i+1 ; k<n&&s[k][j]=='*' ; k++) c++;
- if(!c) continue;
- cnt += c;
- c=0;
- for(k=i-1 ; k>=0&&s[k][j]=='*' ; k--) c++;
- if(!c) continue;
- cnt += c;
- c=0;
- for(k=j+1 ; k<m&&s[i][k]=='*' ; k++) c++;
- if(!c) continue;
- cnt += c;
- c=0;
- for(k=j-1 ; k>=0&&s[i][k]=='*' ; k--) c++;
- if(!c) continue;
- cnt += c;
- if(cnt==tot){
- cout<<"YES\n";
- return;
- }
- }
- }
- }
- cout<<"NO\n";
- }
- int main(){
- int tc=1;
- //cin>>tc;
- while(tc--){
- solve();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement