[USACO 2008 Nov G]Light Switching（线段树 + 懒标记）

题目链接

分析

这个就比较简单了，线段树维护一下区间0 1个数就行，用个懒标记表示是否区间反转。
1表示亮，0表示暗

代码

#include<iostream>
#include<queue>
#include<cstring>
#include<vector>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<deque>
#include<stack>
#include<set>
// #include <unordered_map>
#include<math.h>
#include<string.h>
#define IOS ios::sync_with_stdio(false),cin.tie(0);
using namespace std;
 
#define pb push_back
#define coutl cout<<"------------"<<endl;
#define fi first
#define se second
  
#define ire(x) scanf("%d",&x)
#define iire(a,b) scanf("%d %d",&a,&b)
#define lre(x) scanf("%lld",&x)
#define llre(a,b) scanf("%lld %lld",&a,&b)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define endl "\n"
#define PI acos(-1.0)

typedef long long ll;
typedef unsigned long long ull;
      
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<ll, ll> PLL;
typedef pair<double, double> PDD;
typedef pair<double, pair<int, double> > PDID;
typedef pair<char, char> PCC;
typedef pair<char, pair<int, int> > PCII;
typedef pair<int, pair<int, int> > PIII;
typedef pair<int, pair<int, pair<int, int> > > PIIII;
typedef pair<ll, pair<int, int> > PLII;
 
const int maxn = 1e5 + 7;
const int N = 2010 + 7;
const int M = 1e6 + 7;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
// const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1);
const double eps = 1e-8;
  
ll gcd(ll a,ll b) {return b==0 ? a : gcd(b,a%b);}
ll lcm(ll a,ll b) {return a*b / gcd(a,b);}
ll qmi(ll a,ll b,ll p) {ll ans = 1; while(b) { if(b & 1) ans = ans * a % p; a = a * a % p; b >>= 1; } return ans;}
int lowbit(int x) {return x & (-x);}

struct node
{
	int l,r;
	int cnt1,cnt0;
	int add;	//区间反转懒标记
}tr[maxn*4];

int n,m;

void pushup(int u)
{
	tr[u].cnt0 = tr[u<<1].cnt0 + tr[u<<1|1].cnt0;
	tr[u].cnt1 = tr[u<<1].cnt1 + tr[u<<1|1].cnt1;
}

void pushdown(int u)
{
	if(tr[u].add)
	{
		swap(tr[u<<1].cnt0,tr[u<<1].cnt1);
		tr[u<<1].add ^= 1;
		
		swap(tr[u<<1|1].cnt0,tr[u<<1|1].cnt1);
		tr[u<<1|1].add ^= 1;
		
		tr[u].add = 0;
	}
}

void build(int u,int l,int r)
{
	if(l == r)
	{
		tr[u] = {l,r,0,1,0};
		return;
	}
	
	tr[u] = {l,r};
	
	int mid = l + r >> 1;
	build(u<<1,l,mid);
	build(u<<1|1,mid+1,r);
	
	pushup(u);
}

void update(int u,int l,int r,int v)
{
	if(tr[u].l >= l && tr[u].r <= r)
	{
		swap(tr[u].cnt0,tr[u].cnt1);
		tr[u].add ^= v;
		
		return;
	}
	
	pushdown(u);	//分裂了，下传懒标记
	
	int mid = tr[u].l + tr[u].r >> 1;
	if(l <= mid) update(u<<1, l, r, v);
	if(r > mid) update(u<<1|1, l, r, v);
	
	pushup(u);	//向上更新
}

ll query(int u,int l,int r)	//区间查询
{
	if(tr[u].l >= l && tr[u].r <= r) return tr[u].cnt1;
	
	pushdown(u);	//分裂了，下传懒标记
	
	int mid = tr[u].l + tr[u].r >> 1;
	ll sum = 0;
	
	if(l <= mid) sum += query(u<<1, l, r);
	if(r > mid) sum += query(u<<1|1, l, r);
	
	return sum;
}

int main()
{
	iire(n,m);
	
	build(1,1,n);
	
	while(m--)
	{
		int op;
		ire(op);
		int l,r;
		iire(l,r);
		
		if(op == 0)	update(1,l,r,1);//区间修改
		else cout<<query(1,l,r)<<'\n';	//区间查询
	}		
	
	return 0;
}