Sanhai's Blogs2026-05-16T03:30:19.615Zhttp://example.com/SanhaiHexoHexo添加最后在线时间http://example.com/2026/05/16/hello-world(1)/2026-05-16T03:27:32.229Z2026-05-16T03:30:19.615ZWelcome to Sanhai’s Blogs!
intmain(){ int c; longlong n, m; int q; cin >> c >> n >> m >> q; //空间占用超标 vector<vector<bool>> board(n + 1, vector<bool>(m + 1, false)); for (int i = 0; i < q; i++) { int t; longlong x1, y1, x2, y2; cin >> t >> x1 >> y1 >> x2 >> y2; if (t == 1) { for (longlong x = x1; x <= x2; x++) { board[y1][x] = true; } } } longlong ans = 0; for (int y = 1; y <= n; y++) { for (longlong x = 1; x <= m; x++) { if (board[y][x]) ans++; } } cout << ans << endl; return0; }
structSegTree { int n; vector<int> tree, lazy; SegTree(int _n) { n = _n; tree.assign(4 * n + 5, 0); lazy.assign(4 * n + 5, 0); } voidpush(int node, int l, int r){ if (lazy[node]) { tree[node] = (r - l + 1); if (l != r) { lazy[node * 2] = lazy[node * 2 + 1] = 1; } lazy[node] = 0; } } voidupdate(int node, int l, int r, int ul, int ur){ push(node, l, r); if (ul > r || ur < l) return; if (ul <= l && r <= ur) { lazy[node] = 1; push(node, l, r); return; } int mid = (l + r) >> 1; update(node * 2, l, mid, ul, ur); update(node * 2 + 1, mid + 1, r, ul, ur); tree[node] = tree[node * 2] + tree[node * 2 + 1]; } intquery(){ return tree[1]; } };
intmain(){ int c; longlong n, m; int q; cin >> c >> n >> m >> q; // 需要为每行建线段树，空间太大 unordered_map<longlong, SegTree*> rowTrees; for (int i = 0; i < q; i++) { int t; longlong x1, y1, x2, y2; cin >> t >> x1 >> y1 >> x2 >> y2; if (t == 1) { if (rowTrees.find(y1) == rowTrees.end()) { rowTrees[y1] = newSegTree(m); } rowTrees[y1]->update(1, 1, m, x1, x2); } } longlong ans = 0; for (auto& p : rowTrees) { ans += p.second->query(); } cout << ans << endl; return0; }
intmain(){ int c; cin >> c; longlong n, m; int q; cin >> n >> m >> q; int cnt = 0; for (int i = 0; i < q; i++) { int t; longlong x1, y1, x2, y2; cin >> t >> x1 >> y1 >> x2 >> y2; if (t == 1) { seg[cnt++] = {y1, x1, x2}; } } //按行号排序，让同一行的区间连续 sort(seg, seg + cnt, cmp1); longlong ans = 0; //遍历每一行 for (int i = 0; i < cnt; ) { int j = i; // 找到同一行的区间，j指向下一行的开头 while (j < cnt && seg[j].h == seg[i].h) { j++; } //按左端点排序 int len = j - i; for (int k = 0; k < len; k++) { tmp[k] = seg[i + k]; } sort(tmp, tmp + len, cmp2); //合并区间并累加长度 longlong curL = tmp[0].l; longlong curR = tmp[0].r; for (int k = 1; k < len; k++) { longlong L = tmp[k].l; longlong R = tmp[k].r; if (L <= curR + 1) {//可合并 if (R > curR) curR = R; } else {//不能合并，结算 ans += curR - curL + 1; curL = L; curR = R; } } ans += curR - curL + 1;//别忘了最后一个区间 i = j;// 跳到下一行 } cout << ans << endl; return0; }
🎌 结语
OK啊，分拿到了。本题解结束
]]><h1>子任务 A 题解（纯水平染色）</h1>
<blockquote>
<p>说句实话，我写的题解真的是不如AI。那么作为一个<s>OI选手</s>人类，我们能做的是什么呢？只有如何想出来的思路罢了。所以本篇题解主要注意的是思想过程，以及遇到一道题目时我的反应。</p>
</Hello Worldhttp://example.com/2025/12/25/hello-world/2025-12-25T12:57:17.626Z2025-11-25T09:22:14.953ZWelcome to Sanhai’s Blogs! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.
]]><p>Welcome to <a href="https://app-36819-sanhai.cn24.ugdocker.link/">Sanhai’s Blogs</a>! This is your very first post. Check <a href="https:学习小组 - 题解http://example.com/2025/12/11/T706110%E5%AD%A6%E4%B9%A0%E5%B0%8F%E7%BB%84%E9%A2%98%E8%A7%A3/2025-12-11T15:07:36.000Z2025-12-11T07:17:30.202ZT706110 学习小组
