\u3002\u3002\u9ebb\u5c06\uff0c\u4e0d\u5e26\u78b0\u4e0d\u5e26\u5403\u4e0d\u5e26\u6760\uff0c\u53ea\u5e26\u81ea\u6478\u3002\u3002
\n\u95ee\u90fd\u91c7\u53d6\u6700\u4f18\u7b56\u7565\uff08\u5f00\u6302\uff09\u65f6\u8c01\u5148\u83b7\u5f97\u80dc\u5229\u3002\u3002<\/p>\n
<\/p>\n
\u7531\u4e8e\u4ec0\u4e48\u90fd\u4e0d\u5e26\u57fa\u672c\u4e0a\u5c31\u53ef\u4ee5\u5355\u673a\u4e86\uff0c\u800c\u4e14\u90fd\u5f00\u6302\u7684\u8bdd\u83b7\u80dc\u6761\u4ef6\u53ea\u548c\u6240\u6709\u53ef\u4ee5\u6478\u5230\u7684\u9ebb\u5c06\u6709\u5173\uff0c\u4e5f\u4e0d\u7528\u8003\u8651\u5f03\u724c\u3002\u3002
\n\u7ef4\u62a4\u4e00\u4e2a Player \u7c7b\u3002\u3002\u3002\u4e3b\u8981\u6709 \u300c\u6478!\u300d\u548c\u300c\u548c?\u300d \u4e24\u4e2a\u529f\u80fd\u3002\u3002<\/p>\n
\r\nstruct Player{\r\n int N[10], S[10], B[10];\r\n int EH, SH, WH, NH, rH, wH, gH;\r\n int pair;\r\n\r\n ...\r\n\r\n bool hu(){\r\n return pair >= 7 || all_crap() || std_hand();\r\n }\r\n\r\n void mo(){\r\n --wall; char a, b; scanf(" %c%c", &a, &b);\r\n\r\n switch (b){\r\n case 'N':if (++N[a-'0'] == 2) ++pair;break;\r\n case 'S':if (++S[a-'0'] == 2) ++pair;break;\r\n case 'B':if (++B[a-'0'] == 2) ++pair;break;\r\n default:\r\n switch (a){\r\n case 'E':if (++EH == 2) ++pair;break;\r\n case 'S':if (++SH == 2) ++pair;break;\r\n case 'W':if (++WH == 2) ++pair;break;\r\n case 'N':if (++NH == 2) ++pair;break;\r\n case 'r':if (++rH == 2) ++pair;break;\r\n case 'w':if (++wH == 2) ++pair;break;\r\n default:if (++gH == 2) ++pair;\r\n }\r\n }\r\n }\r\n\r\n} p[4];\r\n<\/pre>\n\u5bf9\u4e8e\u5224\u65ad\u80e1\u724c\u7684\u60c5\u51b5\uff0c\u5148\u5bf9\u4e24\u79cd\u7279\u6b8a\u60c5\u51b5\u8fdb\u884c\u7b80\u5355\u5224\u65ad\uff0c\u7136\u540e\u8003\u8651\u6807\u51c6\u724c\u578b\u3002\u3002
\n\u7279\u6b8a\u5904\u7406\u300c\u5b57\u724c\u300d\u3002\uff08\u56e0\u4e3a\u6ca1\u6709\u300c\u5403\u300d\u6240\u4ee5\u5904\u7406\u8d77\u6765\u66f4\u5bb9\u6613\u4e00\u4e9b\u3002\u3002\uff09\u3002
\n\u3002\u7136\u540e\u5bf93\u79cd\u56fe\u6848\u5206\u5f00\u6765\u5904\u7406\uff0c\u8003\u8651\u5230\u53ea\u8003\u8651\u300c\u5403\u300d\u7684\u8bdd\u662f\u5f88\u5bb9\u6613\u8d2a\u5fc3\u6784\u9020\u7684\u3002
\n\u3002\u3002\u4e8e\u662f\u5bf9\u6ee1\u8db3\u300c\u78b0\u300d\u7684\u60c5\u51b5\u518d\u679a\u4e3e\u662f\u5426\u300c\u78b0\u300d\u3002\uff08\u4e0d\u4f1a\u8d85\u8fc7 4 \u7ec4\uff0c\u5426\u5219\u4e0a\u4e00\u8f6e\u5df2\u7ecf\u5f97\u89e3\u4e86 \u3002\u3002\uff09\u3002
\n\u3002\u3002\u7136\u540e\u518d\u6700\u5916\u56f4\u679a\u4e3e\u7531\u90a3\u7c7b\u56fe\u6848\u6765\u63d0\u4f9b\u300c\u5bf9\u300d\u3002\u3002\u3002<\/p>\n
\r\n...\r\n bool std_hand(){\r\n\r\n F[0] = fh(), G[0] = gh();\r\n F[1] = f(N), F[2] = f(S), F[3] = f(B);\r\n G[1] = g(N), G[2] = g(S), G[3] = g(B);\r\n\r\n if (G[0] + F[1] + F[2] + F[3] >= 4) return true;\r\n if (F[0] + G[1] + F[2] + F[3] >= 4) return true;\r\n if (F[0] + F[1] + G[2] + F[3] >= 4) return true;\r\n if (F[0] + F[1] + F[2] + G[3] >= 4) return true;\r\n\r\n return false;\r\n }\r\n...\r\n<\/pre>\n\u603b\u7684\u590d\u6742\u5ea6\u4f3c\u4e4e\u8d85\u7ea7\u4f4e\u3002\u3002\u3002<\/p>\n
\r\n#define LOCAL\r\n\r\n\/** ` Micro Mezzo Macro Flation -- Overheated Economy ., **\/\r\n\r\n#include <algorithm>\r\n#include <iostream>\r\n#include <iomanip>\r\n#include <sstream>\r\n#include <cstring>\r\n#include <cstdio>\r\n#include <string>\r\n#include <vector>\r\n#include <bitset>\r\n#include <queue>\r\n#include <stack>\r\n#include <cmath>\r\n#include <ctime>\r\n#include <list>\r\n#include <set>\r\n#include <map>\r\n\r\nusing namespace std;\r\n\r\n#define REP(i, n) for (int i=0;i<int(n);++i)\r\n#define FOR(i, a, b) for (int i=int(a);i<int(b);++i)\r\n#define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i)\r\n#define REP_1(i, n) for (int i=1;i<=int(n);++i)\r\n#define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i)\r\n#define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i)\r\n#define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i)\r\n#define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i)\r\n#define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i)\r\n#define REP_N(i, n) for (i=0;i<int(n);++i)\r\n#define FOR_N(i, a, b) for (i=int(a);i<int(b);++i)\r\n#define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i)\r\n#define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i)\r\n#define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i)\r\n#define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i)\r\n#define REP_1_N(i, n) for (i=1;i<=int(n);++i)\r\n#define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i)\r\n#define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i)\r\n#define REP_C_N(i, n) for (n____=int(n),i=0;i<n____;++i)\r\n#define FOR_C_N(i, a, b) for (b____=int(b),i=a;i<b____;++i)\r\n#define DWN_C_N(i, b, a) for (a____=int(a),i=b-1;i>=a____;--i)\r\n#define REP_1_C_N(i, n) for (n____=int(n),i=1;i<=n____;++i)\r\n#define FOR_1_C_N(i, a, b) for (b____=int(b),i=a;i<=b____;++i)\r\n#define DWN_1_C_N(i, b, a) for (a____=int(a),i=b;i>=a____;--i)\r\n\r\n#define ECH(it, A) for (typeof(A.begin()) it=A.begin(); it != A.end(); ++it)\r\n#define DO(n) while(n--)\r\n#define DO_C(n) int n_____ = n; while(n_____--)\r\n\r\n#define ALL(A) A.begin(), A.end()\r\n#define LLA(A) A.rbegin(), A.rend()\r\n#define CPY(A, B) memcpy(A, B, sizeof(A))\r\n#define INS(A, P, B) A.insert(A.begin() + P, B)\r\n#define ERS(A, P) A.erase(A.begin() + P)\r\n#define BSC(A, X) find(ALL(A), X) \/\/ != A.end()\r\n#define CTN(T, x) (T.find(x) != T.end())\r\n#define SZ(A) int(A.size())\r\n#define PB push_back\r\n#define MP(A, B) make_pair(A, B)\r\n\r\n#define Rush int T____; RD(T____); DO(T____)\r\n#pragma comment(linker, "\/STACK:36777216")\r\n\/\/#pragma GCC optimize ("O2")\r\n#define Ruby system("ruby main.rb")\r\n#define Haskell system("runghc main.hs")\r\n#define Pascal system("fpc main.pas")\r\n\r\ntypedef long long LL;\r\ntypedef double DB;\r\n\r\ntypedef vector<int> VI;\r\n\r\ntemplate<class T> inline void RD(T &);\r\ntemplate<class T> inline void OT(const T &);\r\n\r\ninline int RD(){ int x; RD(x); return x;}\r\ntemplate<class T> inline T& _RD(T &x){ RD(x); return x;}\r\ninline void RC(char &c){scanf(" %c", &c);}\r\ninline void RS(char *s){scanf("%s", s);}\r\n\r\ntemplate<class T0, class T1> inline void RD(T0 &x0, T1 &x1){RD(x0), RD(x1);}\r\n\r\ntemplate<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}\r\ntemplate<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);}\r\ntemplate<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);}\r\n\r\n\r\ntemplate<class T> inline void CLR(T &A){A.clear();}\r\ntemplate<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);}\r\n\/** Add - On **\/\r\n\r\nconst int MOD = 1000000007;\r\nconst int INF = 10009;\r\nconst DB EPS = 1e-2;\r\nconst DB OO = 1e15;\r\nconst DB PI = 3.14159265358979323846264; \/\/M_PI;\r\n\r\n\/\/ <<= ` 0. Daily Use .,\r\n\r\ntemplate<class T> inline void checkMin(T &a,const T b){if (b<a) a=b;}\r\ntemplate<class T> inline void checkMax(T &a,const T b){if (b>a) a=b;}\r\ntemplate <class T, class C> inline void checkMin(T& a, const T b, C c){if (c(b,a)) a = b;}\r\ntemplate <class T, class C> inline void checkMax(T& a, const T b, C c){if (c(a,b)) a = b;}\r\ntemplate<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}\r\ntemplate<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}\r\ntemplate<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));}\r\ntemplate<class T> inline T max(T a, T b, T c, T d){return max(min(a, b), max(c, d));}\r\ntemplate<class T> inline T sqr(T a){return a*a;}\r\ntemplate<class T> inline T cub(T a){return a*a*a;}\r\nint Ceil(int x, int y){return (x - 1) \/ y + 1;}\r\n\r\n\/\/ <<= ` 1. Bitwise Operation .,\r\ninline bool _1(int x, int i){return x & 1<<i;}\r\ninline bool _1(LL x, int i){return x & 1LL<<i;}\r\ninline LL _1(int i){return 1LL<<i;}\r\n\/\/inline int _1(int i){return 1<<i;}\r\ninline LL _U(int i){return _1(i) - 1;};\r\n\/\/inline int _U(int i){return _1(i) - 1;};\r\n\r\ninline int count_bits(int x){\r\n x = (x & 0x55555555) + ((x & 0xaaaaaaaa) >> 1);\r\n x = (x & 0x33333333) + ((x & 0xcccccccc) >> 2);\r\n x = (x & 0x0f0f0f0f) + ((x & 0xf0f0f0f0) >> 4);\r\n x = (x & 0x00ff00ff) + ((x & 0xff00ff00) >> 8);\r\n x = (x & 0x0000ffff) + ((x & 0xffff0000) >> 16);\r\n return x;\r\n}\r\n\r\n\/\/ <<= ' 0. I\/O Accelerator interface .,\r\n\r\ntemplate<class T> inline void RD(T &x){\r\n \/\/cin >> x;\r\n scanf("%d", &x);\r\n \/\/char c; for (c = getchar(); c < '0'; c = getchar()); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c -\r\n \/\/char c; c = getchar(); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';\r\n}\r\n\r\ntemplate<class T> inline void OT(const T &p){\r\n printf("%.0lf\\n", p);\r\n}\r\n\r\n\/* .................................................................................................................................. *\/\r\n\r\nconst char name[4][129] = {"Takakamo Shizuno", "Atarashi Ako", "Matsumi Kuro", "Haramura Nodoka"};\r\n\r\nint AA[10], wall;\r\nint F[4], G[4];\r\n\r\nstruct Player{\r\n int N[10], S[10], B[10];\r\n int EH, SH, WH, NH, rH, wH, gH;\r\n int pair;\r\n\r\n void init(){\r\n RST(N, S, B), EH = SH = WH = NH = rH = wH = gH = 0, pair = 0;\r\n }\r\n\r\n bool all_crap(){\r\n if (!EH || !SH || !WH || !NH || !rH || !wH || !gH || !N[1] || !N[9] || !S[1] || !S[9] || !B[1] || !B[9]) return false;\r\n return EH>=2||SH>=2||WH>=2||NH>=2||rH>=2||wH>=2||gH>=2||N[1]>=2||N[9]>=2||S[1]>=2||S[9]>=2||B[1]>=2||B[9]>=2;\r\n }\r\n\r\n int fh(){\r\n return (EH>=3)+(SH>=3)+(WH>=3)+(NH>=3)+(rH>=3)+(wH>=3)+(gH>=3);\r\n }\r\n\r\n int gh(){\r\n if (EH==2||SH==2||WH==2||NH==2||rH==2||wH==2||gH==2) return fh();\r\n if (EH<2&&SH<2&&WH<2&&NH<2&&rH<2&&wH<2&&gH<2) return -INF;\r\n return fh() - 1;\r\n }\r\n\r\n\r\n int _f(int A[]){\r\n\r\n CPY(AA, A); int res = 0; REP_1(i, 7){\r\n if (AA[i]){\r\n int d = min(AA[i], AA[i+1], AA[i+2]);\r\n AA[i] -= d, AA[i+1] -= d, AA[i+2] -= d;\r\n res += d;\r\n }\r\n }\r\n\r\n return res;\r\n }\r\n\r\n int f(int A[]){\r\n int res = 0; VI L; REP_1(i, 9) if (A[i] >= 3) L.PB(i);\r\n REP(s, _1(SZ(L))){\r\n REP(i, SZ(L)) if (_1(s, i)) A[L[i]] -= 3;\r\n checkMax(res, _f(A) + count_bits(s));\r\n REP(i, SZ(L)) if (_1(s, i)) A[L[i]] += 3;\r\n }\r\n return res;\r\n }\r\n\r\n int g(int A[]){\r\n int res = -INF; REP_1(i, 9) if (A[i] >= 2) A[i] -= 2, checkMax(res, f(A)), A[i] += 2;\r\n return res;\r\n }\r\n\r\n bool std_hand(){\r\n\r\n F[0] = fh(), G[0] = gh();\r\n F[1] = f(N), F[2] = f(S), F[3] = f(B);\r\n G[1] = g(N), G[2] = g(S), G[3] = g(B);\r\n\r\n if (G[0] + F[1] + F[2] + F[3] >= 4) return true;\r\n if (F[0] + G[1] + F[2] + F[3] >= 4) return true;\r\n if (F[0] + F[1] + G[2] + F[3] >= 4) return true;\r\n if (F[0] + F[1] + F[2] + G[3] >= 4) return true;\r\n\r\n return false;\r\n }\r\n\r\n bool hu(){\r\n return pair >= 7 || all_crap() || std_hand();\r\n }\r\n\r\n void mo(){\r\n --wall; char a, b; scanf(" %c%c", &a, &b);\r\n\r\n switch (b){\r\n case 'N':if (++N[a-'0'] == 2) ++pair;break;\r\n case 'S':if (++S[a-'0'] == 2) ++pair;break;\r\n case 'B':if (++B[a-'0'] == 2) ++pair;break;\r\n default:\r\n switch (a){\r\n case 'E':if (++EH == 2) ++pair;break;\r\n case 'S':if (++SH == 2) ++pair;break;\r\n case 'W':if (++WH == 2) ++pair;break;\r\n case 'N':if (++NH == 2) ++pair;break;\r\n case 'r':if (++rH == 2) ++pair;break;\r\n case 'w':if (++wH == 2) ++pair;break;\r\n default:if (++gH == 2) ++pair;\r\n }\r\n }\r\n }\r\n\r\n} p[4];\r\n\r\nvoid Run(){\r\n\r\n DO_C(3) REP(i, 4) p[i].mo(), p[i].mo(), p[i].mo(), p[i].mo();\r\n\r\n REP(i, 4) p[i].mo();\r\n\r\n REP_1(turn, 21){\r\n REP(i, 4){\r\n p[i].mo(); if (p[i].hu()){\r\n printf("%s wins at turn %d.", name[i], turn);\r\n return;\r\n }\r\n }\r\n }\r\n\r\n printf("a Draw Hand occurs.");\r\n}\r\n\r\n\r\nint main(){\r\n\r\n\r\n#ifndef ONLINE_JUDGE\r\n \/\/freopen("in.txt", "r", stdin);\r\n \/\/ freopen("out.txt", "w", stdout);\r\n#endif\r\n\r\n\r\n REP_1_C(Case, RD()){\r\n REP(i, 4) p[i].init();\r\n printf("For round %d, ", Case);\r\n wall = 136; Run(); puts("");\r\n DO(wall){char a, b; scanf(" %c%c", &a, &b);}\r\n\r\n }\r\n}\r\n<\/pre>\nExternal link: <\/h3>\n
http:\/\/acm.uestc.edu.cn\/problem.php?pid=1715<\/a>
\nhttp:\/\/acm.hust.edu.cn:8080\/judge\/problem\/viewProblem.action?id=28653<\/a>
\nhttp:\/\/en.wikipedia.org\/wiki\/Mahjong<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"Brief description: \u3002\u3002\u9ebb\u5c06\uff0c\u4e0d\u5e26\u78b0\u4e0d\u5e26\u5403\u4e0d\u5e26\u6760\uff0c\u53ea\u5e26\u81ea\u6478\u3002\u3002 \u95ee\u90fd\u91c7\u53d6\u6700\u4f18\u7b56\u7565\uff08\u5f00\u6302\uff09\u65f6\u8c01\u5148\u83b7\u5f97\u80dc\u5229\u3002\u3002<\/p>\n","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":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[16],"tags":[76,75],"class_list":["post-249","post","type-post","status-publish","format-standard","hentry","category-online-judge","tag-76","tag-75"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-41","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/249","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=249"}],"version-history":[{"count":1,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/249\/revisions"}],"predecessor-version":[{"id":250,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/249\/revisions\/250"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=249"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=249"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=249"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}