{"id":43,"date":"2022-06-04T10:52:00","date_gmt":"2022-06-04T02:52:00","guid":{"rendered":"http:\/\/ubuntu.tim-wcx.ltd\/wordpress\/index.php\/2022\/06\/04\/2020-08-03\/"},"modified":"2022-06-04T10:52:00","modified_gmt":"2022-06-04T02:52:00","slug":"2020-08-03","status":"publish","type":"post","link":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/2022\/06\/04\/2020-08-03\/","title":{"rendered":"2020-08-03"},"content":{"rendered":"

\n <\/path>\n <\/svg><\/p>\n

http:\/\/icpc.upc.edu.cn\/problem.php?cid=1461&pid=2<\/a><\/p>\n

<\/a>\u9898\u76ee\u63cf\u8ff0<\/h5>\n

\u6821\u95e8\u5916\u6709\u5f88\u591a\u6811\uff0c\u6709\u82f9\u679c\u6811\uff0c\u9999\u8549\u6811\uff0c\u6709\u4f1a\u6254\u77f3\u5934\u7684\uff0c\u6709\u53ef\u4ee5\u5403\u6389\u8865\u5145\u4f53\u529b\u7684\u2026\u2026
\u5982\u4eca\u5b66\u6821\u51b3\u5b9a\u5728\u67d0\u4e2a\u65f6\u523b\u5728\u67d0\u4e00\u6bb5\u79cd\u4e0a\u4e00\u79cd\u6811\uff0c\u4fdd\u8bc1\u4efb\u4e00\u65f6\u523b\u4e0d\u4f1a\u51fa\u73b0\u4e24\u6bb5\u76f8\u540c\u79cd\u7c7b\u7684\u6811\uff0c\u73b0\u6709\u4e24\u4e2a\u64cd\u4f5c\uff1a
K=1\uff0cK=1\uff0c\u8bfb\u5165l\u3001r\u8868\u793a\u5728\u533a\u95f4[l,r]\u4e2d\u79cd\u4e0a\u4e00\u79cd\u6811\uff0c\u6bcf\u6b21\u64cd\u4f5c\u79cd\u7684\u6811\u7684\u79cd\u7c7b\u90fd\u4e0d\u540c
K=2\uff0c\u8bfb\u5165l,r\u8868\u793a\u8be2\u95eel~r\u4e4b\u95f4\u80fd\u89c1\u5230\u591a\u5c11\u79cd\u6811
\uff08l,r>0\uff09<\/p>\n

<\/a>\u8f93\u5165<\/h5>\n

\u7b2c\u4e00\u884cn,m\u8868\u793a\u9053\u8def\u603b\u957f\u4e3an\uff0c\u5171\u6709m\u4e2a\u64cd\u4f5c
\u63a5\u4e0b\u6765m\u884c\u4e3am\u4e2a\u64cd\u4f5c<\/p>\n

<\/a>\u8f93\u51fa<\/h5>\n

\u5bf9\u4e8e\u6bcf\u4e2ak=2\u8f93\u51fa\u4e00\u4e2a\u7b54\u6848<\/p>\n

<\/a>\u6837\u4f8b\u8f93\u5165<\/h5>\n
5 4\n1 1 3\n2 2 5\n1 2 4\n2 3 5\n<\/code><\/pre>\n
<\/a>\u6837\u4f8b\u8f93\u51fa\u2019<\/h5>\n
1\n2\n<\/code><\/pre>\n
<\/a>\u63d0\u793a<\/h5>\n
20%\u7684\u6570\u636e\u4fdd\u8bc1\uff0cn,m<=100
 60%\u7684\u6570\u636e\u4fdd\u8bc1\uff0cn <=1000,m<=50000
 100%\u7684\u6570\u636e\u4fdd\u8bc1\uff0cn,m<=50000
 \u91c7\u7528\u62ec\u53f7\u5e8f\u5217+\u6811\u72b6\u6570\u7ec4\u6765\u89e3\u51b3\u8fd9\u9053\u9898\u76ee\uff0c\u79cd\u6811\u4e3a\u4e00\u4e2a\u533a\u95f4\uff0c\u6211\u4eec\u53ef\u4ee5\u5728\u79cd\u6811\u7684\u8d77\u70b9\u6807\u8bb0\u4e00\u4e2a\u5de6\u62ec\u53f7\uff0c\u79cd\u6811\u7684\u7ec8\u70b9\u6807\u8bb0\u4e00\u4e2a\u53f3\u62ec\u53f7\uff0c\u7edf\u8ba1\u7684\u65f6\u5019\u8ba1\u7b97\u7ec8\u70b9\u524d\u5de6\u62ec\u53f7\u7684\u6570\u76ee\u548c\u8d77\u70b9\u524d\u53f3\u62ec\u53f7\u7684\u6570\u76ee\uff0c\u4e24\u4e2a\u505a\u5dee\u5373\u4e3a\u7b54\u6848\u3002<\/p>\n
#include<\/span><\/span><\/span>\nusing<\/span> namespace<\/span> std;<\/span>\ntypedef<\/span> long<\/span> long<\/span> ll;<\/span>\nll c1[<\/span>500500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll c2[<\/span>500500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll n,<\/span>m;<\/span>\nll lowbit<\/span>(<\/span>ll x)<\/span>\n{<\/span>\n    return<\/span> x&<\/span>(<\/span>-<\/span>x)<\/span>;<\/span>\n}<\/span>\nll update1<\/span>(<\/span>ll k,<\/span>ll x)<\/span>\n{<\/span>\n    for<\/span>(<\/span>ll i=<\/span>k;<\/span>i<=<\/span>n;<\/span>i+<\/span>=<\/span>lowbit<\/span>(<\/span>i)<\/span>)<\/span>\n        c1[<\/span>i]<\/span>+<\/span>=<\/span>x;<\/span>\n}<\/span>\nll update2<\/span>(<\/span>ll k,<\/span>ll x)<\/span>\n{<\/span>\n    for<\/span>(<\/span>ll i=<\/span>k;<\/span>i<=<\/span>n;<\/span>i+<\/span>=<\/span>lowbit<\/span>(<\/span>i)<\/span>)<\/span>\n        c2[<\/span>i]<\/span>+<\/span>=<\/span>x;<\/span>\n}<\/span>\nll sum1<\/span>(<\/span>ll k)<\/span>\n{<\/span>\n    ll ans=<\/span>0<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>k;<\/span>i>=<\/span>1<\/span>;<\/span>i-<\/span>=<\/span>lowbit<\/span>(<\/span>i)<\/span>)<\/span>\n        ans+<\/span>=<\/span>c1[<\/span>i]<\/span>;<\/span>\n    return<\/span> ans;<\/span>\n}<\/span>\nll sum2<\/span>(<\/span>ll k)<\/span>\n{<\/span>\n    ll ans=<\/span>0<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>k;<\/span>i>=<\/span>1<\/span>;<\/span>i-<\/span>=<\/span>lowbit<\/span>(<\/span>i)<\/span>)<\/span>\n        ans+<\/span>=<\/span>c2[<\/span>i]<\/span>;<\/span>\n    return<\/span> ans;<\/span>\n}<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    ll a,<\/span>b,<\/span>c;<\/span>\n    scanf<\/span>(<\/span>\"%lld%lld\"<\/span>,<\/span>&<\/span>n,<\/span>&<\/span>m)<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>1<\/span>;<\/span>i<=<\/span>m;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n       scanf<\/span>(<\/span>\"%lld%lld%lld\"<\/span>,<\/span>&<\/span>a,<\/span>&<\/span>b,<\/span>&<\/span>c)<\/span>;<\/span>\n       if<\/span>(<\/span>a==<\/span>1<\/span>)<\/span>\n       {<\/span>\n           update1<\/span>(<\/span>b,<\/span>1<\/span>)<\/span>;<\/span>  \/\/\/ \u5de6\u62ec\u53f7<\/span>\n           update2<\/span>(<\/span>c,<\/span>1<\/span>)<\/span>;<\/span>  \/\/\/ \u53f3\u62ec\u53f7<\/span>\n       }<\/span>\n       else<\/span>\n       {<\/span>\n           printf<\/span>(<\/span>\"%lldn\"<\/span>,<\/span>sum1<\/span>(<\/span>c)<\/span>-<\/span>sum2<\/span>(<\/span>b-<\/span>1<\/span>)<\/span>)<\/span>;<\/span>\n       }<\/span>\n    }<\/span>\n}<\/span>\n\n<\/code><\/pre>\n
<\/a>\u9898\u76ee\u63cf\u8ff0<\/h5>\n
\u6709\u4e00\u4e2an\u4e2a\u5143\u7d20\u7684\u6570\u7ec4\uff0c\u6bcf\u4e2a\u5143\u7d20\u521d\u59cb\u5747\u4e3a0\u3002\u6709m\u6761\u6307\u4ee4\uff0c\u8981\u4e48\u8ba9\u5176\u4e2d\u4e00\u6bb5\u8fde\u7eed\u5e8f\u5217\u6570\u5b57\u53cd\u8f6c\u2014\u20140\u53d81\uff0c1\u53d80\uff08\u64cd\u4f5c1\uff09\uff0c\u8981\u4e48\u8be2\u95ee\u67d0\u4e2a\u5143\u7d20\u7684\u503c\uff08\u64cd\u4f5c2\uff09\u3002
 \u4f8b\u5982\u5f53n=20\u65f6\uff0c10\u6761\u6307\u4ee4\u5982\u4e0b\uff1a
 \"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"<\/p>\n
<\/a>\u8f93\u5165<\/h5>\n
\u7b2c\u4e00\u884c\u5305\u542b\u4e24\u4e2a\u6574\u6570n,m\uff0c\u8868\u793a\u6570\u7ec4\u7684\u957f\u5ea6\u548c\u6307\u4ee4\u7684\u6761\u6570\uff1b
 \u4ee5\u4e0bm\u884c\uff0c\u6bcf\u884c\u7684\u7b2c\u4e00\u4e2a\u6570t\u8868\u793a\u64cd\u4f5c\u7684\u79cd\u7c7b\uff1a
 \u82e5t=1\uff0c\u5219\u63a5\u4e0b\u6765\u6709\u4e24\u4e2a\u6570L,R\uff0c\u8868\u793a\u533a\u95f4[L,R]\u7684\u6bcf\u4e2a\u6570\u5747\u53cd\u8f6c\uff1b
 \u82e5t=2\uff0c\u5219\u63a5\u4e0b\u6765\u53ea\u6709\u4e00\u4e2a\u6570i\uff0c\u8868\u793a\u8be2\u95ee\u7684\u4e0b\u6807\u3002<\/p>\n
<\/a>\u8f93\u51fa<\/h5>\n
\u6bcf\u4e2a\u64cd\u4f5c2\u8f93\u51fa\u4e00\u884c\uff08\u975e0\u53731\uff09\uff0c\u8868\u793a\u6bcf\u6b21\u64cd\u4f5c2\u7684\u56de\u7b54\u3002<\/p>\n
<\/a>\u6837\u4f8b\u8f93\u5165<\/h5>\n
20 10\n1 1 10\n2 6\n2 12\n1 5 12\n2 6\n2 15\n1 6 16\n1 11 17\n2 12\n2 6\n<\/code><\/pre>\n
<\/a>\u6837\u4f8b\u8f93\u51fa<\/h5>\n
1\n0\n0\n0\n1\n1\n<\/code><\/pre>\n
<\/a>\u63d0\u793a<\/h5>\n
\u5bf9\u4e8e50%\u7684\u6570\u636e\uff0c1\u2264n\u2264103,1\u2264m\u2264104\uff1b
 \u5bf9\u4e8e100%\u7684\u6570\u636e\uff0c1\u2264n\u2264105,1\u2264m\u22645\u00d7105\uff0c\u4fdd\u8bc1L\u2264R\u3002
 \u4e0e\u4e0a\u4e00\u9053\u9898\u76ee\u540c\uff0c\u6811\u72b6\u6570\u7ec4\u7edf\u8ba1\u53cd\u8f6c\u6b21\u6570\u5373\u53ef\u3002<\/p>\n
#include<\/span><\/span><\/span>\nusing<\/span> namespace<\/span> std;<\/span>\ntypedef<\/span> long<\/span> long<\/span> ll;<\/span>\nll c1[<\/span>500500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll c2[<\/span>500500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll p[<\/span>500500<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nll n,<\/span>m;<\/span>\nll lowbit<\/span>(<\/span>ll x)<\/span>\n{<\/span>\n    return<\/span> x&<\/span>(<\/span>-<\/span>x)<\/span>;<\/span>\n}<\/span>\nll update1<\/span>(<\/span>ll k,<\/span>ll x)<\/span>\n{<\/span>\n    for<\/span>(<\/span>ll i=<\/span>k;<\/span>i<=<\/span>n;<\/span>i+<\/span>=<\/span>lowbit<\/span>(<\/span>i)<\/span>)<\/span>\n        c1[<\/span>i]<\/span>+<\/span>=<\/span>x;<\/span>\n}<\/span>\nll update2<\/span>(<\/span>ll k,<\/span>ll x)<\/span>\n{<\/span>\n    for<\/span>(<\/span>ll i=<\/span>k;<\/span>i<=<\/span>n;<\/span>i+<\/span>=<\/span>lowbit<\/span>(<\/span>i)<\/span>)<\/span>\n        c2[<\/span>i]<\/span>+<\/span>=<\/span>x;<\/span>\n}<\/span>\nll sum1<\/span>(<\/span>ll k)<\/span>\n{<\/span>\n    ll ans=<\/span>0<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>k;<\/span>i>=<\/span>1<\/span>;<\/span>i-<\/span>=<\/span>lowbit<\/span>(<\/span>i)<\/span>)<\/span>\n        ans+<\/span>=<\/span>c1[<\/span>i]<\/span>;<\/span>\n    return<\/span> ans;<\/span>\n}<\/span>\nll sum2<\/span>(<\/span>ll k)<\/span>\n{<\/span>\n    ll ans=<\/span>0<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>k;<\/span>i>=<\/span>1<\/span>;<\/span>i-<\/span>=<\/span>lowbit<\/span>(<\/span>i)<\/span>)<\/span>\n        ans+<\/span>=<\/span>c2[<\/span>i]<\/span>;<\/span>\n    return<\/span> ans;<\/span>\n}<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    ll a,<\/span>b,<\/span>c;<\/span>\n    scanf<\/span>(<\/span>\"%lld%lld\"<\/span>,<\/span>&<\/span>n,<\/span>&<\/span>m)<\/span>;<\/span>\n    for<\/span>(<\/span>ll i=<\/span>1<\/span>;<\/span>i<=<\/span>m;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n       scanf<\/span>(<\/span>\"%lld\"<\/span>,<\/span>&<\/span>a)<\/span>;<\/span>\n       if<\/span>(<\/span>a==<\/span>1<\/span>)<\/span>\n       {<\/span>\n           scanf<\/span>(<\/span>\"%lld%lld\"<\/span>,<\/span>&<\/span>b,<\/span>&<\/span>c)<\/span>;<\/span>\n           update1<\/span>(<\/span>b,<\/span>1<\/span>)<\/span>;<\/span>  \/\/\/ \u5de6\u62ec\u53f7<\/span>\n           update2<\/span>(<\/span>c,<\/span>1<\/span>)<\/span>;<\/span>  \/\/\/ \u53f3\u62ec\u53f7<\/span>\n       }<\/span>\n       else<\/span>\n       {<\/span>\n           scanf<\/span>(<\/span>\"%lld\"<\/span>,<\/span>&<\/span>b)<\/span>;<\/span>\n           printf<\/span>(<\/span>\"%lldn\"<\/span>,<\/span>(<\/span>sum1<\/span>(<\/span>b)<\/span>-<\/span>sum2<\/span>(<\/span>b-<\/span>1<\/span>)<\/span>)<\/span>%<\/span>2<\/span>)<\/span>;<\/span>\n       }<\/span>\n    }<\/span>\n}<\/span>\n\n\n<\/code><\/pre>\n
<\/a>\u9898\u76ee\u63cf\u8ff0<\/h5>\n
\u5728\u7ed9\u5b9a\u7684N\u4e2a\u6574\u6570A1\uff0cA2\u2026\u2026AN\u4e2d\u9009\u51fa\u4e24\u4e2a\u8fdb\u884cxor\u8fd0\u7b97\uff0c\u5f97\u5230\u7684\u7ed3\u679c\u6700\u5927\u662f\u591a\u5c11\uff1f<\/p>\n
<\/a>\u8f93\u5165<\/h5>\n
\u7b2c\u4e00\u884c\u4e00\u4e2a\u6574\u6570N\uff0c\u7b2c\u4e8c\u884cN\u4e2a\u6574\u6570A1\uff5eAN\u3002<\/p>\n
<\/a>\u8f93\u51fa<\/h5>\n
\u4e00\u4e2a\u6574\u6570\u8868\u793a\u7b54\u6848\u3002<\/p>\n
<\/a>\u6837\u4f8b\u8f93\u5165<\/h5>\n
3\n1 2 3\n<\/code><\/pre>\n
<\/a>\u6837\u4f8b\u8f93\u51fa<\/h5>\n
3\n<\/code><\/pre>\n
<\/a>\u63d0\u793a<\/h5>\n
\u5bf9\u4e8e100%\u7684\u6570\u636e: N<=10^5, 0<=Ai<2^31\u3002
 \u7528\u5b57\u5178\u6811\u5b58\u4e8c\u8fdb\u5236\uff0c\u627e\u6700\u5927\u7684\u5f02\u6216\u503c\u3002<\/p>\n
#include<\/span> <\/span><\/span>\n#include<\/span> <\/span><\/span>\nusing<\/span> namespace<\/span> std;<\/span>\ntypedef<\/span> long<\/span> long<\/span> ll;<\/span>\nint<\/span> a[<\/span>1005000<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nint<\/span> tree[<\/span>5000500<\/span>]<\/span>[<\/span>3<\/span>]<\/span>=<\/span>{<\/span>0<\/span>}<\/span>;<\/span>\nint<\/span> tot=<\/span>1<\/span>;<\/span>\/\/\/\u5fc5\u987b\u4ece1\u5f00\u59cb<\/span>\nint<\/span> in<\/span>(<\/span>int<\/span> x)<\/span>\n{<\/span>\n    int<\/span> p=<\/span>1<\/span>;<\/span>\n    for<\/span>(<\/span>int<\/span> i=<\/span>30<\/span>;<\/span>i>=<\/span>0<\/span>;<\/span>i--<\/span>)<\/span>\n    {<\/span>\n        int<\/span> k=<\/span>x>><\/span>i&<\/span>1<\/span>;<\/span>\n        if<\/span>(<\/span>tree[<\/span>p]<\/span>[<\/span>k]<\/span>==<\/span>0<\/span>)<\/span>\n            tree[<\/span>p]<\/span>[<\/span>k]<\/span>=<\/span>++<\/span>tot;<\/span>\n        p=<\/span>tree[<\/span>p]<\/span>[<\/span>k]<\/span>;<\/span>\n    }<\/span>\n}<\/span>\nint<\/span> out<\/span>(<\/span>int<\/span> x)<\/span>\n{<\/span>\n    int<\/span> p=<\/span>1<\/span>,<\/span>ans=<\/span>0<\/span>;<\/span>\n    for<\/span>(<\/span>int<\/span> i=<\/span>30<\/span>;<\/span>i>=<\/span>0<\/span>;<\/span>i--<\/span>)<\/span>\n    {<\/span>\n        int<\/span> k=<\/span>x>><\/span>i&<\/span>1<\/span>;<\/span>\n        if<\/span>(<\/span>tree[<\/span>p]<\/span>[<\/span>!<\/span>k]<\/span>)<\/span>\n        {<\/span>\n            ans=<\/span>ans*<\/span>2<\/span>+<\/span>!<\/span>k;<\/span>\n            p=<\/span>tree[<\/span>p]<\/span>[<\/span>!<\/span>k]<\/span>;<\/span>\n        }<\/span>\n        else<\/span>\n        {<\/span>\n            ans=<\/span>ans*<\/span>2<\/span>+<\/span>k;<\/span>\n            p=<\/span>tree[<\/span>p]<\/span>[<\/span>k]<\/span>;<\/span>\n        }<\/span>\n    }<\/span>\n    return<\/span> ans;<\/span>\n}<\/span>\nint<\/span> main<\/span>(<\/span>)<\/span>\n{<\/span>\n    int<\/span> n;<\/span>\n    scanf<\/span>(<\/span>\"%d\"<\/span>,<\/span>&<\/span>n)<\/span>;<\/span>\n    for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>\n        scanf<\/span>(<\/span>\"%d\"<\/span>,<\/span>&<\/span>a[<\/span>i]<\/span>)<\/span>;<\/span>\n    int<\/span> max1=<\/span>0<\/span>;<\/span>\n    for<\/span>(<\/span>int<\/span> i=<\/span>1<\/span>;<\/span>i<=<\/span>n;<\/span>i++<\/span>)<\/span>\n    {<\/span>\n       in<\/span>(<\/span>a[<\/span>i]<\/span>)<\/span>;<\/span>\n       int<\/span> num=<\/span>out<\/span>(<\/span>a[<\/span>i]<\/span>)<\/span>;<\/span>\n       max1=<\/span>max<\/span>(<\/span>max1,<\/span>num^<\/span>a[<\/span>i]<\/span>)<\/span>;<\/span>\n    }<\/span>\n    cout<<<\/span>max1<<<\/span>endl;<\/span>\n    return<\/span> 0<\/span>;<\/span>\n}<\/span>\n\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
http:\/\/icpc.upc.edu.cn\/pr…<\/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":[],"class_list":["post-43","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts\/43","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/comments?post=43"}],"version-history":[{"count":0,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/posts\/43\/revisions"}],"wp:attachment":[{"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/media?parent=43"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/categories?post=43"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wordpress.tim-wcx.ltd\/index.php\/wp-json\/wp\/v2\/tags?post=43"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
http:\/\/icpc.upc.edu.cn\/problem.php?cid=1431&pid=12<\/a><\/p>\n
http:\/\/icpc.upc.edu.cn\/problem.php?cid=1461&pid=4<\/a><\/p>\n