{"id":149,"date":"2020-03-30T18:34:10","date_gmt":"2020-03-30T10:34:10","guid":{"rendered":"http:\/\/47.103.223.234:100\/?p=149"},"modified":"2020-04-15T21:56:08","modified_gmt":"2020-04-15T13:56:08","slug":"149","status":"publish","type":"post","link":"http:\/\/www.zyhcoding.club\/index.php\/2020\/03\/30\/149\/","title":{"rendered":"3-19 \u8865\u9898 \u7b2c5\u6b21\u8bad\u7ec3"},"content":{"rendered":"

F. Dr. Evil Underscores CF1285D \u5b57\u5178\u6811<\/a><\/h2>\n

\u9898\u610f\uff1a\u8f93\u5165n\u4e2a\u6574\u6570\uff0c\u6c42\u4e00\u4e2a\u6574\u6570X\uff0c\u4f7f\u5f97\u5b83\u4e0e\u8fd9\u4e9b\u6574\u6570\u7684\u6700\u5927\u5f02\u6216\u503c\u6700\u5c0f\u3002\u8f93\u51fa\u8fd9\u4e2a\u6700\u5c0f\u503c\u3002
\n\u8f93\u5165\uff1a\u7b2c\u4e00\u884cn\uff0c\u7b2c\u4e8c\u884cn\u4e2a\u6574\u6570\u3002\u6240\u6709\u6574\u6570<=2^{31}<\/code>-1
\n\u8f93\u51fa\uff1a\u7b54\u6848\uff0c\u4e00\u4e2a\u6574\u6570\u3002
\n\u5206\u6790\uff1a\u628a\u6240\u6709\u6574\u6570\u5206\u89e3\u621030\u4f4d\u4e8c\u8fdb\u5236\u6570\uff0c\u4ece\u5de6\u81f3\u53f3\uff0c\u770b\u6210\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u63d2\u5165Trie\u6811\uff0c\u7136\u540e\u5f00\u59cbdfs\u6c42\u7b54\u6848\u3002\u6811\u9ad8\u4e3a30\u5c42\uff0c\u5f53\u641c\u7d22\u5230\u67d0\u4e00\u5c42\uff0c\u53ea\u67090\u62161\u65f6\uff0c\u90a3\u4e48X\u5728\u8fd9\u4e00\u5c42\u7684\u4e8c\u8fdb\u5236\u6570\u4e5f\u662f0\u62161\uff0c\u5373\u5bf9\u7b54\u6848\u7684\u8d21\u732e\u4e3a0\uff1b\u82e5\u8be5\u5c420\u548c1\u90fd\u6709\uff0c\u90a3\u4e48\u5c31\u662f\u8bf4\uff0c\u4e0d\u8bbaX\u5728\u8fd9\u91cc\u7684\u4e8c\u8fdb\u5236\u6570\u662f0\u8fd8\u662f1\uff0c\u6700\u7ec8\u7b54\u6848\u8fd9\u91cc\u80af\u5b9a\u662f1\uff0c\u90a3\u4e48\u900901\u4e24\u8fb9\u6700\u5c0f\u7684\u4e00\u4e2a\u7b54\u6848\u5c31\u884c\u4e86\u3002<\/p>\n

#include <iostream>\n#include <cstdio>\n#include <algorithm>\nusing namespace std;\nconst int maxn = 3e6+5;\nint Trie[maxn][2];\nint cnt = 0;\nvoid insert(int n);\nint dfs(int cur,int root);\nint read();\nint main(){\n    int n,temp;\n    \/\/cin>>n;\n    \/\/scanf ("%d",&n);\n    n = read();\n    while (n--){\n        \/\/cin >> temp;\n        \/\/scanf ("%d",&temp);\n        temp = read();\n        insert(temp);\n    }\n    cout << dfs(30,0);\n    return 0;\n}\nint dfs(int cur,int root){\n    if (cur==0) return 0;\n    if (!Trie[root][0]) return dfs(cur-1,Trie[root][1]);\n    if (!Trie[root][1]) return dfs(cur-1,Trie[root][0]);\n    return (1<<(cur-1))+min(dfs(cur-1,Trie[root][0]),dfs(cur-1,Trie[root][1]));\n}\n\nvoid insert(int n){\n    int temp,root = 0;\n    for (int i=30;i>=1;i--){\n        temp = (n>>(i-1)) & 1;\n        if (!Trie[root][temp])  Trie[root][temp] = ++cnt;\n        root = Trie[root][temp];\n    }\n    return;\n}\nint read(){\n    int f=1,x=0;char ch = getchar();\n    while (ch<'0' || ch>'9')  {if (ch=='-')   f=-1;ch = getchar();}\n    while (ch>='0' && ch<='9')  {x = 10*x+ch-'0';ch = getchar();}\n    return x*f;\n}<\/code><\/pre>\n
\u4e5f\u5c3110w\u4e2a\u6570\u636e\uff0c\u4f46\u628acin\u6362\u6210scanf\u7684\u8bdd\uff0c\uff0c\u80fd\u5feb200ms\uff0c\u641e\u4e0d\u61c2cf\u3002
\n\u7528\u5feb\u8bfb\u7684\u8fd8\u53ef\u4ee5\u6bd4scanf\u518d\u5feb\u4e0a\u4e00\u70b9\u3002<\/p>\n
I. Word Puzzles POJ1204<\/a>  AC\u81ea\u52a8\u673a<\/h2>\n
\u9898\u610f<\/strong>\uff1a\u7ed9\u5b9a\u4e00\u4e2aL\\times<\/code>C\u7684\u5b57\u7b26\u8ff7\u5babword puzzles\uff0c\u7136\u540e\u7ed9\u51faW\u4e2a\u6a21\u677f\u4e32\uff0c\u6c42\u8fd9\u4e9b\u6a21\u677f\u4e32\u5728puzzles\u4e2d\u51fa\u73b0\u7684\u4f4d\u7f6e\u4ee5\u53ca\u65b9\u5411\u3002\u65b9\u5411\u67091~8\u8fd98\u4e2a\u65b9\u5411\uff0c1\u4e3a\u949f\u8868\u768412\u70b9\u79cd\u65b9\u5411\uff0c\u5269\u4e0b\u7684\u6309\u987a\u65f6\u9488\u4f9d\u6b21\u3002\u3002
\n\u8f93\u5165<\/strong>
\n\u7b2c\u4e00\u884c\uff1a\u4e09\u4e2a\u6574\u6570 L C W
\n\u63a5\u4e0b\u6765L\u884c\u8f93\u5165\u8ff7\u5bab\uff0c\u6bcf\u884c\u4e00\u4e2a\u957f\u4e3aC\u7684\u5b57\u7b26\u4e32
\n\u6700\u540eW\u884c\uff0c\u6bcf\u884c\u4e00\u4e2a\u6a21\u677f\u4e32
\n\u8f93\u51fa<\/strong>
\n\u5bf9\u6bcf\u4e2a\u6a21\u677f\u4e32\uff0c\u8f93\u51fa\u4e09\u4e2a\u53c2\u6570\uff1a\u7b2c\u4e00\u4e2a\u5b57\u7b26\u5728\u8ff7\u5bab\u4e2d\u7684\u6a2a\u7eb5\u5750\u6807\uff0c\u65b9\u5411\u3002\u6a2a\u7eb5\u5750\u6807\u5927\u5c0f\u4ece0\u5f00\u59cb\u800c\u4e0d\u662f1\u3002<\/p>\n
\u6784\u5efaAC\u81ea\u52a8\u673a\uff0c\u5148\u628a\u8ff7\u5bab\u5b58\u4e0b\u6765\uff0c\u7136\u540e\u628a\u6a21\u677f\u4e32\u63d2\u5165\u5230Trie\u6811\uff0c\u6784\u5efaAC\u81ea\u52a8\u673a\uff0c\u6ce8\u610f\u7ef4\u62a4\u6bcf\u4e2a\u7ed3\u70b9\u5bf9\u5e94\u7b2c\u51e0\u4e2a\u6a21\u677f\u4e32\u3002\u7136\u540e\u518d8\u4e2a\u65b9\u5411\u4f9d\u6b21\u626b\u63cf\u8ff7\u5bab\uff0c\u626b\u63cf\u5230\u4e86\u5c31\u8bb0\u5f55\u4e00\u4e0b\u7b54\u6848\uff0c\u6700\u540e\u8f93\u51fa\u3002\u7ec6\u8282\u633a\u591a\u3002<\/p>\n
#include <cstdio>\n#include <cstring>\n#include <queue>\nusing namespace std;\nconst int N = 1005,maxn = 1e6+5;\ntypedef struct AC_Auto{\n    int Trie[maxn][27],fail[maxn],cnt;\n    int val[maxn],ans[maxn][3];              \/\/val[i]\u8868\u793ai\u7ed3\u70b9\u5bf9\u5e94\u7684\u662f\u54ea\u4e2a\u6a21\u677f\u4e32\uff0cans[i]\u5b58\u7b2ci\u4e2a\u6a21\u677f\u4e32\u7684\u7b54\u6848\n    char Orien[maxn];        \/\/\u8868\u793a\u7b2ci\u4e2a\u6a21\u677f\u4e32\u7684\u65b9\u5411\uff0c\u4e5f\u7b97\u7b54\u6848\u7684\u4e00\u90e8\u5206\n    int len[maxn];        \/\/\u6bcf\u4e2a\u6a21\u677f\u4e32\u7684\u957f\u5ea6\n    AC_Auto(){\n        cnt = 0;\n    }\n    void insert(char *s,int len,int j);\n    void build();\n    void query(int orien,int x,int y);  \/\/orien\u4e3a\u65b9\u5411\uff0cx y\u4e3a\u8d77\u70b9\n}AC;\nint L,C,W;\nchar s[N][N],t[maxn];\nAC ac;\nint main(){\n    scanf ("%d %d %d",&L,&C,&W);\n    for (int i=1;i<=L;i++)\n        scanf ("%s",s[i]+1);\n    for (int i=1;i<=W;i++){\n        scanf ("%s",t+1);\n        ac.len[i] = strlen(t+1);\n        ac.insert(t,ac.len[i],i);\n    }\n    ac.build();\n    for (int j=1;j<=C;j++)  ac.query(4,1,j),ac.query(5,1,j),ac.query(6,1,j),ac.query(1,L,j),ac.query(2,L,j),ac.query(8,L,j);\n    for (int i=1;i<=L;i++)  ac.query(2,i,1),ac.query(3,i,1),ac.query(4,i,1),ac.query(6,i,C),ac.query(7,i,C),ac.query(8,i,C);\n    for (int i=1;i<=W;i++)  printf ("%d %d %c\\n",ac.ans[i][1],ac.ans[i][2],ac.Orien[i]);\n    return 0;\n}\n\nvoid AC::query(int orien,int x,int y){            \/\/query\u4ee5(x,y)\u5f00\u5934\u7684\uff0c\u65b9\u5411\u4e3aorien\u7684\u5b57\u7b26\u4e32\n    int flag1,flag2;\n    switch (orien){                \/\/\u8fd9\u91cc\u662f\u4e00\u4e2a\u65b9\u5411\u7684\u5c0f\u6280\u5de7\uff0c\u8981\u8bb0\u4f4f\n        case 1:flag1 = -1,flag2 = 0;break;\n        case 2:flag1 = -1,flag2 = 1;break;\n        case 3:flag1 = 0,flag2 = 1;break;\n        case 4:flag1 = 1,flag2 = 1;break;\n        case 5:flag1 = 1,flag2 = 0;break;\n        case 6:flag1 = 1,flag2 = -1;break;\n        case 7:flag1 = 0,flag2 = -1;break;\n        case 8:flag1 = -1,flag2 = -1;break;\n    }\n    int root = 0,temp;\n    for (int i=x,j=y;i>=1 && i<=L && j>=1 &&  j<=C;i+=flag1,j+=flag2){\n        temp = root = Trie[root][s[i][j]-'A'+1];\n        while (temp){\n            if (val[temp] && !ans[val[temp]][0])     \/\/\u8bb0\u5f55\u7b54\u6848\u8fd9\u91cc\u662f\u6709\u70b9\u9ebb\u70e6\u7684\uff0c\u56e0\u4e3a\u626b\u63cf\u5230\u6a21\u677f\u4e32\u540e\uff0c\u53ef\u80fd\u662f\u626b\u63cf\u5230\u4e86\u7b2c\u4e00\u4e2a\u5b57\u7b26\uff0c\u4e5f\u53ef\u80fd\u662f\u6700\u540e\u4e00\u4e2a\uff0c\u4f9d\u65b9\u5411\u800c\u5b9a\u3002\n                  ans[val[temp]][0] = 1,ans[val[temp]][1] = i-1-len[val[temp]]*flag1+flag1,ans[val[temp]][2] = j-1-len[val[temp]]*flag2+flag2,Orien[val[temp]] = orien+'A'-1;\n            temp = fail[temp];\n        }\n    }\n    return;\n}\n\nvoid AC::insert(char *s,int len,int j){\n    int root = 0;\n    for (int i=1;i<=len;i++){\n        if (!Trie[root][s[i]-'A'+1])    Trie[root][s[i]-'A'+1] = ++cnt;\n        root = Trie[root][s[i]-'A'+1];\n    }\n    val[root] = j;                                    \/\/\u7ec8\u7ed3\u70b9\u6807\u8bb0\uff01\n    return;\n}\nvoid AC::build(){\n    queue<int> q;\n    int temp;\n    for (int i=1;i<=26;i++) if (Trie[0][i]) q.push(Trie[0][i]);\n    while (!q.empty()){\n        temp = q.front();   q.pop();\n        for (int i=1;i<=26;i++){\n            if (Trie[temp][i]){\n                fail[Trie[temp][i]] = Trie[fail[temp]][i];\n                q.push(Trie[temp][i]);\n            }else\n                Trie[temp][i] = Trie[fail[temp]][i];\n        }\n    }\n    return;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
F. Dr. Evil Underscores CF1285D \u5b57\u5178\u6811 \u9898\u610f\uff1a\u8f93\u5165n\u4e2a\u6574\u6570\uff0c\u6c42\u4e00\u4e2a\u6574 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[27],"tags":[],"_links":{"self":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts\/149"}],"collection":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/comments?post=149"}],"version-history":[{"count":11,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts\/149\/revisions"}],"predecessor-version":[{"id":151,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/posts\/149\/revisions\/151"}],"wp:attachment":[{"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/media?parent=149"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/categories?post=149"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.zyhcoding.club\/index.php\/wp-json\/wp\/v2\/tags?post=149"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}