{"id":411,"date":"2020-05-01T00:06:16","date_gmt":"2020-04-30T16:06:16","guid":{"rendered":"http:\/\/nocriz.com\/?p=411"},"modified":"2021-12-04T07:00:44","modified_gmt":"2021-12-03T23:00:44","slug":"agc037%e5%81%9a%e9%a2%98%e8%ae%b0","status":"publish","type":"post","link":"https:\/\/nocriz.com\/?p=411","title":{"rendered":"AGC037\u505a\u9898\u8bb0"},"content":{"rendered":"\n<figure class=\"wp-block-pullquote\"><blockquote><p>\u4ec0\u4e48\u65f6\u5019\u5e94\u8be5\u770b\u9898\u89e3\uff1f<\/p><p>\u5f53\u4f60\u89c9\u5f97\u4f60\u201c\u4e0d\u53ef\u80fd\u201d\u505a\u51fa\u4e00\u4e2a\u9898\u7684\u65f6\u5019\u3002<\/p><cite>\u4e09\u4e2a\u9876\u4fe9\u91c7\u8bbf\uff08\u53e6\u9009\u624b\u8bf4\u201c\u4e0d\u80fd\u94bb\u725b\u89d2\u5c16\u201d\uff09<\/cite><\/blockquote><\/figure>\n\n\n\n<p>\u8fd9\u662f\u4e00\u573a\u8fd8\u7b97\u6210\u529f\u7684\u8bad\u7ec3\u2026\u2026\u8ba9\u6211\u5728\u82e5\u5e72\u5929\u9893\u5e9f\u4e2d\u611f\u53d7\u5230\u6bd4\u8f83\u5145\u5b9e\u2026\u2026<\/p>\n\n\n\n<p>A\u3001B\u3001C\u3001D\u3001E\u3001F\u90fd\u662f\u81ea\u5df1\u60f3\u7684\uff08F\u7b97\u4e00\u534a\u5427\uff09\u505a\u6cd5\uff0c\u4f46\u662f\u4e0d\u662f\u5f88\u60f3\u8d39\u65f6\u95f4\u5199\u5f88\u957f\u5728\u535a\u5ba2\u4e0a\uff08\u5bf9\u4e0d\u8d77\uff09\uff0c\u5199\u4e86\u4e00\u70b9\u5410\u69fd\u63d0\u793a\u2026\u2026\u6211\u6709\u65f6\u95f4\u518d\u53bb\u770b\u770bF AC\u7684\u77ed\u4ee3\u7801\u662f\u600e\u4e48\u641e\u7684\u5427\u2026\u2026<\/p>\n\n\n\n<p>\u5e0c\u671b\u81ea\u5df1\u672a\u6765\u80fd\u591f\u6709\u8ba1\u5212\u5730\u505a\u66f4\u591a\u6709\u610f\u4e49\u7684\u9898\u3002\u5e0c\u671b\u4ee5\u540e\u6bcf\u5929\u80fd\u505a\u66f4\u591a\u4f5c\u4e1a\u9898\u6216\u8005\u5176\u4ed6\u597d\u9898\u3002<\/p>\n\n\n\n<!--more-->\n\n\n\n<ul><li>A:\u731c\u60f3\u53ea\u6709\u957f\u5ea6\u4e3a1\u30012\u7684\u5212\u5206\u6709\u7528\uff0c\u6ca1\u8bc1\u660e\uff0c\u9898\u89e3\u8bf4\u968f\u4fbf\u8bc1\u660e\u77ed\u4e8e5\u7684\u6709\u7528\uff0c\u4f46\u662f\u771f\u7684\u6709\u4eba\u4f1a\u8fd9\u4e48\u601d\u8003\uff1f<\/li><li>B:\u5199\u4e86\u4e00\u4e2a\u5f88\u76f4\u89c9\u4f46\u662f\u611f\u89c9\u6709\u70b9\u5bf9\u7684\u7b97\u6cd5\uff0c\u4e5f\u6ca1\u8bc1\u660e\u5c45\u7136\u8fc7\u4e86\uff1f<\/li><li>C:\u663e\u7136\u6bcf\u6b21\u9700\u8981\u64cd\u4f5c\u6700\u5927\u7684\u90a3\u4e2a\uff0c\u64cd\u4f5c\u5c3d\u53ef\u80fd\u591a\u6b21\u3002\u5806\u7ef4\u62a4\u4e00\u4e0b\u5373\u53ef\u3002<\/li><li>D:\u8f6c\u5316\u4e3a\u4e00\u4e2a\u4e8c\u5206\u56fe\u5339\u914d\u95ee\u9898\uff0c\u66b4\u529b\u5339\u914d\u590d\u6742\u5ea6\u770b\u4e0a\u53bb\u6709\u70b9\u9ad8\u4f46\u662f30ms\u3002<\/li><li>E:\u611f\u89c9\u5c31\u662f\u4e2aDiv2 C\u9898\uff0c\u8fd9\u79cd\u9898\u8fd8\u80fd\u653e\u5728AGC E?<\/li><li>F:\u8fd9\u9053\u9898\u6709\u70b9nb\uff0c\u9898\u89e3\u5199\u7684\u5f88\u597d\uff0c\u4f46\u662f\u601d\u8def\u8fd8\u9700\u8981\u81ea\u5df1\u9886\u609f\u4e00\u4e0b\u2026\u2026\u6211\u5199\u7684\u4e5f\u591f\u957f\uff0c\u597d\u50cf\u6709\u7684\u9009\u624b\u53c8\u77ed\u53c8\u5feb\uff0c\u6211\u592a\u83dc\u4e86\u2026\u2026<\/li><\/ul>\n\n\n\n<p>\u8fd9\u573a\u8bad\u7ec3\u544a\u8bc9\u6211\uff1a\u5bf9\u4e8e\u4e00\u9053\u9898\u76ee\uff0c\u5e94\u8be5\u4ece\u591a\u79cd\u89d2\u5ea6\u53bb\u60f3\uff08F\uff09\u2026\u2026\u8981\u76f8\u4fe1\u9898\u76ee\u662f\u7b80\u5355\u7684\uff0c\u4f60\u662f\u80fd\u505a\u51fa\u6765\u7684\uff0c\u81f3\u5c11\u4e0d\u662f\u4e0d\u53ef\u80fd\u505a\u51fa\u6765\u7684\u4e0d\u662f\u5417\uff1f\u5bf9\u4e8eAGC\uff0c\u4f3c\u4e4e\u6c38\u8fdc\u90fd\u662f\u8fd9\u6837\u7684\uff0c\u53ea\u8981\u81ea\u5df1\u60f3\u7684\u51fa\uff0c\u5c31\u80fdAC\u3002\u56e0\u4e3aAtcoder\u91cc\u9762\u597d\u50cf\u6ca1\u6709\u5565\u83ab\u540d\u5176\u5999\u7684\u9ad8\u6df1\u7b97\u6cd5\u548c\u8d39\u52b2\u7684\u5b9e\u73b0\u3002\u5982\u679c\u968f\u4fbf\u770b\u4e86\u9898\u89e3\uff0c\u518d\u8865\u9898\uff0c\u5c31\u53d8\u6210\u642c\u7816\u4e86\uff0c\u800c\u4e14\u4e5f\u4e0d\u4f1a\u6709\u8865\u9898\u7684\u5174\u8da3\u4e86\uff0c\u6bd5\u7adf\u5c31\u53d8\u6210\u544a\u8bc9\u4f60\u600e\u4e48\u5e72\u4f60\u53bb\u5199\u4e00\u4e2a\u5f88\u957f\u7684\u4ee3\u7801\u2026\u2026\u542c\u4e0a\u53bb\u4e5f\u5f88\u65e0\u8da3\uff0c\u4f46\u662f\u5982\u679c\u662f\u81ea\u5df1\u60f3\u51fa\u6765\u7684\u5c31\u4f1a\u5f88\u611f\u5174\u8da3\u53bb\u5199\uff0c\u56e0\u4e3a\u4f60\u60f3\u770b\u5230\u81ea\u5df1\u7684\u7b97\u6cd5\u662f\u5bf9\u7684\uff0c\u81ea\u5df1\u72ec\u7acbAC\u4e86\u4e00\u9053\u4f3c\u4e4e\u6709\u70b9\u96be\u5ea6\u7684\u9898\uff0c\u8fd8\u5f88\u597d\u3002<\/p>\n\n\n\n<p>\u5e0c\u671b\u4ee5\u540e\u80fd\u591f\u548c\u9ad8\u6c34\u5e73\u9009\u624b\u591a\u4ea4\u6d41\u5b66\u4e60\u2026\u2026\u627e\u4e2a\u5927\u817f\u62b1\u4e00\u4e0b\u2026\u2026<\/p>\n\n\n\n<p>\u5e0c\u671b\u660e\u5929\u5f00\u59cb\u7684\u4e94\u573aICPC\u6bd4\u8d5b\u4e0d\u8981\u57ab\u5e95\uff0c\u6210\u7ee9\u6700\u597d\u80fd\u6bd4\u9009\u62d4\u8d5b\u597d\u4e00\u4e9b\uff0c\u518d\u597d\u4e00\u4e9b\u2026\u2026\u5e0c\u671b\u6211\u80fd\u591f\u5728\u4e0d\u770b\u9898\u89e3\u7684\u60c5\u51b5\u4e0b\u505a\u51fa\u3001\u8865\u51fa\u66f4\u591a\u7684\u9898\u76ee\u3002<\/p>\n\n\n\n<p>\u7b97\u6cd5\u9898\u50cf\u5f39\u7c27\uff0c\u4f60\u5f31\u5b83\u5c31\u5f3a\uff01\u4e00\u9053\u96be\u5ea6\u4e3a1.5\u7684\u9898\u76ee\uff0c\u5982\u679c\u4f60\u601d\u8003\u4e94\u5206\u949f\u80fd\u591f\u601d\u80031.2\uff0c\u7136\u540e\u4f60\u8bf4\uff1a\u6211\u77e5\u9053\u81f3\u5c11\u8fd9\u4e2a\u9898\u96be\u5ea6\u6bd41.2\u9ad8\uff0c\u6211\u7684\u6c34\u5e73\u662f1.2\uff0c\u4e0d\u505a\u4e86\u770b\u9898\u89e3\uff0c\u90a3\u5c31\u722c\u4e86\u3002\u5982\u679c\u4f60\u6362\u79cd\u65b9\u6cd5\u60f3\uff0c\u8fd9\u4e2a\u9898\u96be\u5ea6\u5c0f\u4e8e2\uff0c\u770b\u4e0a\u53bb\u53c8\u4e0d\u662f\u5565\u5c1a\u4e14\u4e0d\u4f1a\u7684\u7b97\u6cd5\uff0c\u81ea\u5df1\u4e0d\u662f\u4e0d\u53ef\u80fd\u505a\u51fa\uff0c\u4ee5\u8fd9\u79cd\u601d\u8def\u518d\u60f320\u5206\u949f\uff0c\u6216\u8bb8\u603b\u7684\u601d\u8003\u91cf\u5c31\u8db3\u4ee5\u89e3\u51b3\u8fd9\u4e2a1.5\u7684\u9898\u76ee\u4e86\u2026\u2026<\/p>\n\n\n\n<p>\u7761\u89c9\u4e86\u3002\u8fd8\u662f\u5199\u4e86\u4e00\u4e9b\u83ab\u540d\u5176\u5999\u7684\u6587\u5b57\u2026\u2026<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">A<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code>char s&#91;200020];\nint main() {\n    cin&gt;&gt;(s+1);\n    int cp = 1,la = 2,ans = 0,n = strlen(s+1);\n    while(cp&lt;=n){\n        if(la == 2 || s&#91;cp]!=s&#91;cp-1]){\n            la = 1;\n            cp+=1;\n            ans+=1;\n        }else{\n            la = 2;\n            cp+=2;\n            if(cp&lt;=n+1)ans+=1;\n        }\n    }\n    cout&lt;&lt;ans&lt;&lt;endl;\n    return 0;\n}<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">B<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code>int n;\nchar S&#91;300030];\nint main() {\n    cin&gt;&gt;n&gt;&gt;S;\n    int cnt&#91;8] = {0},ans = 1;\n    for(int i=1;i&lt;=n;i++) ans = mul(ans,i);\n    for(int i=0;i&lt;3*n;i++){\n        int cv = S&#91;i] == 'R'?0:(S&#91;i] == 'G'?1:2),cs = 1&lt;&lt;cv;\n        if(cnt&#91;7-cs]){\n            ans = mul(ans,cnt&#91;7-cs]);\n            cnt&#91;7-cs]--;\n        }else{\n            if(((cs!=1 &amp;&amp; cnt&#91;1]) || (cs!=2 &amp;&amp; cnt&#91;2]) || (cs!=4 &amp;&amp; cnt&#91;4]))){\n                for(int i=1;i&lt;=8;i*=2)\n                if(cs!=i &amp;&amp; cnt&#91;i]){\n                    ans = mul(ans,cnt&#91;i]);\n                    cnt&#91;i|cs] = add(cnt&#91;i|cs],1);\n                    cnt&#91;i]-=1;\n                }\n            }else{\n                cnt&#91;cs]+=1;\n            }\n        }\n    }\n    cout&lt;&lt;ans&lt;&lt;endl;\n    return 0;\n}<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">C<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code>\nint n,A&#91;200020],B&#91;200020];\nvoid exi(){\n    cout&lt;&lt;-1&lt;&lt;endl;\n    exit(0);\n}\nsigned main() {\n    read(n);\n    for(int i=1;i&lt;=n;i++){\n        read(A&#91;i]);\n    }\n    int ans = 0;\n    priority_queue&lt;pii&gt; Q;\n    for(int i=1;i&lt;=n;i++){\n        read(B&#91;i]);\n        Q.push(MP(B&#91;i],i));\n    }\n    B&#91;0] = B&#91;n];B&#91;n+1] = B&#91;1];\n    while(!Q.empty()){\n        pii C = Q.top();Q.pop();\n        if(C.first == A&#91;C.second])continue;\n        int lr = B&#91;C.second-1]+B&#91;C.second+1];\n        int req = (C.first-A&#91;C.second])\/lr;\n        ans+=req;\n        if(!req)exi();\n        C.first-=req*lr;\n        B&#91;C.second] = C.first;\n        B&#91;0] = B&#91;n];B&#91;n+1] = B&#91;1];\n        Q.push(C);\n    }\n    cout&lt;&lt;ans&lt;&lt;endl;\n    return 0;\n}<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">D<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code>int n,m,A&#91;110]&#91;110],B&#91;110]&#91;110];\nvector&lt;int&gt; cnt&#91;110]&#91;110];\nvector&lt;int&gt; G&#91;110];\nint vis&#91;110] = {0},btoa&#91;110] = {0},btob&#91;110];\nbool dfs(int num){\n    if(vis&#91;num])return false;vis&#91;num] = 1;\n    for(auto ct:G&#91;num]){\n        if(btoa&#91;ct] == 0 || dfs(btoa&#91;ct])){\n            btoa&#91;ct] = num;\n            btob&#91;num] = ct;\n            return true;\n        }\n    }\n    return false;\n}\nint main() {\n    read(n,m);\n    for(int i=1;i&lt;=n;i++){\n        for(int j=1;j&lt;=m;j++){\n            read(A&#91;i]&#91;j]);\n            cnt&#91;i]&#91;(A&#91;i]&#91;j]-1)\/m+1].PB(A&#91;i]&#91;j]);\n        }\n    }\n    for(int i=1;i&lt;=m;i++){\n        for(int a=1;a&lt;=n;a++){\n            G&#91;a].clear();\n            for(int b=1;b&lt;=n;b++){\n                if(cnt&#91;b]&#91;a].size()){\n                    G&#91;a].PB(b);\n                }\n            }\n        }\n        set0(btoa);\n        for(int j=1;j&lt;=n;j++){\n            set0(vis);\n            assert(dfs(j));\n        }\n        for(int j=1;j&lt;=n;j++){\n            B&#91;btob&#91;j]]&#91;i] = cnt&#91;btob&#91;j]]&#91;j].back();\n            cnt&#91;btob&#91;j]]&#91;j].pop_back();\n        }\n    }\n    for(int i=1;i&lt;=n;i++){\n        for(int j=1;j&lt;=m;j++)cout&lt;&lt;B&#91;i]&#91;j]&lt;&lt;\" \\n\"&#91;j == m];\n    }\n    for(int k=1;k&lt;=m;k++)for(int i=1;i&lt;=n;i++)for(int j=1;j&lt;=n-1;j++)if(B&#91;j]&#91;k]&gt;B&#91;j+1]&#91;k])swap(B&#91;j]&#91;k],B&#91;j+1]&#91;k]);\n    for(int i=1;i&lt;=n;i++){\n        for(int j=1;j&lt;=m;j++)cout&lt;&lt;B&#91;i]&#91;j]&lt;&lt;\" \\n\"&#91;j == m];\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">E<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code>int n,k;\nint main() {\n    string S;\n    cin&gt;&gt;n&gt;&gt;k&gt;&gt;S;\n    string T = S;\n    reverse(all(T));\n    string U = S+T;\n    vector&lt;string&gt; V;\n    for(int i=0;i&lt;=n;i++){\n        V.PB(U.substr(i,n));\n    }\n    sort(all(V));\n    string C = V&#91;0];\n    if(k == 1){\n        cout&lt;&lt;C&lt;&lt;endl;\n        return 0;\n    }\n    if(k&gt;13){\n        for(int i=0;i&lt;n;i++)cout&lt;&lt;C&#91;0];\n        cout&lt;&lt;endl;\n    }else{\n        int cc = 0;\n        while(C&#91;cc] == C&#91;0])cc++;\n        int cl = cc&lt;&lt;(k-1);\n        for(int i=0;i&lt;n;i++){\n            if(i&lt;cl)cout&lt;&lt;C&#91;0];\n            else{\n                cout&lt;&lt;C&#91;i-cl+cc];\n            }\n        }\n        cout&lt;&lt;endl;\n    }\n    return 0;\n}\n<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">F<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code>int n,k,cc;\nll ans = 0;\ntemplate&lt;class T&gt;\nstruct RMQ {\n    vector&lt;vector&lt;T&gt;&gt; jmp;\n    RMQ(const vector&lt;T&gt;&amp; V) : jmp(1, V) {\n        for (int pw = 1, k = 1; pw * 2 &lt;= sz(V); pw *= 2, ++k) {\n            jmp.emplace_back(sz(V) - pw * 2 + 1);\n            rep(j,0,sz(jmp&#91;k]))\n            jmp&#91;k]&#91;j] = max(jmp&#91;k - 1]&#91;j], jmp&#91;k - 1]&#91;j + pw]);\n        }\n    }\n    T query(int a, int b) {\n        assert(a &lt; b); \/\/ or return inf if a == b\n        int dep = 31 - __builtin_clz(b - a);\n        return max(jmp&#91;dep]&#91;a], jmp&#91;dep]&#91;b - (1 &lt;&lt; dep)]);\n    }\n};\nset&lt;pii&gt; S;\n#define CAT(A,B)  A.insert(A.end(),all(B))\nstruct ret{\n    vll val,L,R;\n    void absorb(ret rhs){\n        CAT(val,rhs.val);\n        CAT(L,rhs.L);\n        CAT(R,rhs.R);\n    }\n};\nvector&lt;int&gt; A(1,0);\nRMQ&lt;int&gt; Q(A);\nll calc(ret &amp;C){\n    ll cr = 0;\n    int c = 0;\n    while(c&lt;C.val.size()){\n        int d = c,cu = 0;\n        while(d&lt;C.val.size() &amp;&amp; C.val&#91;d]!=-1){\n            if(d&gt;c+k-2)cu+=C.R&#91;d];\n            d++;\n        }\n        for(int i=c;i&lt;d;i++){\n            cr = cr+C.L&#91;i]*C.R&#91;i];\n            cr = cr+1ll*cu*C.L&#91;i];\n            if(i+k-1&lt;d){\n                cu-=C.R&#91;i+k-1];\n            }\n        }\n        c = d+1;\n    }\n    return cr;\n}\nret solve(int l,int r,int ep){\n    if(l&gt;r)return ret();\n    int p = l,cmx = Q.query(l,r+1);\n    ret C,I;I.val.PB(cmx);I.R.PB(1);I.L.PB(1);\n    while(p&lt;=r){\n        int nxt = S.lower_bound(MP(cmx,p))-&gt;second;\n        if(nxt&gt;r){\n            C.absorb(solve(p,r,cmx));\n            break;\n        }else{\n            C.absorb(solve(p,nxt-1,cmx));\n            C.absorb(I);\n            p = nxt+1;\n        }\n    }\n    ans+=calc(C);\n    if(ep-cmx&gt;25 || pow(1.0*k,ep-cmx)&gt;2*(r-l+1) || pow(k,ep-cmx)&gt;C.val.size()){\n        I.val&#91;0] = -1;\n        return I;\n    }\n    int req = 1;for(int i=0;i&lt;ep-cmx;i++)req*=k;\n    int cnt = 0;\n    for(auto ct:C.val)if(ct == -1)cnt+=1;\n    ret CR;\n    if(cnt){\n        vll L,R;\n        for(int i=0;C.val&#91;i] == cmx;i++){\n            if((i+1)\/req!=0){\n                int cp = (i+1)\/req-1;\n                if(R.size()&lt;cp+1)R.PB(0);\n                R&#91;cp]+=C.R&#91;i];\n            }\n        }\n        for(int i=0;C.val&#91;C.val.size()-1-i] == cmx;i++){\n            if((i+1)\/req!=0){\n                int cp = (i+1)\/req-1;\n                if(L.size()&lt;cp+1)L.PB(0);\n                L&#91;cp]+=C.L&#91;C.L.size()-1-i];\n            }\n        }\n        for(int i=0;i&lt;R.size();i++){\n            CR.R.PB(R&#91;i]);\n            CR.L.PB(0);\n            CR.val.PB(ep);\n        }\n        CR.R.PB(0);\n        CR.L.PB(0);\n        CR.val.PB(-1);\n        for(int i=0;i&lt;L.size();i++){\n            CR.R.PB(0);\n            CR.L.PB(L&#91;L.size()-1-i]);\n            CR.val.PB(ep);\n        }\n    }else{\n        int cul = C.val.size()\/req;\n        CR.val = vll(cul,ep);\n        CR.L = vll(cul,0);\n        CR.R = vll(cul,0);\n        for(int i=req;i&lt;=C.val.size();i++){\n            CR.R&#91;i\/req-1]+=C.R&#91;i-1];\n            CR.L&#91;cul-i\/req]+=C.L&#91;C.val.size()-i];\n        }\n    }\n    ans-=calc(CR);\n    return CR;\n}\nint main() {\n    read(n,k);\n    for(int i=1;i&lt;=n;i++){\n        read(cc);\n        A.PB(cc);\n        S.insert(MP(cc,i));\n        S.insert(MP(cc,1e9));\n    }\n    Q = RMQ&lt;int&gt;(A);\n    solve(1,n,1e9+1);\n    cout&lt;&lt;ans&lt;&lt;endl;\n    return 0;\n}\n<\/code><\/pre>\n ","protected":false},"excerpt":{"rendered":"<p>\u4ec0\u4e48\u65f6\u5019\u5e94\u8be5\u770b\u9898\u89e3\uff1f \u5f53\u4f60\u89c9\u5f97\u4f60\u201c\u4e0d\u53ef\u80fd\u201d\u505a\u51fa\u4e00\u4e2a\u9898\u7684\u65f6\u5019\u3002 \u4e09\u4e2a\u9876\u4fe9\u91c7\u8bbf\uff08\u53e6\u9009\u624b\u8bf4\u201c\u4e0d\u80fd\u94bb\u725b\u89d2\u5c16\u201d\uff09 \u8fd9\u662f\u4e00 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"_links":{"self":[{"href":"https:\/\/nocriz.com\/index.php?rest_route=\/wp\/v2\/posts\/411"}],"collection":[{"href":"https:\/\/nocriz.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/nocriz.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/nocriz.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/nocriz.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=411"}],"version-history":[{"count":2,"href":"https:\/\/nocriz.com\/index.php?rest_route=\/wp\/v2\/posts\/411\/revisions"}],"predecessor-version":[{"id":794,"href":"https:\/\/nocriz.com\/index.php?rest_route=\/wp\/v2\/posts\/411\/revisions\/794"}],"wp:attachment":[{"href":"https:\/\/nocriz.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=411"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/nocriz.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=411"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/nocriz.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=411"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}