{"id":2300,"date":"2023-02-07T17:22:41","date_gmt":"2023-02-07T09:22:41","guid":{"rendered":"https:\/\/www.shuizilong.com\/house\/?p=2300"},"modified":"2023-02-10T20:22:53","modified_gmt":"2023-02-10T12:22:53","slug":"the-1st-universal-cup-stage-2-hongkong","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/house\/archives\/the-1st-universal-cup-stage-2-hongkong\/","title":{"rendered":"The 1st Universal Cup, Stage 2, Hongkong"},"content":{"rendered":"

Problem A. TreeScript<\/h2>\n

\u7b80\u5355\u6811 dp\u3002<\/p>\n

\r\nconst int N = int(1e6) + 9;\r\nVI adj[N]; int dp[N];\r\nint n, z;\r\n\r\nvoid dfs(int u) {\r\n    dp[u] = 0;\r\n    for (auto v: adj[u]) {\r\n        dfs(v);\r\n        checkMax(dp[u], dp[v] + 1);\r\n    }\r\n\r\n    int c = 0;\r\n    for (auto v: adj[u]) {\r\n        if (dp[u] == dp[v] + 1) ++c;\r\n    }\r\n    if (c == 1) dp[u] -= 1;\r\n\r\n}\r\n\r\nint main(){\r\n\r\n#ifndef ONLINE_JUDGE\r\n    \/\/freopen("in.txt", "r", stdin);\r\n#endif\r\n\r\n    Rush {\r\n        RD(n);\r\n        REP_1(i, n) adj[i].clear();\r\n        REP_1(i, n)  adj[RD()].PB(i);\r\n        dfs(1); cout << dp[1] + 1 << endl;\r\n    }\r\n}\r\n<\/pre>\n
Problem B. Big Picture<\/h2>\n
\u7b2c\u4e00\u53cd\u5e94\u662f\u6bcf\u4e2a\u683c\u70b9\u72ec\u7acb\u67d3\u8272\u3002\u3002\u3002\u3002\u5367\u69fd\u8fd9\u80fd\u505a\uff1f
\n\u7136\u540e\u53d1\u73b0\u662f\u6bcf\u4e00\u884c\u548c\u6bcf\u4e00\u5217\u90fd\u72ec\u7acb\u67d3\u8272\u3002\u3002\u3002\u54e6\u3002\u3002\u3002\u90a3\u6837\u9ed1\u8272\u4e00\u5b9a\u53ea\u6709\u4e00\u4e2a\u8fde\u901a\u5757\uff0c\u4e14\u6bcf\u4e2a\u767d\u8272\u5757\u90fd\u662f\u77e9\u5f62\u3002\u3002\u6709\u4e14\u4ec5\u6709\u4e00\u4e2a\u53f3\u4e0b\u89d2\u3002\u3002
\n\u90a3\u4e48\u8fd8\u662f\u53ef\u4ee5\u5229\u7528\u671f\u671b\u7684\u7ebf\u6027\u6027\u3002\u3002\u8003\u5bdf\u6bcf\u4e2a\u70b9\u6210\u4e3a\u767d\u8272\u533a\u57df\u7684\u53f3\u4e0b\u89d2\u7684\u6982\u7387\u5373\u53ef\u3002\u3002\u3002<\/p>\n
Problem E. Goose, goose, DUCK?<\/h2>\n
\u4e0d\u77e5\u4e3a\u4f55\uff0c\u8ba9\u6211\u60f3\u5230\u4e86 dQuery\u3002\u5148\u8003\u8651\u5bf9\u7b54\u6848\u53d6\u53cd\uff0c\u90a3\u4e48\u663e\u7136\u5c31\u662f\u7ef4\u62a4\u533a\u95f4\u5e76\u7684\u6d4b\u5ea6\uff0c\u7ebf\u6bb5\u6811\u5373\u53ef\u3002<\/p>\n
\u505a\u6cd5\u4e5f\u7c7b\u4f3c\uff0c\u5bf9\u6bcf\u79cd\u6570\u5b57\uff0c\u5f00\u4e2a queue \u8bb0\u5f55\u524d\u9762\u51fa\u73b0\u7684\u4f4d\u7f6e\u3002
\n\u7136\u540e\u627e\u5230\u63d2\u5165\u65b0\u6570\u5b57\u524d\u540e\u53d8\u5316\u7684\u533a\u95f4\uff0c\u64cd\u4f5c\u7ebf\u6bb5\u6811\u5373\u53ef\u3002<\/p>\n
\r\nconst int N = int(1e6) + 9;\r\nint n;\r\n\r\nstruct rec{\r\n    int cov, cnt;\r\n} T[8*N];\r\n\r\n\r\n#define lx (x<<1)\r\n#define rx (lx|1)\r\n#define ml ((l+r)>>1)\r\n#define mr (ml+1)\r\n#define lc lx,l,ml\r\n#define rc rx,mr,r\r\n\r\n\r\nvoid upd(int x, int l, int r) {\r\n    if (T[x].cnt > 0) T[x].cov = r - l + 1;\r\n    else T[x].cov = T[lx].cov + T[rx].cov;\r\n}\r\n\r\nvoid inc(int x, int d) {\r\n    T[x].cnt += d;\r\n}\r\n\r\n\r\n\/*int Query(int x, int l, int r, const int a, const int b) {\r\n    if (b < l || r < a) return 0;\r\n    if (a <= l && r <= b) {\r\n        return T[x];\r\n    } else {\r\n        return min(Query(lc, a, b), Query(rc, a, b), cmp);\r\n    }\r\n}*\/\r\n\r\nvoid Add(int x, int l, int r, int a, int b, int d) {\r\n    if (b < l || r < a) return;\r\n    if (a <= l && r <= b) {\r\n        inc(x, d);\r\n    } else {\r\n        Add(lc, a, b, d);\r\n        Add(rc, a, b, d);\r\n    }\r\n    upd(x,l,r);\r\n}\r\n\r\nmap<int, VI> H;\r\nint m;\r\n\r\nvoid gao(int x, int d) {\r\n\r\n#define t H[x]\r\n\r\n    if (SZ(t) < m) return;\r\n    if (SZ(t) == m) {\r\n        int l = 1, r = t[0];\r\n        Add(1, 1, n, l ,r ,d);  \/\/ m-1\r\n    } else { \/\/ 0..m ,\r\n        int l = t[SZ(t)-(m+1)]+1, r = t[SZ(t)-m];\r\n        Add(1, 1, n, l ,r ,d);\r\n    }\r\n}\r\n\r\n\r\nint main(){\r\n\r\n#ifndef ONLINE_JUDGE\r\n    \/\/freopen("in.txt", "r", stdin);\r\n#endif\r\n\r\n    RD(n, m);\r\n    LL z = 0;\r\n    REP_1(i, n) {\r\n        int x; RD(x);\r\n\r\n        gao(x, -1);\r\n        H[x].PB(i);\r\n        gao(x, 1);\r\n\r\n        z += i - T[1].cov;\r\n    }\r\n    cout << z <<endl;\r\n}\r\n<\/pre>\n
Problem F. Sum of Numbers<\/h2>\n
\u770b\u8d77\u6765\u4eba\u755c\u65e0\u5bb3\u7684\u7b7e\u5230\u9898\u3002\u3002\u3002\u4f46\u662f\u4e0d\u77e5\u4e3a\u4f55\u975e\u5e38\u5361\u65f6\u3002\u3002\u3002\u96be\u9053\u662f\u56e0\u4e3a\u9ad8\u7cbe\u5ea6\u592a\u6162\uff1f
\n\u770b\u4e86\u4e00\u4e0b\u5176\u5b83\u4eba\u7684\u4ee3\u7801\u3002\u3002\u3002\u8c8c\u4f3c dp \u548c \u641c\u7d22\u90fd\u53ef\u4ee5\u8fc7\uff1f
\n– dp<\/a>
\n– \u641c\u7d22<\/a><\/p>\n
Problem H.<\/h2>\n
\u7b7e\u5230\u9898\u3002<\/p>\n
\r\nint main()\r\n{\r\n\/\/\tfreopen("A.in","r",stdin);\r\n\/\/\tfreopen(".out","w",stdout);\r\n\/\/\tint p=read();\r\n\/\/\tFor(i,p)if(p%i!=0) cout<<p%i<<endl;\r\n\tll l,r,b,k;\r\n\tcin>>l>>r>>b>>k;\r\n\tcout<<((l+b-1)\/b)*b*k;\r\n\treturn 0;\r\n}\r\n<\/pre>\n
Problem K.<\/h2>\n
\u7b7e\u5230\u9898\u3002<\/p>\n
\r\nint main() {\r\n\t\r\n\tint n=read();\r\n\tFor(i,n) a[i]=read();\r\n\t\r\n\tsort(a+1,a+1+n);\r\n\tn=unique(a+1,a+1+n)-a-1;\r\n\tif(n==1) cout<<a[1]<<endl;\t\r\n\telse if(a[1]*2<=a[2]) cout<<a[1]<<endl;\r\n\telse cout<<min(a[1]\/2,a[2]\/2)<<endl;\r\n\treturn 0;\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
Problem A. TreeScript \u7b80\u5355\u6811 dp\u3002 const int N = int(1e6) + 9; VI adj[N]; int dp[N]; int n, z; void dfs(int u) { dp[u] = 0; for (auto v: adj[u]) { dfs(v); checkMax(dp[u], dp[v] + 1); } int c = 0; for (auto v: adj[u]) { if (dp[u] == dp[v] + 1) ++c; } if […]<\/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":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[1],"tags":[],"class_list":["post-2300","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-B6","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2300","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=2300"}],"version-history":[{"count":7,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2300\/revisions"}],"predecessor-version":[{"id":2321,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2300\/revisions\/2321"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=2300"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=2300"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=2300"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}