2019 上海网络赛 B、 Light bulbs 区间差分 / 线段树点维护区间

题目链接：https://nanti.jisuanke.com/t/41399

题解：看见的第一思路应该都是差分，但是这个用数组肯定就gg了，所以当时的时候就想到动态开点线段树，mlog(n)但是T了，然后我就把点离散了一下，用点去维护区间，mlog(m)，跑了900ms，后来才知道，差分也可以，就是把处理点记录下来，然后排个序，搞一下就可以了，这样也是mlogm,300ms

差分：

#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
vector<pair<int, int > > v;
int n, m;
int main() {
	int T;
	int l, r;
	int nn = 1;
	scanf("%d", &T);
	while(T--) {
		v.clear(); 
		scanf("%d %d", &n, &m);
		for(int i = 1; i <= m; i++) {
			scanf("%d %d", &l, &r);
			v.push_back(make_pair(l, 1));
			v.push_back(make_pair(r + 1, -1)); 
		}
		sort(v.begin(), v.end());
		int pre = v[0].first;
		int ans = 0, flag = 1;
		for(int i = 1; i < v.size(); i++) {
			if(v[i].first != pre) {
				if(flag & 1) ans += v[i].first - pre;
				pre = v[i].first;
			}
			flag += v[i].second;
		}
		printf("Case #%d: %d\n", nn++, ans);
	}
	return 0;
}

线段树：

#include <bits/stdc++.h>
using namespace std;
const int N = 2000 + 10;
int n, m;
struct node {
	int l, r;
	int num;
	int val, laz;
}tree[N << 4];
int tot;
int b[N], len;
struct NODE{
	int l, r;
}q[N];
void build(int l, int r, int cur) {
	tree[cur].l = l;
	tree[cur].r = r;
	tree[cur].laz = 0;
	tree[cur].val = 0;
	if(l == r) {
		tree[cur].num = b[l + 1] - b[l];
		return;
	}
	int mid = (l + r) >> 1;
	build(l, mid, cur << 1);
	build(mid + 1, r, cur << 1 | 1);
	tree[cur].num = tree[cur<<1].num + tree[cur << 1 | 1].num;
}
void pushdown(int cur, int l, int r, int mid) {
	if(tree[cur].laz) {
		tree[cur << 1].laz ^= 1;
		tree[cur << 1 | 1].laz ^= 1;
		tree[cur << 1].val = tree[cur << 1].num - tree[cur << 1].val;
		tree[cur << 1 | 1].val = tree[cur << 1 | 1].num - tree[cur << 1 | 1].val;
		tree[cur].laz = 0;
	}
}
void update(int pl, int pr, int cur) {
	if(pl <= tree[cur].l && tree[cur].r <= pr) {
		tree[cur].laz ^= 1;
		tree[cur].val = tree[cur].num - tree[cur].val;
		return;
	}
	
	int mid = (tree[cur].l + tree[cur].r) >> 1;
	pushdown(cur, tree[cur].l, tree[cur].r, mid);
	if(pl <= mid) update(pl, pr, cur << 1);
	if(pr > mid) update(pl, pr , cur << 1 | 1);
	tree[cur].val = tree[cur << 1].val + tree[cur << 1 | 1].val;
}
int main() {
	int T;
	int nn = 1;
	int x, y;
	int ans;
	
	scanf("%d", &T);
	while(T--) {
		scanf("%d %d", &n, &m);
		for(int i = 1; i <= m; i++) {
			scanf("%d %d", &q[i].l, &q[i].r);
			b[i * 2 - 1] = q[i].l;
			b[i * 2] = q[i].r + 1;
		}
		sort(b + 1, b + 1 + m * 2);
		len = unique(b + 1, b + 1 + m * 2) - (b + 1);
		build(1, len - 1, 1);
		for(int i = 1; i <= m; i++) {
			x = lower_bound(b + 1, b + 1 + len, q[i].l) - b;
			y = lower_bound(b + 1, b + 1 + len, q[i].r + 1) - b;
			update(x, y - 1, 1);
		}
		printf("Case #%d: %d\n", nn++, tree[1].val);
	}
	return 0;
}