題目0016–Chessboard（棋盤AGameontheOnthechessboardofsize4x4thereare8whiteand8blackstones,i.e.onestoneoneachfield.Suchaconfigurationofstonesiscalledagameposition.Twostonesareadjacentiftheyareonfieldswithacommonside(i.e.theyareadjacentineitherhorizontalorverticaldirectionbutnotdiagonal).Itmeansthateachstonehasatmost4neighbours.Theonlylegalmoveinourgameisexchanginganytwoadjacentstones.Yourtaskistofindtheshortestsequenceofmovestransformingagivenstartinggamepositionintoagivenfinalgameposition.Thestartinggamepositionisdescribedinthe4linesofinputfileGAME.IN.Thereare4symbolsineachline,whichdefinethecolourofeachstoneintherowfromthelefttotheright.Thelinesdescribetherowsofthechessboardfromthetoptothebottom.Symbol`0'meansawhitestoneandsymbol`1'ablackone.Thereisnospacesymbolseparatingthesymbolsintheline.Thefifthlineisempty.Thenext4followinglinesdescribethefinalgamepositioninthesameway. lineofoutputfileGAME.OUTcontainsthenumberofthemoves.Thefollowinglinesdescribethesequenceofmovesduringthegame.Onelinedescribesonemoveanditcontains4positiveintegersR_1C_1R_2C_2separatedbysinglespaces.Thesearethecoordinatesoftheadjacentfieldsforthemove,i.e.fields[R_1,C_1]and[R_2,C_2],whereR_1(orR_2)isthenumberoftherowandC_1(orC_2)isthenumberofthecolumn.Therowsonthechessboardarenumberedfrom1(toprow)to4(bottomrow)andthecolumnsarenumberedfrom1(theleftmostcolumn)to4(therightmostone)aswell(i.e.thecoordinatesoftheleftupperfieldare[1,1]).Iftherearemultipleshortestsequencesofmovestransformingthestartingpositiontothefinalposition,youcanoutputanyoneofthem.GAME.OUT(oneofthecorrectsolutions)1224‘1’兩個字符間沒有空格。第5行為空行。第6-9行表示的目標狀態，表達方式與初始狀4R_1C_1R_2C_2R_1R_2)表示行4。GAME.OUT（答案不唯一41224（t<216<105求解，用單源最短路徑算法，復雜度為O(tlgt+E)（由于從每個點出發最多24條邊，所以E=12t<106：P1，P2dP1d次操作可以到達P2，這樣就可以建一條邊P1—>P2’，權為d。這樣就可以建立一個從{Pi}到{Pj’}的二分1的移動，1到位了，01的位置為一用為他們間的距離△x+△y，求出費用最小的最佳匹配n2/2n2/2P1P2…；n2/2個頂點，代表目標棋盤中的n2/2Q1、Q2……PiQj之間的邊擁|Pi.x-Qi.x|+