ICPC Dhaka Regional- 2019

	///Problem link: https://algo.codemarshal.org/contests/icpc-dhaka-19-onsite-main/problems/H
	/// editorial: http://en.shafaetsplanet.com/acm-icpc-2019-dhaka-regional-problem-h-droplets/?fbclid=IwAR1iKvIEZ-B70Q20YGsw6N989F0zBlNzG7ee1RmXpIoEMg2wPB92sqAyfTk
	#include <bits/stdc++.h>
	using namespace std;
	#define INF 1<<30
	#define endl '\n'
	#define maxn 100005
	#define tc printf("Case %d: ", cs)
	#define tcn printf("Case %d:\n", cs);
	#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	typedef long long ll;
	const double PI = acos(-1.0);
	#define dbg1(x) cerr << #x << " = " << x << endl;
	#define dbg2(x, y) cerr << #x << " = " << x << ", " << #y << " = " << y << endl;
	#define dbg3(x, y, z) cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " << z << endl;
	#define dbg4(w,x, y, z) cerr << #w << " = " << w << ", " <<#x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " << z << endl;
	template < typename F, typename S >
	ostream& operator << ( ostream& os, const pair< F, S > & p ) {
	return os << "(" << p.first << ", " << p.second << ")";
	}
	template < typename T >
	ostream &operator << ( ostream & os, const vector< T > &v ) {
	os << "{";
	for (auto it = v.begin(); it != v.end(); ++it) {
	if ( it != v.begin() ) os << ", ";
	os << *it;
	}
	return os << "}";
	}
	template < typename T >
	ostream &operator << ( ostream & os, const set< T > &v ) {
	os << "[";
	for (auto it = v.begin(); it != v.end(); ++it) {
	if ( it != v.begin()) os << ", ";
	os << *it;
	}
	return os << "]";
	}
	template < typename F, typename S >
	ostream &operator << ( ostream & os, const map< F, S > &v ) {
	os << "[";
	for (auto it = v.begin(); it != v.end(); ++it) {
	if ( it != v.begin() ) os << ", ";
	os << it -> first << " = " << it -> second ;
	}
	return os << "]";
	}
	#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
	clock_t tStart = clock();
	#define timeStamp dbg("Execution Time: ", (double)(clock() - tStart)/CLOCKS_PER_SEC)
	void faltu () { cerr << endl; }
	template <typename T>
	void faltu( T a[], int n ) {
	for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
	cerr << endl;
	}
	template <typename T, typename ... hello>
	void faltu( T arg, const hello &... rest) { cerr << arg << ' '; faltu(rest...); }
	// Program showing a policy-based data structure.
	#include <ext/pb_ds/assoc_container.hpp> // Common file
	#include <ext/pb_ds/tree_policy.hpp>
	#include <functional> // for less
	#include <iostream>
	using namespace __gnu_pbds;
	using namespace std;
	// GNU link : https://goo.gl/WVDL6g
	typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update>
	new_data_set;
	/**___________________________________________________**/
	const int N = 102;
	char grid[N][N];
	bool vis[N][N];
	bool dp[N][N][5];
	int dx[] = { -1, 0, 1, 0};
	int dy[] = {0, -1, 0, 1};
	void dfs(int i, int j, int n, int m, int &ans)
	{
	if (vis[i][j]) return;
	vis[i][j] = 1;
	ans++;
	for (int k = 0; k < 4; k++) {
	if (dp[i][j][k] == 0) {
	int x = i + dx[k];
	int y = j + dy[k];
	if (x >= 0 && x < n - 1 && y >= 0 && y < m - 1)
	dfs(x, y, n, m, ans);
	}
	}
	}
	int main()
	{
	//FASTIO
	///*
	#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	freopen("error.txt", "w", stderr);
	#endif
	//*/
	int T;
	//scanf("%d", &T);
	T = 1;
	cin >> T;
	for (int cs = 1; cs <= T; cs++) {
	memset(vis, 0, sizeof vis);
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> grid[i];
	for (int i = 0; i < n - 1; i++) {
	for (int j = 0; j < m - 1; j++) {
	int Dx = i + 1;
	int Dy = j;
	int rx = i;
	int ry = j + 1;
	bool top = (grid[i][j] == 'R' || grid[i][j] == 'B');
	bool lft = (grid[i][j] == 'D' || grid[i][j] == 'B');
	bool bottom = (grid[Dx][Dy] == 'R' || grid[Dx][Dy] == 'B');
	bool rgt = (grid[rx][ry] == 'D' || grid[rx][ry] == 'B');
	dp[i][j][0] = top;
	dp[i][j][1] = lft;
	dp[i][j][2] = bottom;
	dp[i][j][3] = rgt;
	}
	}
	int ans = 0;
	for (int j = 0; j < m - 1; j++) {
	int i = 0;
	if (dp[i][j][0] == 0) {
	dfs(i, j, n, m, ans);
	//dbg(ans,i,j);
	}
	}
	printf("Case %d: %d\n", cs, ans);
	//cerr << "---------------------\n";
	}
	return 0;
	}

view raw ICPC_Dhaka_regional_H.cpp hosted with ❤ by GitHub

Share: