[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fEdMv2K2WgniZK8GfNghojeGAPKBVh52iA7wxCl0RoOE":3},{"code":4,"msg":5,"data":6},0,"success",{"id":7,"title":8,"description":9,"coverPicUrl":10,"keywords":11,"commentId":12,"isOriginal":13,"isCopyable":13,"view":14,"publish_time":15,"update_time":15,"content":16},51,"2025年ICPC河南省赛部分题解（B、I、J、K、L、M）","补题链接：https:\u002F\u002Fac.nowcoder.com\u002Facm\u002Fcontest\u002F110308\r\rB 最大popcount\r签到题，注意long long，以及不要直接用cout（大数会以科学计数法输出，痛吃一发WA）。\r#include \u003Cbits\u002Fstdc++.h>\rusing namespace std;\r#define endl \"\n\"\r#define ll long long\r\rint …","https:\u002F\u002Fi0.bilitools.top\u002Fimages\u002Fartical\u002Fcover\u002Fba554c464c9a1eac7c856d67f7e213002.jpg","C++,ICPC,ACM,算法,题解",52,true,734,1747714370,{"frontmatter":17,"meta":18,"nodes":19},{},{},[20,33,37,42,46,52,56,60,64,68,72,76,80,84,88,92,96,100,104,108,112,116,119],[21,22,25,26],"p",{"$":23},{"html":24,"block":4},1,"补题链接：",[27,28,30],"a",{"$":29,"href":30,"target":31,"rel":32},{"html":24,"block":4},"https:\u002F\u002Fac.nowcoder.com\u002Facm\u002Fcontest\u002F110308","_blank","noopener",[34,35],"hr",{"$":36},{"html":24,"block":4},[38,39,41],"h2",{"$":40},{"html":24,"block":4},"B 最大popcount",[21,43,45],{"$":44},{"html":24,"block":4},"签到题，注意long long，以及不要直接用cout（大数会以科学计数法输出，痛吃一发WA）。",[47,48,51],"pre",{"$":49,"class":50},{"html":24,"block":24},"language-cpp","\u003Ccode>#include &lt;bits\u002Fstdc++.h&gt;\nusing namespace std;\n#define endl \"\\n\"\n#define ll long long\n\nint main()\n{\n    int t;\n    cin &gt;&gt; t;\n    while (t--) {\n        ll x;\n        cin &gt;&gt; x;\n        printf(\"%lld\\n\", (ll)pow(2, (ll)log2(x + 1)) - 1);\n    }\n\n    return 0;\n}\u003C\u002Fcode>",[38,53,55],{"$":54},{"html":24,"block":4},"I 挡雨布",[21,57,59],{"$":58},{"html":24,"block":4},"凸包板子题，不过我是自己用栈实现的。",[47,61,63],{"$":62,"class":50},{"html":24,"block":24},"\u003Ccode>#include &lt;bits\u002Fstdc++.h&gt;\nusing namespace std;\n#define endl \"\\n\"\n#define ll long long\n\nset&lt;double&gt; xs;\nmap&lt;double, double&gt; a;\n\nint main()\n{\n    int n;\n    cin &gt;&gt; n;\n    for (int i = 0; i &lt; n; i++) {\n        double x, y;\n        scanf(\"%lf %lf\", &amp;x, &amp;y);\n        if (y == 0.0) {\n            continue;\n        }\n        xs.insert(x);\n        a[x] = max(y, a[x]);\n    }\n\n    vector&lt;double&gt; xv(xs.begin(), xs.end());\n\n    stack&lt;pair&lt;double, double&gt;&gt; p;\n    stack&lt;double&gt; r;\n    p.push(make_pair(xv[0], a[xv[0]]));\n    for (int i = 1; i &lt; a.size(); i++) {\n        pair&lt;double, double&gt; now = make_pair(xv[i], a[xv[i]]);\n        double rate = (now.second - p.top().second) \u002F (now.first - p.top().first);\n        if (r.empty()) {\n            r.push(rate);\n            p.push(now);\n        } else {\n            while (!r.empty() &amp;&amp; r.top() &lt; rate) {\n                r.pop();\n                p.pop();\n                rate = (now.first - p.top().first) \u002F (now.second - p.top().second);\n            }\n            r.push(rate);\n            p.push(now);\n        }\n    }\n\n    pair&lt;double, double&gt; last = p.top();\n    p.pop();\n    if (p.empty()) {\n        cout &lt;&lt; 0;\n    } else {\n        double s = 0;\n        do {\n            s += (last.first - p.top().first) * (last.second + p.top().second) \u002F 2.0;\n            last = p.top();\n            p.pop();\n        } while (!p.empty());\n        cout &lt;&lt; s;\n    }\n\n    return 0;\n}\u003C\u002Fcode>",[38,65,67],{"$":66},{"html":24,"block":4},"J 输入距离",[21,69,71],{"$":70},{"html":24,"block":4},"也是签到，先排序，把相同的字母放在一起以尽量减少移动次数。",[47,73,75],{"$":74,"class":50},{"html":24,"block":24},"\u003Ccode>#include &lt;bits\u002Fstdc++.h&gt;\nusing namespace std;\n#define endl \"\\n\"\n#define ll long long\n\nint main()\n{\n    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n\n    string s;\n    cin &gt;&gt; s;\n    sort(s.begin(), s.end());\n    s = \"a\" + s;\n    ll ans = 0;\n    for (int i = 0; i &lt; s.length() - 1; i++) {\n        ans += s[i + 1] - s[i];\n        ans++;\n    }\n\n    cout &lt;&lt; ans;\n\n    return 0;\n}\u003C\u002Fcode>",[38,77,79],{"$":78},{"html":24,"block":4},"K 圆",[21,81,83],{"$":82},{"html":24,"block":4},"数据范围很小，直接暴力，甚至不用手写dfs，用next_permutation()全排列就行了。因为输出任意情况即可，可以提前结束。",[47,85,87],{"$":86,"class":50},{"html":24,"block":24},"\u003Ccode>#include &lt;bits\u002Fstdc++.h&gt;\nusing namespace std;\n#define endl \"\\n\"\n#define ll long long\n\nstruct R {\n    int id;\n    double val;\n};\n\nbool cmp(const R&amp; a, const R&amp; b)\n{\n    return a.val &lt; b.val;\n}\n\nint main()\n{\n    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n\n    int n;\n    cin &gt;&gt; n;\n\n    double a[n][2];\n    for (int i = 0; i &lt; n; i++) {\n        cin &gt;&gt; a[i][0] &gt;&gt; a[i][1];\n    }\n\n    double dis[n][n];\n    for (int i = 0; i &lt; n - 1; i++) {\n        for (int j = i + 1; j &lt; n; j++) {\n            dis[i][j] = sqrt((a[i][0] - a[j][0]) * (a[i][0] - a[j][0]) + (a[i][1] - a[j][1]) * (a[i][1] - a[j][1]));\n        }\n    }\n\n    R r[n];\n    for (int i = 0; i &lt; n; i++) {\n        r[i].id = i + 1;\n        cin &gt;&gt; r[i].val;\n    }\n\n    bool flag;\n    sort(r, r + n, cmp);\n    do {\n        flag = 1;\n        for (int i = 0; i &lt; n - 1; i++) {\n            for (int j = i + 1; j &lt; n; j++) {\n                if (fabs(r[i].val - r[j].val) &lt; dis[i][j] &amp;&amp; dis[i][j] &lt; r[i].val + r[j].val) {\n                    flag = 0;\n                    i = n;\n                    break;\n                }\n            }\n        }\n        if (flag) {\n            break;\n        }\n    } while (next_permutation(r, r + n, cmp));\n\n    if (flag) {\n        for (int i = 0; i &lt; n; i++) {\n            cout &lt;&lt; (i ? \" \" : \"\") &lt;&lt; r[i].id;\n        }\n    } else {\n        cout &lt;&lt; -1;\n    }\n\n    return 0;\n}\u003C\u002Fcode>",[38,89,91],{"$":90},{"html":24,"block":4},"L 编辑器",[21,93,95],{"$":94},{"html":24,"block":4},"大模拟，不难，就是麻烦，非常需要注意细节（我就是比赛一直过不了，回来后发现就错了一句代码，痛心）。",[21,97,99],{"$":98},{"html":24,"block":4},"官方题解的实现太麻烦了，我的是直接用vector\u003Cstring>去模拟多行。",[47,101,103],{"$":102,"class":50},{"html":24,"block":24},"\u003Ccode>#include &lt;bits\u002Fstdc++.h&gt;\nusing namespace std;\n#define endl \"\\n\"\n#define ll long long\n\nstring cs = \")!@#$%^&amp;*(\";\nvector&lt;string&gt; a;\n\nvoid print()\n{\n    for (int i = 0; i &lt; a.size(); i++) {\n        cout &lt;&lt; (i ? \"\\n\" : \"\") &lt;&lt; a[i];\n    }\n}\n\nint main()\n{\n    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n\n    string s;\n    cin &gt;&gt; s;\n\n    int li = 0;\n    int ind = 0;\n    a.emplace_back(\"\");\n\n    bool sft = 0;\n    for (int i = 0; i &lt; s.length(); i++) {\n        char c = s[i];\n        if (c &gt;= 'a' &amp;&amp; c &lt;= 'z') {\n            a[li].insert(ind, string(1, (sft ? c + 'A' - 'a' : c)));\n            ind++;\n        } else if (c &gt;= '0' &amp;&amp; c &lt;= '9') {\n            a[li].insert(ind, string(1, (sft ? cs[c - '0'] : c)));\n            ind++;\n        } else {\n            if (c == 'S') {\n                sft ^= 1;\n                i += 4;\n            } else if (c == 'E' &amp;&amp; s[i + 2] == 'T') {\n                string s1 = a[li].substr(0, ind);\n                string s2 = a[li].substr(ind);\n                a[li] = s1;\n                a.insert(a.begin() + li + 1, s2);\n                li++;\n                ind = 0;\n                i += 4;\n            } else if (c == 'B') {\n                if (ind &gt; 0) {\n                    a[li].erase(ind - 1, 1);\n                    ind--;\n                } else if (li &gt; 0) {\n                    ind = a[li - 1].length();\n                    a[li - 1] += a[li];\n                    a.erase(a.begin() + li);\n                    li--;\n                }\n                i += 8;\n            } else if (c == 'D' &amp;&amp; s[i + 1] == 'E') {\n                if (ind &lt; a[li].length()) {\n                    a[li].erase(ind, 1);\n                } else if (li &lt; a.size() - 1) {\n                    a[li] += a[li + 1];\n                    a.erase(a.begin() + li + 1);\n                }\n                i += 2;\n            } else if (c == 'L') {\n                if (ind &gt; 0) {\n                    ind--;\n                } else if (li &gt; 0) {\n                    li--;\n                    ind = a[li].length();\n                }\n                i += 3;\n            } else if (c == 'R') {\n                if (ind &lt; a[li].length()) {\n                    ind++;\n                } else if (li &lt; a.size() - 1) {\n                    li++;\n                    ind = 0;\n                }\n                i += 4;\n            } else if (c == 'U') {\n                if (li &gt; 0) {\n                    ind = min((int)a[li - 1].length(), ind);\n                    li--;\n                }\n                i += 1;\n            } else if (c == 'D' &amp;&amp; s[i + 1] == 'O') {\n                if (li &lt; a.size() - 1) {\n                    ind = min((int)a[li + 1].length(), ind);\n                    li++;\n                }\n                i += 3;\n            } else if (c == 'H') {\n                ind = 0;\n                i += 3;\n            } else if (c == 'E' &amp;&amp; s[i + 2] == 'D') {\n                ind = a[li].length();\n                i += 2;\n            }\n        }\n    }\n\n    print();\n\n    return 0;\n}\u003C\u002Fcode>",[38,105,107],{"$":106},{"html":24,"block":4},"M 内存溢出",[21,109,111],{"$":110},{"html":24,"block":4},"这才是真的签到题。",[47,113,115],{"$":114,"class":50},{"html":24,"block":24},"\u003Ccode>#include &lt;bits\u002Fstdc++.h&gt;\nusing namespace std;\n#define endl \"\\n\"\n#define ll long long\n\nint main()\n{\n    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n\n    int x;\n    string s;\n    cin &gt;&gt; x &gt;&gt; s;\n    if (s == \"MiB\") {\n        cout &lt;&lt; x * 1024 &lt;&lt; \" KiB\";\n    } else {\n        cout &lt;&lt; x * 1000 &lt;&lt; \" KB\";\n    }\n\n    return 0;\n}\u003C\u002Fcode>",[34,117],{"$":118},{"html":24,"block":4},[21,120,122,123],{"$":121},{"html":24,"block":4},"剩下的题还没补（",[124,125,128],"span",{"$":126,"style":127},{"html":24,"block":4},"text-decoration: line-through;","前面的区域，以后再来探索吧~"]