USACO Clocks

最新推荐文章于 2018-02-17 00:09:28 发布

jinTester

最新推荐文章于 2018-02-17 00:09:28 发布

阅读量353

点赞数

分类专栏： USACO 文章标签： USACO

本文链接：https://blog.csdn.net/jinjiahao5299/article/details/38519041

版权

USACO 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

/*
ID: jinusac1
PROG: clocks
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int ss[400000],p[400000],c=1,total[400000]={0};
char Hash[9][6]={"ABDE","ABC","BCEF",
				"ADG","BDEFH","CFI",
				"DEGH","GHI","EFHI"};
queue<int> q;
int bfs()
{
	q.push(0);
	int f;
	while(!q.empty()){
		f=q.front();
		q.pop();
		for(int i=(ss[f]>>27);i<9;i++){
			if(((total[f]>>(3*i))&3)==3) continue;
			total[c]=total[f]+(1<<(3*i));
			ss[c]=(ss[f]&67108863);
			for(int j=0;Hash[i][j];j++){
				ss[c]+=(1<<(3*(Hash[i][j]-'A')));
				int a=(3*(Hash[i][j]-'A'+1))-1;
				int b=ss[c]>>a;
				int d=(1<<(3*(Hash[i][j]-'A'+1)-1));
				if(b%2==1) ss[c]-=d;
			}
			ss[c] |= (i<<27);
			p[c]=f;
			if((ss[c]&57521883)==57521883) 
				return c;
			q.push(c);c++;
		}
	}
}
int main()
{
	freopen("clocks.in","r",stdin);
	freopen("clocks.out","w",stdout);
	int t;
	for(int i=0;i<9;i++){
		cin>>t;
		t >>= 2;
		t <<= 3*i;
		ss[0] |= t;
	}
	int r=bfs(),i=0,re[100];
	while(r){
		re[i++]=(ss[r]>>27);
		r=p[r];
	}
	for(int j=i-1;j>0;j--) cout<<re[j]+1<<" ";
	cout<<re[0]+1<<endl;
	return 0;
}