Light bulbs（思维+差分）

题意：就是给你N个灯，m个区间，对区间里的灯就行操作，问你这些灯被操作奇数次的有多少个？

题解： 我一看这题感觉用线段树，内存超了，然后就借鉴大佬的思路用思维，你可以自己造一些数据模拟一下，发现确实如此。

There are NN light bulbs indexed from 00 to N-1N−1. Initially, all of them are off.

A FLIP operation switches the state of a contiguous subset of bulbs. FLIP(L, R)FLIP(L,R) means to flip all bulbs xxsuch that L \leq x \leq RL≤x≤R. So for example, FLIP(3, 5)FLIP(3,5) means to flip bulbs 33 , 44 and 55, and FLIP(5, 5)FLIP(5,5) means to flip bulb 55.

Given the value of NN and a sequence of MM flips, count the number of light bulbs that will be on at the end state.

InputFile

The first line of the input gives the number of test cases, TT. TT test cases follow. Each test case starts with a line containing two integers NN and MM, the number of light bulbs and the number of operations, respectively. Then, there are MM more lines, the ii-th of which contains the two integers L_iLi​ and R_iRi​, indicating that the ii-th operation would like to flip all the bulbs from L_iLi​ to R_iRi​ , inclusive.

1 \leq T \leq 10001≤T≤1000

1 \leq N \leq 10^61≤N≤106

1 \leq M \leq 10001≤M≤1000

0 \leq L_i \leq R_i \leq N-10≤Li​≤Ri​≤N−1

OutputFile

For each test case, output one line containing Case #x: y, where xx is the test case number (starting from 11) and yy is the number of light bulbs that will be on at the end state, as described above.

样例输入复制

2
10 2
2 6
4 8
6 3
1 1
2 3
3 4

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[2010];
int main()
{
	int T;
	scanf("%d",&T);
	for(int j=1;j<=T;j++)
	{
		int n,m;
		scanf("%d%d",&n,&m);
		int cnt=0;
		for(int i=0;i<m;i++)
		{
			int l,r;
			scanf("%d%d",&l,&r);
			a[cnt++]=l;
			a[cnt++]=r+1;
		}
		sort(a,a+cnt);
		int  ans=0;
		for(int i=1;i<cnt;i+=2)
		{
			ans+=a[i]-a[i-1];
		}
		printf("Case #%d: %d\n",j,ans);
	}
	return 0;
 } 

样例输出复制

Case #1: 4
Case #2: 3