Labyrinth

input/code.cpp: In function 'int main()':
input/code.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &n, &m, &k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:41:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %s", mat[i]);
   ~~~~~^~~~~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;

int n, m, k;
char mat[12][12];
char g[12][12];

int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
int vis[12][12];
bool ok() {
	memset(vis,0,sizeof vis);
	queue< pair<int,int> > q;
	for(int i = 0; i < n; i++) 
		for(int j = 0; j < m; j++) 
			if(g[i][j] == '.') {
				q.push({i,j});
				vis[i][j] = 1;
				goto start;
			}
	start: 
	while(!q.empty()) {
		auto tmp = q.front(); q.pop();
		for(int i = 0; i < 4; i++) {
			int tx = tmp.first + dx[i], ty = tmp.second + dy[i];
			if(min(tx,ty) < 0 || tx >= n || ty >= m) continue;
			if(g[tx][ty] == '#' || vis[tx][ty]) continue;
			vis[tx][ty] = 1;
			q.push({tx,ty});
		}
	}
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			if(!vis[i][j] && g[i][j] == '.') return false;
	return true;
}

int main() {
	scanf("%d %d %d", &n, &m, &k);
	for(int i = 0; i < n; i++) 
		scanf(" %s", mat[i]);
	long long ans = 0;
	for(int mask = 0; mask < (1<<k); mask++) {
		int ptr = 0;
		for(int i = 0; i < n; i++) 
			for(int j = 0; j < m; j++) {
				g[i][j] = mat[i][j];
				if(g[i][j] == '?') {
					g[i][j] = ((mask&(1<<ptr)) ? '#' : '.');
					ptr++;
				}
			}
		if(ok()) ans++;
	}
	printf("%lld\n", ans);
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED