题目描述
Farmer John tries to keep the cows sharp by letting them play with intellectual toys. One of the larger toys is the lights in the barn. Each of the N (2 <= N <= 100,000) cow stalls conveniently numbered 1..N has a colorful light above it.
At the beginning of the evening, all the lights are off. The cows control the lights with a set of N pushbutton switches that toggle the lights; pushing switch i changes the state of light i from off to on or from on to off.
The cows read and execute a list of M (1 <= M <= 100,000) operations expressed as one of two integers (0 <= operation <= 1).
The first kind of operation (denoted by a 0 command) includes two subsequent integers S_i and E_i (1 <= S_i <= E_i <= N) that indicate a starting switch and ending switch. They execute the operation by pushing each pushbutton from S_i through E_i inclusive exactly once.
The second kind of operation (denoted by a 1 command) asks the cows to count how many lights are on in the range given by two integers S_i and E_i (1 <= S_i <= E_i <= N) which specify the inclusive range in which the cows should count the number of lights that are on.
Help FJ ensure the cows are getting the correct answer by processing the list and producing the proper counts.
灯是由高科技——外星人鼠标操控的。你只要左击两个灯所连的鼠标，
这两个灯，以及之间的灯都会由暗变亮，或由亮变暗。右击两个灯所连的鼠
标，你就可以知道这两个灯，以及之间的灯有多少灯是亮的。起初所有灯都是暗的，你的任务是在LZ之前算出灯的亮灭。
输入输出格式
输入格式：
第1 行: 用空格隔开的两个整数N 和M，n 是灯数
第2..M+1 行: 每行表示一个操作, 有三个用空格分开的整数: 指令号, S_i 和E_i
第1 种指令(用0 表示)包含两个数字S_i 和E_i (1 <= S_i <= E_i <= N), 它们表示起
始开关和终止开关. 表示左击
第2 种指令(用1 表示)同样包含两个数字S_i 和E_i (1 <= S_i <= E_i <= N), 不过这
种指令是询问从S_i 到E_i 之间的灯有多少是亮着的.
输出格式：
输入输出样例
4 5 0 1 2 0 2 4 1 2 3 0 2 4 1 1 4
1 2
1 //2018年2月23日17:42:45 2 #include <iostream> 3 #include <cstdio> 4 using namespace std; 5 6 int n, m, s, t; 7 int A[410000]; 8 int sum[410000]; 9 int size[410000]; 10 11 void change(int k1){ 12 sum[k1] = (sum[k1*2] + sum[k1*2+1]); 13 } 14 void buildtree(int k1, int l, int r){ 15 size[k1] = r-l+1; 16 if(l == r){ 17 sum[k1] = 0; 18 return; 19 } 20 int mid = l+r >> 1; 21 buildtree(k1*2, l, mid); 22 buildtree(k1*2+1, mid+1, r); 23 change(k1); 24 } 25 26 void add(int k1, int x){ 27 if(x & 1){ 28 A[k1] += x; 29 sum[k1] = size[k1] - sum[k1]; 30 } 31 } 32 33 void pushdown(int k1){ 34 if(A[k1]){ 35 add(k1*2, A[k1]); 36 add(k1*2+1, A[k1]); 37 A[k1] = 0; 38 } 39 } 40 41 void addall(int k1, int l, int r, int L, int R, int x){ 42 if(l>R || r<L) return; 43 if(l>=L && r<=R){ 44 add(k1, x); 45 return; 46 } 47 int mid = l+r >> 1; 48 pushdown(k1); 49 addall(k1*2, l, mid, L, R, x); 50 addall(k1*2+1, mid+1, r, L, R, x); 51 change(k1); 52 } 53 54 int find(int k1, int l, int r, int L, int R){ 55 if(l>R || r<L) return 0; 56 if(l>=L && r<=R){ 57 return sum[k1]; 58 } 59 int mid = l+r >> 1; 60 pushdown(k1); 61 return find(k1*2, l, mid, L, R) + find(k1*2+1, mid+1, r, L, R); 62 } 63 64 65 int main(){ 66 scanf("%d%d", &n, &m); 67 buildtree(1, 1, n); 68 for(int i=1;i<=m;i++){ 69 int k1, k2, k3; 70 scanf("%d%d%d", &k1, &k2, &k3); 71 if(k1 == 0){ 72 addall(1, 1, n, k2, k3, 1); 73 }else{ 74 printf("%d\n", find(1, 1, n, k2, k3)); 75 } 76 } 77 78 return 0; 79 }
