{"id":1211,"date":"2015-09-15T12:50:15","date_gmt":"2015-09-15T04:50:15","guid":{"rendered":"http:\/\/www.shuizilong.com\/house\/?p=1211"},"modified":"2015-09-15T12:50:15","modified_gmt":"2015-09-15T04:50:15","slug":"buaa-746-%e6%99%b4%e5%a4%a9%e5%b0%8f%e7%8c%aa%e5%bd%93%e5%af%bc%e6%b8%b8","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/house\/archives\/buaa-746-%e6%99%b4%e5%a4%a9%e5%b0%8f%e7%8c%aa%e5%bd%93%e5%af%bc%e6%b8%b8\/","title":{"rendered":"BUAA 746. \u6674\u5929\u5c0f\u732a\u5f53\u5bfc\u6e38"},"content":{"rendered":"<p><!--more--><br \/>\nhttp:\/\/acm.buaa.edu.cn\/contest\/116\/problem\/F\/<br \/>\nhttp:\/\/acm.buaa.edu.cn\/problem\/746\/<br \/>\nhttp:\/\/www.xuebuyuan.com\/1798536.html<\/p>\n<p>\u5fc5\u987b\u7ecf\u8fc7 | \u53ef\u4ee5\u7ecf\u8fc7\u3002\u3002 \u53c2\u8003 FZU 1977. Pandora adventure<br \/>\n  http:\/\/user.qzone.qq.com\/251815992\/blog\/1441374326<\/p>\n<p>\u683c\u5b50\u5b58\u50a8\u56db\u4e2a\u65b9\u5411\u7684\u901a\u884c\u4fe1\u606f\u3002\u3002\u53c2\u8003 ZOJ 2126. Rocket Mania<br \/>\nhttp:\/\/user.qzone.qq.com\/251815992\/blog\/1441548754 ;<br \/>\n\uff08\u4f46\u9700\u8981\u6ce8\u610f\u7684\u662f\uff01\u3002\u3002\u8fd9\u91cc\u662f\u56de\u8def\u3002\u3002\u6240\u4ee5\u4e0d\u5141\u8bb8\u63d2\u5934\u5728\u4efb\u610f\u4f4d\u7f6e\u4e2d\u65ad\uff01\uff09<\/p>\n<pre class=\"brush: cpp; light: false; title: ; toolbar: true; notranslate\" title=\"\">\r\n\r\nconst int N = 12, M = 1 &lt;&lt; 20, _M = 3;\r\n\r\nint n, m;\r\nint b&#x5B;N+1], bb&#x5B;N+1];\r\n\r\nLL encode(){\r\n    FLC(bb, -1); int n = 1; bb&#x5B;0] = 0; LL s = 0;\r\n    DWN(i, m+1, 0){\r\n        if (!~bb&#x5B;b&#x5B;i]]) bb&#x5B;b&#x5B;i]] = n++;\r\n        b&#x5B;i] = bb&#x5B;b&#x5B;i]];\r\n        s &lt;&lt;= _M; s |= b&#x5B;i];\r\n    }\r\n    return s;\r\n}\r\n\r\nvoid decode(LL s){\r\n    REP(i, m+1){\r\n        b&#x5B;i] = s &amp; _U(_M);\r\n        s &gt;&gt;= _M;\r\n    }\r\n}\r\n\r\nconst int Prime = 9979;\r\n\r\nint d; struct hashTable{\r\n    LL state&#x5B;M]; int key&#x5B;M]; int sz;\r\n    int hd&#x5B;Prime], nxt&#x5B;M];\r\n\r\n    void clear(){\r\n        sz = 0;\r\n        FLC(hd, -1);\r\n    }\r\n\r\n    void push(){\r\n        LL s = encode();\r\n        int x = s % Prime;\r\n\r\n        for (int i=hd&#x5B;x];~i;i=nxt&#x5B;i]){\r\n            if (state&#x5B;i] == s){\r\n                INC(key&#x5B;i], d);\r\n                return;\r\n            }\r\n        }\r\n        state&#x5B;sz] = s; key&#x5B;sz] = d;\r\n        nxt&#x5B;sz] = hd&#x5B;x]; hd&#x5B;x] = sz;\r\n        ++sz;\r\n        assert(sz &lt; M);\r\n    }\r\n\r\n    void roll(){\r\n        REP(ii, sz) state&#x5B;ii] &lt;&lt;= _M;\r\n    }\r\n} H&#x5B;2]; int src, des;\r\nint A&#x5B;N+1]&#x5B;N+1], tx, ty;\r\n\r\n\r\nbool isBlock(int s){return s &amp; 1;}\r\nbool isMust(int s){return s &amp; 2;}\r\nbool isRight(int s){return s &amp; 4;}\r\nbool isLeft(int s){return s &amp; 8;}\r\nbool isDown(int s){return s &amp; 16;}\r\nbool isUp(int s){return s &amp; 32;}\r\n\r\nvoid init(){\r\n    tx = -1, ty = -1; RD(n, m); REP_2(i, j, n, m) if (isMust(RD(A&#x5B;i]&#x5B;j]))) tx = i, ty = j;\r\n    REP(i, m) A&#x5B;n]&#x5B;i] = 1; REP(i, n) A&#x5B;i]&#x5B;m] = 1;\r\n}\r\n\r\nvoid solve(){\r\n    src = 0, des = 1; H&#x5B;des].clear(); RST(b); d = 1; H&#x5B;des].push();\r\n\r\n    int z = 0; REP(i, n){\r\n        REP(j, m){\r\n\r\n            if (isBlock(A&#x5B;i]&#x5B;j])) continue;\r\n            swap(src, des); H&#x5B;des].clear();\r\n\r\n            \/\/cout &lt;&lt; i &lt;&lt; &quot; &quot; &lt;&lt; j &lt;&lt; &quot; &quot;&lt;&lt; H&#x5B;src].sz &lt;&lt; endl;\r\n\r\n            REP(ii, H&#x5B;src].sz){\r\n                decode(H&#x5B;src].state&#x5B;ii]); d = H&#x5B;src].key&#x5B;ii];\r\n\r\n                int lt = b&#x5B;j], up = b&#x5B;j+1];\r\n                bool dn = isDown(A&#x5B;i]&#x5B;j]) &amp;&amp; isUp(A&#x5B;i+1]&#x5B;j]) &amp;&amp; !isBlock(A&#x5B;i+1]&#x5B;j]);\r\n                bool rt = isRight(A&#x5B;i]&#x5B;j]) &amp;&amp; isLeft(A&#x5B;i]&#x5B;j+1]) &amp;&amp; !isBlock(A&#x5B;i]&#x5B;j+1]);\r\n\r\n                if (lt &amp;&amp; up){\r\n                    if (lt == up){\r\n                        if (i*m+j&gt;=tx*m+ty){\r\n                            int cnt = 0; REP(jj, m+1) if (b&#x5B;jj]) ++cnt;  \/\/ ?\r\n                            if (cnt == 2) INC(z, d);\r\n                        }\r\n                    }\r\n                    else{\r\n                        b&#x5B;j] = b&#x5B;j+1] = 0;\r\n                        REP(jj, m+1) if (b&#x5B;jj] == lt) b&#x5B;jj] = up;\r\n                        H&#x5B;des].push();\r\n                    }\r\n                }\r\n                else if (lt || up){\r\n                    int t = lt | up;\r\n                    if (dn){\r\n                        b&#x5B;j] = t; b&#x5B;j+1] = 0;\r\n                        H&#x5B;des].push();\r\n                    }\r\n                    if (rt){\r\n                        b&#x5B;j] = 0; b&#x5B;j+1] = t;\r\n                        H&#x5B;des].push();\r\n                    }\r\n                }\r\n                else{\r\n\r\n                    if (!isMust(A&#x5B;i]&#x5B;j])){\r\n                        H&#x5B;des].push();\r\n                    }\r\n\r\n                    if (dn &amp;&amp; rt){\r\n                        b&#x5B;j] = b&#x5B;j+1] = N-1;\r\n                        H&#x5B;des].push();\r\n                    }\r\n                }\r\n            }\r\n        }\r\n        H&#x5B;des].roll();\r\n    }\r\n\r\n    printf(&quot;%d\\n&quot;, z);\r\n}\r\n\r\n\r\nint main(){\r\n\r\n#ifndef ONLINE_JUDGE\r\n    freopen(&quot;in.txt&quot;, &quot;r&quot;, stdin);\r\n    \/\/freopen(&quot;out.txt&quot;, &quot;w&quot;, stdout);\r\n#endif\r\n\r\n    Rush{\r\n        init();\r\n        solve();\r\n    }\r\n}\r\n\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[15],"tags":[45],"class_list":["post-1211","post","type-post","status-publish","format-standard","hentry","category-online","tag-dp"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-jx","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/1211","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=1211"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/1211\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=1211"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=1211"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=1211"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}