http://poj.org/problem?id=2415 #include<iostream> #include"queue" #include"algorithm" using namespace std; char edge[51][51]; int sign[51][51][51],n,p1,p2,p3; struct node { int p[3]; int steps; }; queue<node> q; bool init() { int i,j,k; cin>>n>>p1>>p2>>p3; if(n==0)return 0; for(i=0;i<n;i++) for(j=0;j<n;j++) cin>>edge[i][j]; for(i=0;i<n;i++) for(j=0;j<n;j++) for(k=0;k<n;k++) sign[i][j][k]=0; while(!q.empty()) q.pop(); return 1; } inline void set(int a,int b,int c,int v) { sign[a][b][c]=sign[a][c][b]=sign[b][a][c]=sign[b][c][a]=sign[c][a][b]=sign[c][b][a]=v; } int doit() { int i,j; node nd,ndt; nd.p[0]=p1-1; nd.p[1]=p2-1; nd.p[2]=p3-1; nd.steps=1; set(nd.p[0],nd.p[1],nd.p[2],1); q.push(nd); while(!q.empty()) { nd=q.front();q.pop(); if(nd.p[0]==nd.p[1]&&nd.p[1]==nd.p[2]) return sign[nd.p[0]][nd.p[1]][nd.p[2]]; for(i=0;i<n;i++) { for(j=0;j<3;j++) if(!sign[i][nd.p[(j+1)%3]][nd.p[(j+2)%3]]&& edge[nd.p[j]][i]==edge[nd.p[(j+1)%3]][nd.p[(j+2)%3]]) { set(i,nd.p[(j+1)%3],nd.p[(j+2)%3],nd.steps+1); ndt=nd; ndt.steps++; ndt.p[j]=i; q.push(ndt); } } } return 0; } int main() { int ans; while(init()) { ans=doit(); if(!ans)cout<<"impossible"<<endl; else cout<<ans-1<<endl; } return 0; }
Meta
-
Recent Posts
Recent Comments
- MorrissUnime on 隆宪叁年-五一
- bngvhmxrsj on 隆宪叁年-五一
- bngvjbansj on 隆宪叁年-五一
- bngvgffiij on 隆宪叁年-五一
- MorrissUnime on 隆宪叁年-五一
Archives
- May 2024
- April 2023
- February 2023
- January 2023
- December 2022
- November 2022
- September 2022
- June 2022
- July 2021
- January 2021
- February 2020
- September 2019
- March 2018
- February 2018
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
- May 2014
- April 2014
- March 2014
- February 2014
- January 2014
- December 2013
- November 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009
- July 2009
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
Categories