{"id":904,"date":"2014-06-03T23:42:00","date_gmt":"2014-06-03T15:42:00","guid":{"rendered":"http:\/\/www.shuizilong.com\/house\/?p=904"},"modified":"2016-08-24T21:02:49","modified_gmt":"2016-08-24T13:02:49","slug":"acm-icpc-regional-asia-changchun-2013-onsite","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/house\/archives\/acm-icpc-regional-asia-changchun-2013-onsite\/","title":{"rendered":"ACM-ICPC Regional Asia Changchun 2013 Onsite"},"content":{"rendered":"

http:\/\/acmicpc.info\/archives\/1710<\/a>
\nhttp:\/\/blog.renren.com\/blog\/271960376\/918770698?bfrom=01020110200<\/a>
\nhttps:\/\/gist.github.com\/lychees\/803f6e6a61c0f393660a<\/a><\/p>\n

Problem D. Bathysphere<\/h2>\n

Brief description:<\/h3>\n

\u3002\u3002\u3002x<\/code> \u8f74\u4e0a\u65b9\u7ed9\u5b9a\u4e00\u6bb5\u6298\u7ebf\u3002\uff08\u4e00\u4e2a\u5206\u6bb5\u7ebf\u6027\u53ef\u79ef\u51fd\u6570\uff09\u3002
\n\u3002\u3002\u6c42 d<\/code> \u5bbd\u5ea6\u7684\u7a97\u53e3\u5185\u7684\u6700\u5927\u9762\u79ef\u3002\u3002\u3002<\/p>\n

<\/p>\n

Analysis:<\/h3>\n

Two Point<\/code> \u89e3\u65b9\u7a0b<\/code><\/p>\n

\u4e3a\u4e86\u5904\u7406\u65b9\u4fbf\u6211\u4eec\u5148\u51c6\u5907\u4e00\u4e9b\u8f85\u52a9\u51fd\u6570\u3002\u3002\u3002<\/p>\n

\r\ninline DB yy(int i, DB xx){ \/\/ \u6c42\u6a2a\u5750\u6807\u4e3a xx \u65f6\u7684\u51fd\u6570\u503c\u3002\u3002\r\n    return y[i] + (xx-x[i])*slope[i];\r\n}\r\n\r\ninline DB s(int i, DB st, DB ed){ \/\/\u6c42 st \u5230 ed \u8fd9\u6bb5\u533a\u95f4\u7684\u9762\u79ef\u3002\u3002\r\n    return (ed-st)*(yy(i,st)+yy(i,ed));\r\n}\r\n<\/pre>\n
\u8003\u8651 Two Point<\/code> \u7684\u90e8\u5206\u3002\u3002\u6211\u4eec\u7528 ll<\/code>, rr<\/code> \u8bb0\u5f55\u5f53\u524d\u7a97\u53e3\u7684\u4f4d\u7f6e\u3002\u3002\uff08rr-ll<\/code> \u603b\u7b49\u4e8e d<\/code>\u3002\u3002\u3002\u518d\u7528 l<\/code>\uff0c r<\/code> \u8bb0\u5f55\u5176\u5de6\u4fa7\u7b2c\u4e00\u4e2a\u7ed3\u70b9\u7684\u4f4d\u7f6e\u3002\u3002\u3002<\/p>\n
\r\n...\r\n        for (;r<n-1;l+=ll==x[l+1],r+=rr==x[r+1]){\r\n            int d = min(x[r+1]-rr, x[l+1]-ll); DB a = slope[r]-slope[l], b = (yy(r,rr)-yy(l,ll))*2; if (sgn(a)){\r\n                DB dd = -b\/(2*a); if (sgn(.0, dd) < 0 && sgn(dd, DB(d)) < 0){\r\n                    checkMax(res, pre-(b*b\/a\/4));\r\n                }\r\n            }\r\n            checkMax(res, pre += s(r,rr,rr+d)-s(l,ll,ll+d));\r\n            ll+=d,rr+=d;\r\n        }\r\n...\r\n<\/pre>\n
\u3002\u3002\u5c31\u662f\u6bcf\u6b21\u6211\u4eec\u53d6\u79fb\u52a8\u7684\u6b65\u957f d<\/code>…\u3002\u3002
\n\u3002\u3002\u7136\u540e\u89e3\u8fd9\u4e2a\u7a97\u53e3\u5185\u4e8c\u6b21\u65b9\u7a0b\u3002\u3002\u770b\u6781\u503c\u70b9\u662f\u5426\u843d\u5728\u6b65\u957f\u8303\u56f4\u4e4b\u5185\u3002\u3002
\n\u3002\u3002\u66f4\u65b0\u5b8c\u4e4b\u540e\u3002\u3002\u518d\u79fb\u52a8\u4e24\u4e2a\u7aef\u70b9\u3002\u3002\u3002<\/p>\n
\u6211\u4eec\u76f4\u63a5\u5728\u79fb\u52a8\u7aef\u70b9\u7684\u540c\u65f6\u518d\u5c1d\u8bd5\u66f4\u65b0\u4e00\u6b21\u7b54\u6848\u3002\u3002\uff08\u56e0\u4e3a\u6709\u53ef\u80fd\u51fa\u73b0\u65b9\u7a0b\u9000\u5316\u60c5\u51b5\u3002\u3002<\/p>\n
\r\nconst int N = int(2e5) + 9;\r\nint x[N], y[N], n; DB slope[N];\r\nint D;\r\n\r\ninline DB yy(int i, DB xx){\r\n    return y[i] + (xx-x[i])*slope[i];\r\n}\r\n\r\ninline DB s(int i, DB st, DB ed){\r\n    return (ed-st)*(yy(i,st)+yy(i,ed));\r\n}\r\n\r\nint main(){\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    Rush{\r\n        RD(n); RD(); REP(i, n) RD(x[i], y[i]); RD(D)*=2;\r\n        REP(i, n-1) slope[i] = (DB)(y[i+1]-y[i])\/(x[i+1]-x[i]);\r\n\r\n        DB res = 0, pre = 0; int r; REP_N(r, n-1){\r\n            if (x[r+1] >= D) break;\r\n            pre += s(r,x[r],x[r+1]);\r\n        }\r\n\r\n        checkMax(res, pre += s(r, x[r], D));\r\n        int l=0,ll=0,rr=D;r+=rr==x[r+1];\r\n\r\n        for (;r<n-1;l+=ll==x[l+1],r+=rr==x[r+1]){\r\n            int d = min(x[r+1]-rr, x[l+1]-ll); DB a = slope[r]-slope[l], b = (yy(r,rr)-yy(l,ll))*2; if (sgn(a)){\r\n                DB dd = -b\/(2*a); if (sgn(.0, dd) < 0 && sgn(dd, DB(d)) < 0){\r\n                    checkMax(res, pre-(b*b\/a\/4));\r\n                }\r\n            }\r\n            checkMax(res, pre += s(r,rr,rr+d)-s(l,ll,ll+d));\r\n            ll+=d,rr+=d;\r\n        }\r\n\r\n        OT(res\/D\/2);\r\n    }\r\n}\r\n<\/pre>\n
Problem J. Tri-war<\/h2>\n
Brief description:<\/h3>\n
\u3002\u3002\u7ed9\u5b9a $$n$$ \u4e2a\u7ed3\u70b9\u7684\u4e00\u68f5\u6811\u3002\u3002\u6bcf\u6b21\u8be2\u95ee\u4e09\u4e2a\u70b9 $$u_0, u_1, u_2$$\u3002\u3002\u3002
\n\u3002\u3002\u3002\u70b9 $$v$$ \u88ab $$u_x$$ \u652f\u914d \u3002\u3002\u5982\u679c $$\\forall y \\not = x, d(u_x, v) < d(u_y, v) $$\u3002\u3002\n\u3002\u3002\u3002\u95ee\u8fd9\u4e09\u4e2a\u70b9\u6240\u5728\u7684\u652f\u914d\u96c6\u7684\u5927\u5c0f\u3002\u3002\u3002\n\n\n\n
Analysis:<\/h3>\n
\u500d\u589e\u7956\u5148<\/code> LCA<\/code> \u5206\u7c7b\u8ba8\u8bba<\/code><\/p>\n
\u4e24\u4e2a\u70b9\u7684\u60c5\u51b5\uff1a<\/h4>\n
\u3002\u5148\u94fa\u597d\u6a21\u677f\u3002\u3002\u663e\u7136\u5c31\u662f\u3002\u3002\u3002\u3002\u3002\uff08\u3002Codeforces Round #140<\/a> \u548c SPOJ 1486. The Ants in a Tree<\/a> <\/p>\n
\u3002\u3002\u8003\u8651 2 \u4e2a\u70b9\u7684\u3002\u3002\u8bbe\u51fd\u6570 up(u, k)<\/code> \u8868\u793a $$u$$ \u7ed3\u70b9\u5411\u4e0a $$k$$ \u4e2a\u4f4d\u7f6e\u7684\u7ed3\u70b9\u3002\u3002\u3002
\n\u3002\u3002\u90a3\u4e48\u901a\u8fc7 \u500d\u589e\u7956\u5148<\/code> \u6211\u4eec\u5c31\u53ef\u4ee5\u5c06\u4e2d\u70b9\u627e\u5230\u3002\u3002\u3002\u4e4b\u540e\u6839\u636e\u8def\u5f84\u7684\u5947\u5076\u6027\u8ba8\u8bba\u4e00\u4e0b\u5373\u53ef\u3002\u3002\u3002<\/p>\n
\u6700\u540e\u8981\u4e48\u662f\u3002\u3002\u3002<\/p>\n
u0  --- m --- u1 <\/pre>\n
 \uff08\u8fd9\u79cd\u60c5\u51b5\u5b58\u5728\u7740\u4e00\u4e9b \u7070\u8272\u7ed3\u70b9<\/code>\u3002\u3002\uff08\u65e2\u4e0d\u5c5e\u4e8e $$u_0$$ \u4e5f\u4e0d\u5c5e\u4e8e $$u_1$$\u3002\u3002
\n\u8981\u4e48\u662f\u3002\u3002\u3002<\/p>\n
u0 --- m0 --- m1 --- u1<\/pre>\n
\u3002\u3002\u3002\u590d\u6742\u5ea6 $$O(log(n))$$\u3002\u3002\u3002\uff08\u5bf9\u4e8e\u6709\u8fb9\u6743\u7684\u60c5\u51b5\u3002\u3002\u590d\u6742\u5ea6\u597d\u50cf\u4ecd\u7136\u662f $$O(log(n))$$ \uff1f\u3002\u3002\u53ef\u4ee5\u4e00\u8fb9\u4e8c\u5206\u4e00\u8fb9\u5411\u4e0a\u8df3\uff1f\uff09<\/p>\n
\u3002\u3002\u3002\u5408\u7406\u7684\u4f7f\u7528 swap<\/code> \u4ee5\u63d0\u9ad8\u5bf9\u8ba8\u8bba\u7684\u6297\u6027\u3002\u3002\u3001\u3001\u3002\u3002
\n\uff08\u672c\u9898\u4e2d swap<\/code> \u7684\u60c5\u51b5\u76ee\u6d4b\u4f1a\u832b\u832b\u591a\u3002\u3002\u6211\u4eec\u76f4\u63a5\u4f7f\u7528 ans[]<\/code> \u6765\u8bb0\u5f55\u7b54\u6848\u3002\u3002\uff09<\/p>\n
\r\nvoid gao(int x, int y){\r\n    int z = lca(x,y), dx = dep[x]-dep[z], dy = dep[y]-dep[z], dd = dx+dy;\r\n    int d = dd\/2; if (d>=dx) swap(x, y), swap(dx, dy); int m = up(x,d);\r\n    if (dd&1) ans[x] = sz[m], ans[y] = n-ans[x];\r\n    else ans[x] = sz[up(x,d-1)], ans[y] = d==dx?sz[up(y,d-1)]:n-sz[m];\r\n}\r\n<\/pre>\n
\u4e09\u4e2a\u70b9\u7684\u60c5\u51b5\uff1a<\/h4>\n
\u3002\u3002\u3002\u3002\u73b0\u5728\u8ba8\u8bba\u4e09\u4e2a\u70b9\u7684\u60c5\u51b5\u3002\u3002\u3002
\n\u3002\u3002\u5148\u6309\u7167 dep<\/code> \u5bf9\u8be2\u95ee\u70b9\u6392\u5e8f\u3002\u3002<\/p>\n
Case 1\uff1a\u94fe\u72b6<\/h5>\n
\u8fd9\u79cd\u60c5\u51b5\uff0c$$u_0$$ \u548c $$u_2$$ \u90fd\u662f\u5b83\u4eec\u5404\u81ea\u5bf9 $$u_1$$ \u4e24\u4e2a\u70b9\u65f6\u7684\u7b54\u6848\u3002\u3002\u3002
\n\u3002\u3002\u3002\u518d\u628a $$u_1$$ \u5bb9\u65a5\u51fa\u6765\u3002\u3002\u3002<\/p>\n
\r\nvoid gao(int u0, int u1, int u2){\r\n    gao(u1, u2); int g = n-ans[u1]-ans[u2]; gao(u0, u1);\r\n    ans[u1] -= ans[u2]+g;\r\n}\r\n<\/pre>\n
Case 2\uff1a\u53c9\u72b6<\/h5>\n
\u6211\u4eec\u6c42\u51fa\u4e09\u8005\u7684\u6c47\u70b9 $$m$$\u3002\u3002\u5e76\u91cd\u65b0\u5c06\u8be2\u95ee\u7684\u7ed3\u70b9\u6309\u7167\u5230 $$m$$ \u7684\u8ddd\u79bb\u6392\u5e8f\u3002\u3002<\/p>\n
\r\n                m = entry(u0, u1, u2); SRT(I, cmp);\r\n<\/pre>\n
Case 2-1\uff1a$$m$$ \u88ab\u5176\u4e2d\u4e00\u4e2a\u7ed3\u70b9\u652f\u914d<\/h6>\n
\u8fd9\u79cd\u60c5\u51b5\uff0c$$u_1$$ \u548c $$u_2$$ \u90fd\u662f\u5b83\u4eec\u5404\u81ea\u5bf9 $$u_0$$ \u4e24\u4e2a\u70b9\u65f6\u7684\u7b54\u6848\u3002\u3002\u3002
\n\u3002\u3002\u3002\u7c7b\u4f3c\u7684\u3002\u3002\u518d\u628a $$u_0$$ \u5bb9\u65a5\u51fa\u6765\u3002\u3002\u3002<\/p>\n
\r\n                    gao(u1, u0); int g1 = n-ans[u0]-ans[u1];\r\n                    gao(u0, u2); int g2 = n-ans[u0]-ans[u2];\r\n                    ans[u0] = n-ans[u1]-ans[u2]-g1-g2;\r\n<\/pre>\n
Case 2-2\uff1a$$m$$ \u662f\u7070\u8272\u7ed3\u70b9<\/h6>\n
\u8fd9\u79cd\u60c5\u51b5\u8fd8\u5f97\u5206\u4e24\u79cd\u60c5\u51b5\u8ba8\u8bba\u3002\uff08\u6070\u597d\u4e24\u4e2a\u7ed3\u70b9\u5230 $$m$$ \u8ddd\u79bb\u76f8\u7b49\uff0c\u548c\u4e09\u4e2a\u7ed3\u70b9\u5230 $$m$$ \u8ddd\u79bb\u90fd\u76f8\u7b49\u3002\u3002\uff09
\n\u3002\u3002\u4f46\u662f\u5904\u7406\u8d77\u6765\u6070\u597d\u53ef\u4ee5\u505a\u5230\u5b8c\u5168\u4e00\u6837\u3002\u3002\u3002\u3002<\/p>\n
\u6700\u540e\u6ce8\u610f HDU<\/code> \u76f4\u63a5\u4ea4\u4f1a dfs()<\/code> \u7206\u6808\u3002\u3002\u3002
\n\u8fd9\u91cc\u6211\u4f7f\u7528\u4e86\u6c47\u7f16\u8c03\u6808\u3002\u3002\u3002\u3002<\/p>\n
\r\nconst int N = int(1e5)+9, M = 2*N, LV = 18;\r\nint hd[N], suc[M], to[M];\r\nint ST[LV+1][M], sz[N], fa[N][LV], st[N], dep[N];\r\nint n, tt;\r\n\r\ninline bool elder(int a, int b){\r\n    return dep[a] < dep[b];\r\n}\r\n\r\ninline int lca(int a, int b){\r\n    int l = st[a], r = st[b]; if (l > r) swap(l, r); ++r; int lv = lg2(r-l);\r\n    return min(ST[lv][l], ST[lv][r-(1<<lv)], elder);\r\n}\r\n\r\nbool isa(int u1, int u2){\r\n    return lca(u1, u2) == u1;\r\n}\r\n\r\nint entry(int x, int y, int w){\r\n    int xy = lca(x, y); if (!isa(xy, w)) return xy; int xw = lca(x, w);\r\n    return xw != xy ? xw : lca(y, w);\r\n}\r\n\r\ninline int d(int x, int y){\r\n    return dep[x]+dep[y]-2*dep[lca(x,y)];\r\n}\r\n\r\ninline int up(int x, int t){\r\n    for (int i=0;i<LV&&t;++i,t>>=1)\r\n        if (t&1) x = fa[x][i];\r\n    return x;\r\n}\r\n\r\n#define aa to[i^1]\r\n#define bb to[i]\r\n#define v bb\r\n\r\nvoid dfs(int u = 1){\r\n    ST[0][st[u] = ++tt] = u, sz[u] = 1;\r\n    REP_G(i, u) if (!st[v]){\r\n        dep[v] = dep[u] + 1, fa[v][0] = u; FOR(lv, 1, LV) fa[v][lv] = fa[fa[v][lv-1]][lv-1];\r\n        dfs(v), ST[0][++tt] = u, sz[u] += sz[v];\r\n    }\r\n}\r\n\r\n#undef v\r\n\r\nint ans[N], m;\r\n\r\nbool cmp(int a, int b){\r\n    return d(a, m) < d(b, m);\r\n}\r\n\r\nvoid gao(int x, int y){\r\n    int z = lca(x,y), dx = dep[x]-dep[z], dy = dep[y]-dep[z], dd = dx+dy;\r\n    int d = dd\/2; if (d>=dx) swap(x, y), swap(dx, dy); int m = up(x,d);\r\n    if (dd&1) ans[x] = sz[m], ans[y] = n-ans[x];\r\n    else ans[x] = sz[up(x,d-1)], ans[y] = d==dx?sz[up(y,d-1)]:n-sz[m];\r\n}\r\n\r\nvoid gao(int u0, int u1, int u2){\r\n    gao(u1, u2); int g = n-ans[u1]-ans[u2]; gao(u0, u1);\r\n    ans[u1] -= ans[u2]+g;\r\n}\r\n\r\nint main(){\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\nint __size__ = 256 << 20; \/\/ 256MB\r\nchar *__p__ = (char*)malloc(__size__) + __size__;\r\n__asm__("movl %0, %%esp\\n" :: "r"(__p__));\r\n\r\n\r\n    Rush{\r\n\r\n        FOR_C(i, 2, RD(n)<<1){\r\n            RD(aa, bb);\r\n            suc[i] = hd[aa], hd[aa] = i, ++i;\r\n            suc[i] = hd[aa], hd[aa] = i;\r\n        }\r\n\r\n        dfs();\r\n\r\n        for ( int lv = 1 ; (1 << lv) <= tt ; lv ++ ){\r\n            for ( int i = 1 ; i + (1 << lv)  <= tt + 1 ; i ++ )\r\n                ST[lv][i] = min(ST[lv-1][i], ST[lv-1][i + (1<<(lv-1))], elder);\r\n        }\r\n\r\n\r\n        Rush{\r\n\r\n            int u0, u1, u2; RD(u0, u1, u2);\r\n            VI I; I.PB(u0), I.PB(u1), I.PB(u2); SRT(I, elder);\r\n\r\n#define u0 I[0]\r\n#define u1 I[1]\r\n#define u2 I[2]\r\n\r\n            if (isa(u0, u1) && isa(u1, u2)){\r\n                gao(u0, u1, u2); \/\/ Case 1\r\n            }\r\n            else{\r\n                m = entry(u0, u1, u2); SRT(I, cmp);\r\n\r\n                if (d(u0,m) < d(u1,m)){ \/\/ Case 2.1\r\n                    gao(u1, u0); int g1 = n-ans[u0]-ans[u1];\r\n                    gao(u0, u2); int g2 = n-ans[u0]-ans[u2];\r\n                    ans[u0] = n-ans[u1]-ans[u2]-g1-g2;\r\n                }\r\n                else{ \/\/ Case 2.2\r\n                    gao(u0, u2), gao(u0, u1);\r\n                }\r\n            }\r\n#undef u0\r\n#undef u1\r\n#undef u2\r\n\r\n            printf("%d %d %d\\n", ans[u0], ans[u1], ans[u2]);\r\n        }\r\n\r\n        fill(hd+1, hd+n+1, 0);\r\n        fill(st+1, st+n+1, 0);\r\n        tt = 0;\r\n    }\r\n}\r\n\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
http:\/\/acmicpc.info\/archives\/1710 http:\/\/blog.renren.com\/blog\/271960376\/918770698?bfrom=01020110200 https:\/\/gist.github.com\/lychees\/803f6e6a61c0f393660a Problem D. Bathysphere Brief description: \u3002\u3002\u3002x \u8f74\u4e0a\u65b9\u7ed9\u5b9a\u4e00\u6bb5\u6298\u7ebf\u3002\uff08\u4e00\u4e2a\u5206\u6bb5\u7ebf\u6027\u53ef\u79ef\u51fd\u6570\uff09\u3002 \u3002\u3002\u6c42 d \u5bbd\u5ea6\u7684\u7a97\u53e3\u5185\u7684\u6700\u5927\u9762\u79ef\u3002\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":[164],"tags":[],"class_list":["post-904","post","type-post","status-publish","format-standard","hentry","category-onsite"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-eA","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/904","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=904"}],"version-history":[{"count":1,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/904\/revisions"}],"predecessor-version":[{"id":911,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/904\/revisions\/911"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=904"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=904"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=904"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}