제출 #501309

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
501309		inksamurai	Emacs (COCI20_emacs)	C++17	50 / 50	1 ms	588 KiB

emacs

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3qplfh5 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;

int main(){
_3qplfh5;
	int h,w;
	cin>>h>>w;
	vec(vec(char)) a(h,vec(char)(w));
	rep(i,h)rep(j,w){
		cin>>a[i][j];
	}
	int ans=0;
	vec(vi) usd(h,vi(w));
	auto dfs=[&](auto self,int i,int j)->void{
		const int di[]={1,-1,0,0};
		const int dj[]={0,0,1,-1};
		usd[i][j]=1;
		rep(dir,4){
			int nei=i+di[dir],nej=j+dj[dir];
			if(min(nei,nej)>=0 and nei<h and nej<w and a[nei][nej]=='*'){
				if(!usd[nei][nej]){
					self(self,nei,nej);
				}
			}
		}
	};
	rep(i,h){
		rep(j,w)if(!usd[i][j] and a[i][j]=='*'){
			dfs(dfs,i,j);
			ans++;
		}
	}
	printf("%d\n", ans);
//	
	return 0;
}

• Subtask 1: 50 / 50