Submission #883804

#TimeUsernameProblemLanguageResultExecution timeMemory
883804vjudge1Emacs (COCI20_emacs)C++17
50 / 50
1 ms604 KiB
#ifndef Local #pragma GCC optimize("O3,unroll-loops") const int lim=2e5+100; #else const int lim=2e3+100; #endif #include "bits/stdc++.h" using namespace std; //#define int long long #define pb push_back const int mod=1e9+7; using pii=pair<int,int>; inline void solve(){ int n,m; cin>>n>>m; string s[n]; for(int i=0;i<n;i++){ cin>>s[i]; } set<int>vis; int ans=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(s[i][j]=='*'&&!vis.count(i*m+j)){ ans++; int l=i; for(;;){ if(l<n&&s[l][j]=='*'){ l++; }else{ break; } } int r=j; for(;;){ if(r<m&&s[i][r]=='*'){ r++; }else{ break; } } for(int ll=i;ll<l;ll++){ for(int rr=j;rr<r;rr++){ vis.insert(ll*m+rr); } } } } } cout<<ans<<"\n"; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL); #ifdef Local freopen(".in","r",stdin); freopen(".out","w",stdout); #else //freopen("grass.in","r",stdin); //freopen("grass.out","w",stdout); #endif int t=1; //cin>>t; while (t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...