Submission #493290

#	Time	Username	Problem	Language	Result	Execution time	Memory
493290		inksamurai	Zoo (COCI19_zoo)	C++17	0 / 110	1 ms	204 KiB

zoo

#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 _3cSpNGp 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>;

int main(){
_3cSpNGp;
	int h,w;
	cin>>h>>w;
	vec(vec(char)) a(h,vec(char)(w));
	rep(i,h)rep(j,w){
		cin>>a[i][j];
	}
	vec(vi) usd(h,vi(w,0));
	const int di[]={1,-1,0,0};
	const int dj[]={0,0,1,-1};
	auto dfs=[&](auto self,int x,int y)->void{
		usd[x][y]=1;
		rep(dir,4){
			int nex=x+di[dir],ney=y+dj[dir];
			if(min(nex,ney)>=0 and nex<h and ney<w){
				if(!usd[nex][ney] and a[nex][ney]==a[x][y]){
					self(self,nex,ney);
				}
			}
		}
		return;
	};
	int b=0,t=0;
	rep(i,h){
		rep(j,w){
			if(a[i][j]!='*' and !usd[i][j]){
				if(a[i][j]=='B') b++;
				else t++;
				dfs(dfs,i,j);
			}
		}
	}
	b=min(b,2);
	t=min(t,2);
	cout<<b+t<<"\n";
//	
	return 0;
}

• Subtask 1: 0 / 45
• Subtask 2: 0 / 65