{"id":416,"date":"2018-08-06T14:05:13","date_gmt":"2018-08-06T14:05:13","guid":{"rendered":"https:\/\/www.haoyuan.info\/?p=416"},"modified":"2018-08-06T15:07:35","modified_gmt":"2018-08-06T15:07:35","slug":"hdu-6356-glad-you-came-problem-1007-%e6%9d%ad%e7%94%b5%e5%a4%9a%e6%a0%a1%e7%ac%ac%e4%ba%94%e5%9c%ba","status":"publish","type":"post","link":"https:\/\/haoyuan.info\/?p=416","title":{"rendered":"HDU 6356 Glad You Came Problem 1007 \u676d\u7535\u591a\u6821\u7b2c\u4e94\u573a"},"content":{"rendered":"

\u9898\u610f<\/h2>\n

\u7ed9\u5b9a\u957f\u4e3a$n$\u7684\u6570\u7ec4\uff0c\u521d\u59cb\u503c\u5747\u4e3a0
\n\u6267\u884cm\u4e2a\u64cd\u4f5c\uff0c\u6bcf\u6b21\u64cd\u4f5c\u7684\u884c\u4e3a
\n\u5982\u539f\u9898\u9762<\/p>\n

\u9898\u89e3<\/h2>\n

\u5f88\u591a\u4eba\u7528\u7ebf\u6bb5\u6811\u5f04\u8fc7\u53bb\u4e86\uff0c\u4f46\u662f\u8fd9\u4e2a\u975e\u5e38\u8003\u9a8c\u6a21\u677f\u7684\u6c34\u5e73\uff0c\u5982\u679c\u5e38\u6570\u6bd4\u8f83\u5927\u8fd9\u4e2a\u65b9\u6cd5\u5c31GG\u4e86<\/p>\n

\u5b98\u65b9\u9898\u89e3\u7684\u89e3\u6cd5\u8bf4\u7684\u4e0d\u662f\u5f88\u6e05\u695a\uff0c\u800c\u6839\u636e\u5b98\u65b9\u6807\u7a0b\u7684\u5b9e\u73b0\u65b9\u5f0f\uff0c\u5b9e\u9645\u4e0a\u5c31\u662f\u4e00\u4e2a\u6807\u51c6\u7684RMQ\u9006\u5411\u7684\u8fc7\u7a0b\u3002<\/p>\n

\u9996\u5148\u5bf9\u4e8eRMQ \u6211\u4eec\u8981\u5b66\u4e60\u4ec0\u4e48\u662fST\u8868\u3002\u9644\u5f55:ST\u8868<\/a>
\n\u7136\u540e\u6211\u4eec\u5728m\u6b21\u64cd\u4f5c\u4e2d\uff0c\u628a\u4e00\u4e2a\u533a\u95f4\u5206\u6210\u4e24\u4efd:
\n\u4ee4 $d$ \u7b49\u4e8e $\\left \\lfloor \\log_2(r – l + 1) \\right \\rfloor$\uff0c\u6211\u4eec\u53ef\u4ee5\u7528\u4e24\u4e2a\u64cd\u4f5c $(l, l + 2^d – 1, v)$ \u548c $(r – 2^d + 1, r, v)$ \u66ff\u6362\u6b64\u64cd\u4f5c\u3002\u6b63\u5982RMQ\u67e5\u8be2\u8fc7\u7a0b\u4e2d\u628a\u4e00\u4e2a\u533a\u95f4\u5206\u6210\u4e24\u4efd\u4e00\u6837\u3002(\u8be6\u89c1\u7b97\u6cd5\u7ade\u8d5b\u5165\u95e8\u7ecf\u5178–\u8bad\u7ec3\u6307\u5357P198)
\n\u6c42log\u7684\u64cd\u4f5c\u5e94\u8be5\u9884\u5904\u7406\u51falog\u8868<\/p>\n

\u7136\u540e\u6211\u4eec\u53cd\u8fc7\u6765\u628a\u6700\u5927\u503c\u5411\u957f\u5ea6\u4e3a1\u7684\u533a\u95f4\u8fdb\u884c\u5408\u5e76\uff0c\u8fd9\u4e2a\u8fc7\u7a0b\u662f$\\mathcal O(nlogn)$\u7684<\/p>\n

\u6700\u540e$\\mathcal O(n)$\u626b\u4e00\u904d\u957f\u5ea6\u4e3a0\u7684\u533a\u95f4\u5373\u53ef\u3002
\n\u521d\u59cb\u5316\u7684\u8fc7\u7a0b\u53ef\u4ee5\u5728\u5408\u5e76\u533a\u95f4\u7684\u8fc7\u7a0b\u8fdb\u884c\u3002<\/p>\n

\u8fd9\u91cc\u6709\u4e00\u4e2a\u5c0f\u5c0f\u7684\u4f18\u5316:
\nv\u662f\u8981\u5bf9$2^{30}$\u53d6\u6a21\u7684\uff0c\u6211\u4eec\u77e5\u9053$2^{30}$\u7528\u4e8c\u8fdb\u5236\u8868\u793a\u53ea\u6709\u4e00\u4e2a1\uff0c\u540e\u9762\u90fd\u662f0
\n\u56e0\u6b64\u6211\u4eec\u53ef\u4ee5\u7528\u4f4d\u8fd0\u7b97\u4ee3\u66ff\u6a21\u8fd0\u7b97\u3002
\n\u5982\u6a21\u8fd0\u7b97$8_{10} = 1000_{2}$ \u7b49\u4ef7\u4e8e\u4e0e\u8fd0\u7b97 $7_{10} = 0111_{2}$<\/p>\n

AC\u4ee3\u7801<\/h2>\n
#pragma GCC optimize(\"O3\")\n\n#include <iostream>\n#include <algorithm>\n#include <cstring>\n#include <cmath>\n#include <vector>\n#include <array>\n\nusing namespace std;\nusing ll = long long;\nusing LL = ll;\nusing un = unsigned;\nconst int maxn = 1e5 + 6, maxd = 17;\nint T, n, m, mx, Log[maxn], a[maxd][maxn];\nun X, Y, Z;\n\nun rng61() {\n    X ^= X << 11;\n    X ^= X >> 4;\n    X ^= X << 5;\n    X ^= X >> 14;\n    un tmp = X ^Y ^Z;\n    X = Y;\n    Y = Z;\n    Z = tmp;\n    return Z;\n}\n\n\nint main() {\n    ios::sync_with_stdio(false);\n    cin.tie(0);\n    cout.tie(0);\n    for (int i = 2; i < maxn; ++i)\n        Log[i] = Log[i >> 1] + 1;\n    cin >> T;\n    while (T--) {\n        cin >> n >> m >> X >> Y >> Z;\n        for (mx = 0; 1 << mx <= n; ++mx);\n        while (m--) {\n            int L = rng61() % n + 1, R = rng61() % n + 1, v = rng61() & ((1 << 30) - 1);\n            if (L > R)\n                swap(L, R);\n            int d = Log[R - L + 1];\n            a[d][L] = max(a[d][L], v);\n            a[d][R - (1 << d) + 1] = max(a[d][R - (1 << d) + 1], v);\n        }\n        for (int i = mx - 1; i > 0; --i)\n            for (int j = 1; j + (1 << i) - 1 <= n; ++j) {\n                a[i - 1][j] = max(a[i - 1][j], a[i][j]);\n                a[i - 1][j + (1 << (i - 1))] = max(a[i - 1][j + (1 << (i - 1))], a[i][j]);\n                a[i][j] = 0;\n            }\n        LL ans = 0;\n        for (int i = 1; i <= n; ++i) {\n            ans ^= (LL) i * a[0][i];\n            a[0][i] = 0;\n        }\n        cout << ans << \"\\n\";\n    }\n}\n<\/code><\/pre>\n
\u9644\u7ebf\u6bb5\u6811\u7684\u5199\u6cd5 \u5f15\u7528\u81eahttps:\/\/blog.csdn.net\/f2935552941\/article\/details\/81460692<\/a><\/p>\n
#include<bits\/stdc++.h>\n#define lson rt<<1\n#define rson rt<<1|1\nusing namespace std;\nconst int MAX=1e5+10;\nconst int MOD=1e9+7;\nconst double PI=acos(-1.0);\ntypedef long long ll;\n\nll ans;\nstruct node\n{\n    int l,r,mid;    \/\/\u7ef4\u62a4\u533a\u95f4\u6700\u5c0f\u503c\n    ll val;\n}t[MAX<<2];\n\nunsigned X,Y,Z,W;\nunsigned f()\n{\n    X=X^(X<<11);\n    X=X^(X>>4);\n    X=X^(X<<5);\n    X=X^(X>>14);\n    W=X^(Y^Z);\n    X=Y;\n    Y=Z;\n    Z=W;\n    return Z;\n}\nvoid pushup(int rt)\n{\n    t[rt].val=min(t[lson].val,t[rson].val);\n}\nvoid pushdown(int rt)\n{\n    if(t[rt].val)\n    {\n        t[lson].val=max(t[lson].val,t[rt].val); \/\/pushdown\u8981\u53d6\u8f83\u5927\u503c\n        t[rson].val=max(t[rson].val,t[rt].val);\n        t[rt].val=0;\n    }\n}\nvoid build(int l,int r,int rt)\n{\n    int mid=(l+r)>>1;\n    t[rt].l=l,t[rt].r=r,t[rt].mid=mid;\n    t[rt].val=0;\n    if(l==r)\n        return ;\n    build(l,mid,lson);\n    build(mid+1,r,rson);\n    pushup(rt);\n}\nvoid update(int l,int r,ll val,int rt)\n{\n    if(t[rt].val>=val) return ; \/\/\u8fd9\u4e00\u6b65\u7684\u526a\u679d\u5f88\u5173\u952e\n    if(l<=t[rt].l&&t[rt].r<=r)\n    {\n        if(t[rt].val<=val) t[rt].val=val; \/\/\u7b26\u5408\u8981\u6c42\u5c31\u66f4\u65b0\n        return ;\n    }\n    pushdown(rt);\n    if(l<=t[rt].mid) update(l,r,val,lson);\n    if(r>t[rt].mid) update(l,r,val,rson);\n    pushup(rt);\n}\nvoid query(int l,int r,int rt)\n{\n    if(t[rt].l==t[rt].r)\n    {\n        ans=ans^(t[rt].val*t[rt].l); \/\/\u6c42\u7b54\u6848\n        return ;\n    }\n    pushdown(rt);\n    query(l,r,lson);\n    query(l,r,rson);\n}\nint main()\n{\n    int T;\n    cin>>T;\n    while(T--)\n    {\n        int n,m;\n        scanf(\"%d%d\",&n,&m);\n        cin>>X>>Y>>Z;\n        build(1,n,1);\n        int l,r; ll val;\n        for(int i=1;i<=m;i++)\n        {\n            ll x=f();\n            ll y=f();\n            l=min(x%n+1,y%n+1);\n            r=max(x%n+1,y%n+1);\n            val=f()%(1<<30);\n            update(l,r,val,1);\n        }\n        ans=0;\n        query(1,n,1);\n        printf(\"%lld\\n\",ans);\n    }\n    return 0;\n}\n\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u9898\u610f \u7ed9\u5b9a\u957f\u4e3a$n$\u7684\u6570\u7ec4\uff0c\u521d\u59cb\u503c\u5747\u4e3a0 \u6267\u884cm\u4e2a\u64cd\u4f5c\uff0c\u6bcf\u6b21\u64cd\u4f5c\u7684\u884c\u4e3a \u5982\u539f\u9898\u9762 \u9898\u89e3 \u5f88\u591a\u4eba\u7528\u7ebf\u6bb5\u6811\u5f04\u8fc7\u53bb\u4e86 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"spay_email":"","footnotes":"","jetpack_publicize_message":"","jetpack_is_tweetstorm":false},"categories":[39,25,51,22],"tags":[],"class_list":["post-416","post","type-post","status-publish","format-standard","hentry","category-c","category-25","category-51","category-22"],"jetpack_featured_media_url":"","jetpack_publicize_connections":[],"jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p8UC2c-6I","jetpack_likes_enabled":true,"jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/posts\/416","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=416"}],"version-history":[{"count":0,"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/posts\/416\/revisions"}],"wp:attachment":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=416"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=416"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=416"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}