题目:
https://www.luogu.org/problem/P4390
题意:
有一个W*W的矩阵,所有格子的初始值均为S。
每次操作可以增加某格子的权值,或询问某子矩阵的总权值
输入:
第一行两个整数S,W,其中S为矩阵初始值,W为矩阵大小
输出:
对于每个询问(即第二种输入),输出一行表示答案。
(其实这道题目所有格子的初始值为0,并不是s,所以那个s可以丢掉了orz。。)
对于矩形的查询(左下角坐标x1,y1, 右上角坐标x2,y2),可以用容斥定理转化为四个矩形:
矩形1:左下角0,0 , 右上角x1-1,y1-1
矩形2:左下角0,0,右上角x2,y2
矩形3:左下角0,0,右上角x1-1,y2
矩形4:左下角0,0,右上角x2,y1-1
这样目标矩形= 矩形1+矩形2-矩形3-矩形4
然后就可以使用CDQ分治做了
https://blog.csdn.net/weixin_43191865/article/details/99817315
时间复杂度分析(我也不知道对不对): (在这里M看成2e5,Q,M合并)
归并排序(CDQ分治):MlogM
树状数组修改+查询:logW
差不多就是 M*logM*logW
代码:
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 2e6 + 7;
const int maxm = 2e5 + 7;
#define lowbit(i)(i&-i)
struct node {
//x y:coordinate, opt=1: add opt=2: query
//cnt: 记录id
int x, y, opt, cnt, val;
node() = default;
node(int a, int b, int c, int d, int e) :x(a), y(b), opt(c), cnt(d), val(e) {};
bool operator<(node e) {
return cnt < e.cnt;
}
}num[maxm], sto[maxm];
int s, w, len;
int c[maxn];
int getsum(int x) {
int sum = 0;
for (int i = x; i; i -= lowbit(i))
sum += c[i];
return sum;
}
void addnum(int x,int v) {
for (int i = x; i <= w; i += lowbit(i))
c[i] += v;
}
//beg end
void CDQ(int bg, int ed) {
if (bg >= ed)
return;
int mid = (bg + ed) >> 1;
CDQ(bg, mid);
CDQ(mid + 1, ed);
int l = bg, r = mid + 1;
for (int i = bg; i <= ed; i++) {
if ((l <= mid && num[l].x <= num[r].x) || r > ed) {
//sto[i] = num[l];
if (num[l].opt == 1)
addnum(num[l].y, num[l].val);
sto[i] = num[l];
l++;
}
else {
if (num[r].opt == 2)
num[r].val += getsum(num[r].y);
sto[i] = num[r];
r++;
}
}
for (int i = bg; i <= mid; i++)
if (num[i].opt == 1)
addnum(num[i].y, -num[i].val);
for (int i = bg; i <= ed; i++)
num[i] = sto[i];
}
int main() {
cin >> s >> w;
w++; //漏了这个wa了好几发
int opt, x1, y1, x2, y2, v;
len = 0;
while (scanf("%d", &opt), opt != 3) {
scanf("%d %d", &x1, &y1);
x1++, y1++;
if (opt == 1) {
scanf("%d", &v);
num[++len] = node{ x1,y1,opt,len,v };
}
else {
scanf("%d %d", &x2, &y2);
x2++, y2++;
num[++len] = node{ x1 - 1,y1 - 1,opt,len,0 };
num[++len] = node{ x2,y2,opt,len,0 };
num[++len] = node{ x1 - 1,y2,opt,len,0 };
num[++len] = node{ x2,y1 - 1,opt,len,0 };
}
}
CDQ(1, len);
sort(num + 1, num + 1 + len);
for (int i = 1; i <= len; i++) {
if (num[i].opt == 2) {
//printf("%d\n", (num[i + 1].y + num[i + 1].x)*s + num[i].val + num[i + 1].val
// - num[i + 2].val - num[i + 3].val);
printf("%d\n", (num[i].val + num[i + 1].val
- num[i + 2].val - num[i + 3].val));
i += 3;
}
}
return 0;
}