{"id":150,"date":"2010-03-13T11:50:00","date_gmt":"2010-03-13T03:50:00","guid":{"rendered":"http:\/\/localhost\/?p=150"},"modified":"2010-03-13T11:50:00","modified_gmt":"2010-03-13T03:50:00","slug":"hnoi2008_gt_exam","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/wjmzbmr\/?p=150","title":{"rendered":"[HNOI2008]GT\u8003\u8bd5"},"content":{"rendered":"<p> <a target=\"_blank\" href=\"http:\/\/61.187.179.132:8080\/JudgeOnline\/showproblem?problem_id=1009\">61.187.179.132:8080\/JudgeOnline\/showproblem<\/a><br \/>\u989d\u3002\u3002\u6c34\u9898\u76f4\u63a5\u4e0a\u77e9\u9635\u4e58\u6cd5\u3002\u3002<br \/>\u7531\u4e8em\u6bd4\u8f83\u5c0f\u5b9e\u9645\u4e0a\u6ca1\u5fc5\u8981\u7528KMP\u7b97\u6cd5\u7b97\u51fa\u539f\u59cb\u77e9\u9635\u7684\uff0c\u4e0d\u8fc7\u6211\u4e58\u673a\u5b66\u4e60\u4e86\u4e00\u4e0bKMP\u7b97\u6cd5\u56e7\u3002\u3002<br \/>\u8fd8\u6709\u5c31\u662f\u6211\u6628\u5929\u4e00\u76f4\u5728\u8c03\u6211\u90a3\u4e2aQTREE\u7684\u7a0b\u5e8f\u3002\u3002\u5230\u73b0\u5728\u90fd\u6ca1\u6709\u8c03\u597d\u3002\u3002\u6211\u771f\u662f\u592a\u83dc\u4e86555.<br \/>Code\uff1a<br \/>#include&lt;cstdio&gt;<br \/>#include&lt;iostream&gt;<br \/>#include&lt;algorithm&gt;<br \/>#include&lt;string&gt;<br \/>#include&lt;vector&gt;<br \/>#include&lt;cstring&gt;<br \/>#define rep(i,n) for(int i=0;i&lt;n;i++)<br \/>#define pb push_back<br \/>using namespace std;<br \/>const int inf=~0U&gt;&gt;1,maxm=20;<br \/>int n,m,mod,A[maxm],next[maxm+1];<br \/>struct Mat<br \/>{<br \/>    int M[maxm][maxm];<br \/>    Mat(){memset(M,0,sizeof(M));}<br \/>    void operator=(const Mat&amp;o)<br \/>    {memcpy(M,o.M,sizeof(M));}<br \/>    int&amp; operator()(int i,int j){return M[i][j];}<br \/>    Mat operator*(Mat&amp;o)<br \/>    {<br \/>        Mat T;<br \/>        rep(i,m)rep(j,m)rep(k,m)T(i,j)+=M[i][k]*o(k,j),T(i,j)%=mod;<br \/>        return T;<br \/>    }<br \/>}orig;<br \/>Mat Power(int n)<br \/>{<br \/>    if(n==1) return orig;<br \/>    Mat tmp=Power(n\/2);<br \/>    tmp=tmp*tmp;<br \/>    if(n&amp;1) tmp=tmp*orig;<br \/>    return tmp;<br \/>}<br \/>int main()<br \/>{<br \/>    \/\/freopen(&quot;in&quot;,&quot;r&quot;,stdin);<br \/>    cin&gt;&gt;n&gt;&gt;m&gt;&gt;mod;char x;<br \/>    rep(i,m) cin&gt;&gt;x,A[i+1]=x-&#8216;0&#8217;;<br \/>    next[1]=0;int t=0;<br \/>    for(int i=2;i&lt;=m;i++)<br \/>    {<br \/>        while(t&gt;0&amp;&amp;A[t+1]!=A[i]) t=next[t];<br \/>        if(A[t+1]==A[i])++t;<br \/>        next[i]=t;<br \/>    }<br \/>    for(int i=0;i&lt;m;++i)<br \/>    {<br \/>        rep(j,10)<br \/>        {<br \/>            int t=i;<br \/>            while(t&gt;0&amp;&amp;A[t+1]!=j)t=next[t];<br \/>            if(A[t+1]==j)++t;<br \/>            orig(t,i)++;<br \/>        }<br \/>    }<br \/>    Mat ans=Power(n);int Ans=0;<br \/>    rep(i,m) Ans+=ans(i,0),Ans%=mod;<br \/>    cout&lt;&lt;Ans&lt;&lt;endl;<br \/>} <\/p>\n","protected":false},"excerpt":{"rendered":"<p>61.187.179.132:8080\/JudgeOnline\/showproblem\u989d\u3002\u3002\u6c34\u9898\u76f4\u63a5\u4e0a\u77e9\u9635\u4e58\u6cd5\u3002\u3002\u7531\u4e8em\u6bd4\u8f83\u5c0f\u5b9e\u9645\u4e0a\u6ca1\u5fc5\u8981\u7528KMP\u7b97\u6cd5\u7b97\u51fa\u539f\u59cb\u77e9\u9635\u7684\uff0c\u4e0d\u8fc7\u6211\u4e58\u673a\u5b66\u4e60\u4e86\u4e00\u4e0bKMP\u7b97\u6cd5\u56e7\u3002\u3002\u8fd8\u6709\u5c31\u662f\u6211\u6628\u5929\u4e00\u76f4\u5728\u8c03\u6211\u90a3\u4e2aQTREE\u7684\u7a0b\u5e8f\u3002\u3002\u5230\u73b0\u5728\u90fd\u6ca1\u6709\u8c03\u597d\u3002\u3002\u6211\u771f\u662f\u592a\u83dc\u4e86555.Code\uff1a#include&lt;cstdio&gt;#include&lt;iostream&gt;#include&lt;algorithm&gt;#include&lt;string&gt;#include&lt;vector&gt;#include&lt;cstring&gt;#define rep(i,n) for(int i=0;i&lt;n;i++)#define pb push_backusing namespace std;const int inf=~0U&gt;&gt;1,maxm=20;int n,m,mod,A[maxm],next[maxm+1];struct Mat{ int M[maxm][maxm]; Mat(){memset(M,0,sizeof(M));} void operator=(const Mat&amp;o) {memcpy(M,o.M,sizeof(M));} int&amp; operator()(int i,int j){return M[i][j];} Mat operator*(Mat&amp;o) { Mat T; rep(i,m)rep(j,m)rep(k,m)T(i,j)+=M[i][k]*o(k,j),T(i,j)%=mod; return T; }}orig;Mat Power(int n){ if(n==1) return orig; Mat tmp=Power(n\/2); tmp=tmp*tmp; if(n&amp;1) tmp=tmp*orig; return tmp;}int main(){ \/\/freopen(&quot;in&quot;,&quot;r&quot;,stdin); cin&gt;&gt;n&gt;&gt;m&gt;&gt;mod;char x; rep(i,m) cin&gt;&gt;x,A[i+1]=x-&#8216;0&#8217;; next[1]=0;int t=0; for(int i=2;i&lt;=m;i++) [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/150"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=150"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/150\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=150"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=150"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=150"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}