Submission #118311

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <list>
#include <cassert>
#include <unordered_map>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define EPS 1e-9
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;

#if defined(_MSC_VER)
int popcnt(unsigned long long x) {
	int r = 0;
	while(x) r ++, x = x & (x-1);
	return r;
}
#else
inline int popcnt(unsigned long long x) { return __builtin_popcountll(x); }
#endif

int L, H, W, empties;
string a[8];
typedef unsigned long long ull;
pii dxdys[4] = {mp(0,1),mp(1,0),mp(0,-1),mp(-1,0)};
map<pair<ull,unsigned>,bool> memo;
unordered_map<ull,bool> badmemo;
bool vis[8][8];

void coloring(ull mask, int y, int x) {
	if((mask>>y*W+x&1)||vis[y][x]) return;
	vis[y][x]=true;
	rep(d, 4) coloring(mask,y+dxdys[d].first,x+dxdys[d].second);
}

bool dfs(const int y, const int x, const ull mask, const int t) {
	if(t == empties) return true;
	auto p = mp(mask,y*W+x);
	if(memo.count(p)) return memo[p];
	if(!badmemo.count(mask)) {
		mset(vis, 0); bool first=false;
		rep(i,H)rep(j,W)if(~mask>>i*W+j&1){
			if(!first) coloring(mask,i,j), first=true;
			else if(!vis[i][j]){
				return badmemo[mask] = false;
			}
		}
		badmemo[mask] = true;
	}else if(!badmemo[mask]) return false;

//	cout << y << ", " << x<< ", " << t << ": " << mask << endl;
	char perm[4]={0,1,2,3};
	random_shuffle(perm, perm+4);
	rep(d, 4) {
		int yy = y + dxdys[perm[d]].first, xx = x + dxdys[perm[d]].second;
		if(mask >> (yy * W + xx) & 1) continue;
		if(t < L-1) {
			char c = a[yy][xx];
			if(t == 0 && c == '2') continue;
			if('2' <= c && c < '0'+(L-t)) continue;
		}
		if(dfs(yy, xx, mask | (1ULL << (yy * W + xx)), t + 1))
			return memo[p] = true;
	}
	return memo[p] = false;
}

int main() {
	while(cin >> L >> H >> W, L) {
		rep(i, H) cin >> a[i];
		ull init = 0; int sy = -1, sx = -1;
		empties = 0;
		rep(i, H) rep(j, W) {
			if(a[i][j] == '#')
				init |= 1ULL << i * W + j;
			else if(a[i][j] == '1') {
				sy = i, sx = j;
				init |= 1ULL << i * W + j;
			}else empties ++;
		}
		memo.clear();
		cout << (dfs(sy, sx, init, 0) ? "Yes" : "No") << endl;
	}
	return 0;
}

Submission Info

Judge Result