{"id":1270,"date":"2010-10-30T09:11:47","date_gmt":"2010-10-30T01:11:47","guid":{"rendered":"http:\/\/www.slyar.com\/blog\/?p=1270"},"modified":"2022-07-03T15:46:56","modified_gmt":"2022-07-03T22:46:56","slug":"poj-1753-cpp","status":"publish","type":"post","link":"http:\/\/www.slyar.com\/blog\/poj-1753-cpp.html","title":{"rendered":"POJ 1753 Flip Game C++\u7248"},"content":{"rendered":"

\u6587\u7ae0\u4f5c\u8005\uff1a\u59dc\u5357(Slyar) <\/span>\u6587\u7ae0\u6765\u6e90\uff1aSlyar Home (www.slyar.com<\/a>) \u8f6c\u8f7d\u8bf7\u6ce8\u660e\uff0c\u8c22\u8c22\u5408\u4f5c\u3002<\/p>\n

\u5e2e\u670b\u53cbA\u7684\uff0c\u5e7f\u641c+\u4f4d\u8fd0\u7b97<\/p>\n

<\/p>\n

Description<\/span><\/p>\n

Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's black or white side up. Each round you flip 3 to 5 pieces, thus changing the color of their upper side from black to white and vice versa. The pieces to be flipped are chosen every round according to the following rules:<\/p>\n

1. Choose any one of the 16 pieces.
\n2. Flip the chosen piece and also all adjacent pieces to the left, to the right, to the top, and to the bottom of the chosen piece (if there are any).<\/p>\n

bwbw
\nwwww
\nbbwb
\nbwwb
\nHere \"b\" denotes pieces lying their black side up and \"w\" denotes pieces lying their white side up. If we choose to flip the 1st piece from the 3rd row (this choice is shown at the picture), then the field will become:<\/p>\n

bwbw
\nbwww
\nwwwb
\nwwwb
\nThe goal of the game is to flip either all pieces white side up or all pieces black side up. You are to write a program that will search for the minimum number of rounds needed to achieve this goal. <\/p>\n

Input<\/span><\/p>\n

The input consists of 4 lines with 4 characters \"w\" or \"b\" each that denote game field position.<\/p>\n

Output<\/span><\/p>\n

Write to the output file a single integer number - the minimum number of rounds needed to achieve the goal of the game from the given position. If the goal is initially achieved, then write 0. If it's impossible to achieve the goal, then write the word \"Impossible\" (without quotes).<\/p>\n

Sample Input<\/span><\/p>\n

bwwb
\nbbwb
\nbwwb
\nbwww<\/p>\n

Sample Output<\/span><\/p>\n

4<\/p>\n

Slyar:\u6bcf\u6b21\u6539\u53d8\u76f8\u90bb\u4f4d\u7f6e\uff0c\u6c42\u6700\u5c11\u6b65\u6570\u5230\u5168\u90e8\u4e00\u6837\u3002\u8fd9\u79cd\u77e9\u9635\u6c42\u6700\u5c11\u6b65\u6570\u5230\u67d0\u4e00\u72b6\u6001\u4e00\u822c\u662f\u8003\u8651BFS\u4e86\uff0c\u7136\u540e\u5c31\u662f\u600e\u4e48\u7b80\u5316\u9898\u76ee\u7684\u95ee\u9898\uff0c\u53cd\u6b63\u5c31w\u548cb\u8fd92\u4e2a\u72b6\u6001\uff0c0\u548c1\u4e5f\u662f2\u4e2a\u72b6\u6001\uff0c\u6240\u4ee5\u5f88\u5bb9\u6613\u60f3\u5230\u4e86\u4f4d\u8fd0\u7b97\uff0c16\u4e2a\u4f4d\u7f6e\u770b\u621016\u4e2a2\u8fdb\u5236\u4f4d\u5c31\u597d(\u76ee\u7684\u5c31\u662f\u51681\u6216\u51680)\uff0c\u9898\u76ee\u8981\u6c42\u76f8\u90bb\u4f4d\u7f6e\u6539\u53d8\uff0c\u6700\u8fd1\u770bMFC\u7684\u6211\u9a6c\u4e0a\u60f3\u5230\u4e86\u903b\u8f91\u64cd\u4f5c\u7b26...\u8fd9\u91cc\u7684\u60c5\u51b5\u662f\u53cd\u8f6c\uff0c\u6240\u4ee5\u7528\u5f02\u6216...\u6240\u4ee5\u7b97\u6cd5\u5c31\u5f88\u5bb9\u6613\u4e86\uff0c\u63d0\u524d\u6253\u8868\u6c42\u51fa\u6bcf\u4e00\u4f4d\u76f8\u90bb\u4f4d\u7f6e\u6539\u53d8\u540e\u7684\u503c(\u628a\u8be5\u4f4d\u7f6e\u8fde\u540c\u76f8\u90bb\u7f6e1\uff0c\u5176\u4f59\u4f4d\u7f6e\u7f6e0)\uff0c\u7136\u540eBFS\u5c31\u884c\u4e86\uff0c\u5177\u4f53\u770b\u6ce8\u91ca....\u597d\u4e45\u4e0d\u5199ACM\u7a0b\u5e8f\u4e86\uff0c\u7f16\u8bd1\u9519\u8bef\u4e863\u6b21\uff0c\u6570\u7ec4\u8d8a\u754c\u4e863\u6b21...=_=<\/span><\/p>\n

\r\n#include \r\n\r\nusing namespace std;\r\n\r\nconst int MAX = 65535;\r\n\r\n\/\/ \u6253\u8868\uff0c\u8ba1\u7b97\u5668\u5c31\u80fd\u5f97\u5230...\r\nconst int ARRAY[17] = {0,\r\n51200, 58368, 29184, 12544,\r\n35968, 20032, 10016, 4880,\r\n2248, 1252, 626, 305,\r\n140, 78, 39, 19};\r\n\r\n\/\/ \u641c\u7d22\u961f\u5217\r\nstruct\r\n{\r\n    int sum;\r\n    int step;\r\n}Queue[MAX+1] = {0};\r\n\r\n\/\/ \u641c\u7d22\u6807\u8bb0\r\nbool signal[MAX] = {0};\r\n\r\nint main()\r\n{\r\n    char ch;\r\n    \/\/ \u521d\u59cb\u961f\u5217\u4e3a\u7a7a\r\n    int head = 0;\r\n    int tail = 0;\r\n\r\n    \/\/ \u73b0\u5728\u7684\u548c\r\n    int now = 0;\r\n\r\n    \/\/ \u8bfb\u5165\u6570\u636e\r\n    tail = 1;\r\n    for(int i = 15; i >= 0; i--)\r\n    {\r\n        cin >> ch;\r\n        \/\/ \u6c4216\u4e2a2\u8fdb\u5236\u4f4d\u7684\u548c\u5165\u961f\r\n        if (ch == 'b')\r\n        {\r\n            Queue[tail].sum += (1 << i);\r\n        }\r\n        \/\/ \u6ee4\u6389\u6362\u884c\r\n        if (i % 4 == 0)\r\n        {\r\n            cin.get();\r\n        }\r\n    }\r\n\r\n    \/\/ \u548c\u5df2\u7ecf\u7b26\u5408\u8981\u6c42\r\n    if (Queue[tail].sum == 0x0000 || Queue[tail].sum == 0xFFFF)\r\n    {\r\n        head = tail + 1;\r\n    }\r\n\r\n    \/\/ \u6807\u8bb0\u641c\u7d22\r\n    signal[Queue[tail].sum] = true;\r\n\r\n    \/\/ \u961f\u5217\u4e0d\u7a7a\r\n    while (head < tail)\r\n    {\r\n        \/\/ \u51fa\u961f\u5904\u7406\r\n        head++;\r\n        \r\n        \/\/ \u641c\u7d22\r\n        for (int i = 1; i <= 16; i++)\r\n        {\r\n            \/\/ \u4f9d\u6b21\u5f02\u6216\u6253\u8868\u503c\u6c42\u548c\r\n            now = Queue[head].sum ^ ARRAY[i];\r\n            \/\/ \u548c\u6ca1\u6709\u51fa\u73b0\u8fc7\uff0c\u7ee7\u7eed\u5165\u961f\r\n            if (!signal[now])\r\n            {\r\n                tail++;\r\n                Queue[tail].sum = now;\r\n                Queue[tail].step = Queue[head].step + 1;\r\n                signal[now] = true;\r\n\r\n                \/\/ \u627e\u5230\u7ed3\u679c\r\n                if (now == 0x0000 || now == 0xFFFF)\r\n                {\r\n                    head = tail + 1;\r\n                    break;\r\n                }\r\n            }\r\n        }\r\n    }\r\n    \/\/ head > tail\uff0c\u961f\u5217\u5c31\u7206\u4e86\uff0c\u4ee5\u6b64\u6807\u8bb0\u627e\u5230\u7ed3\u679c=_=\r\n    if (head == tail + 1)\r\n    {\r\n        cout << Queue[tail].step << endl;\r\n    }\r\n    else\r\n    {\r\n        cout << \"Impossible\" << endl;\r\n    }\r\n    return 0;\r\n}\r\n<\/pre>\n
\u8f6c\u8f7d\u8bf7\u6ce8\u660e\uff1aSlyar Home<\/a> » POJ 1753 Flip Game C++\u7248<\/a><\/p>","protected":false},"excerpt":{"rendered":"
\u6587\u7ae0\u4f5c\u8005\uff1a\u59dc\u5357(Slyar) \u6587\u7ae0\u6765\u6e90\uff1aSlyar Home (www.slyar.com) \u8f6c\u8f7d\u8bf7\u6ce8\u660e\uff0c\u8c22\u8c22\u5408\u4f5c\u3002 \u5e2e\u670b\u53cbA\u7684\uff0c\u5e7f\u641c+\u4f4d\u8fd0\u7b97 \u8f6c\u8f7d\u8bf7\u6ce8\u660e\uff1aSlyar Home » POJ 1753 Flip Game C++\u7248<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1103],"tags":[1006],"class_list":["post-1270","post","type-post","status-publish","format-standard","hentry","category-acm-oj-solution","tag-poj"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t