CLOCK - Chỉnh đồng hồ

Tác giả: happyboy99x

Ngôn ngữ: C++

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define sz(a) int((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(), _e = (c).end(); i != _e; ++i)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i,n) for(int i = 0, _n = (n); i < _n; ++i)
#define repd(i,n) for(int i = (n)-1; i >= 0; --i )
#define fo(i,a,b) for(int i = (a), _b = (b); i <= _b; ++i)
#define fod(i,a,b) for(int i = (a), _b = (b); i >= _b; --i)

#define INF 1000000000
#define N

bool vst[1<<18];
char nx[] = {0x31,0x32,0x33,0x30};
int move[9][5] = {
	{0,1,3,4,9}, {0,1,2,9,9}, {1,2,4,5,9},
	{0,3,6,9,9}, {1,3,4,5,7}, {2,5,8,9,9},
	{3,4,6,7,9}, {6,7,8,9,9}, {4,5,7,8,9}};

int hash(const char * s) {
	int res = 0;
    repd(i,9) res = res * 4 + s[i] - 0x30;
	return res;
}

int next(int s, int * a) {
    for(int i = 0; i < 5 && a[i] != 9; ++i)
        s = (s&(~(3 << (a[i]+a[i]))))|(((((s&(3<<(a[i]+a[i])))>>(a[i]+a[i]))+1)%4)<<(a[i]+a[i]));
	return s;
}

char x[10];

int main() {
	scanf("%s%s%s",x,x+3,x+6);
	queue<int> qu; qu.push(hash(x)); vst[hash(x)]=1;
	for(int step = 0; !qu.empty(); step++) {
		rep(K,qu.size()) {
            int s (qu.front()); qu.pop();
			if(s == 0) { printf("%d\n", step); return 0; }
			rep(i,9) {
				int ns = (next(s,move[i]));
				if(!vst[ns]) {
					vst[ns] = 1;
					qu.push(ns);
				}
			}
		}
	}
	return 0;
}

Download