【题解】codeforces 793G - Oleg and chess 线段树优化建边--最大流

题意

一个网格图，删除一些矩形中的格子
每行每列只能放一个棋子，问最多放多少个
n , q <= 1e4

题解

标准的网络流模型是行列分开连边
对矩形扫描线
可持久化线段树维护当前可行的格子。
矩形差分，每次修改新建节点，如果一段区间都被删除则不连边。
因为矩形没有重叠，非常好写！
一开始还以为有高论，结果是简单的模型

总结：
这样简单的题必须快速写，基本的模型，没有细节，只需要写的时候专注，不要打错
但是还是写了50min！因为一开始没有想好怎么可持久化和连边。还要要先删除，再加入。

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(register int i = l ; i <= r ; i++)
#define repd(i,r,l) for(register int i = r ; i >= l ; i--)
#define rvc(i,S) for(register int i = 0 ; i < (int)S.size() ; i++)
#define rvcd(i,S) for(register int i = ((int)S.size()) - 1 ; i >= 0 ; i--)
#define fore(i,x)for (register int i = head[x] ; i ; i = e[i].next)
#define forup(i,l,r) for (register int i = l ; i <= r ; i += lowbit(i))
#define fordown(i,id) for (register int i = id ; i ; i -= lowbit(i))
#define pb push_back
#define prev prev_
#define stack stack_
#define mp make_pair
#define fi first
#define se second
#define lowbit(x) (x&(-x))

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pr;

const int inf = 2e8;
const int N = 3e6 + 10;
const int maxn = 2000020;
const ll mod = 1e9 + 7;

struct node{
	int next,to,f;
}e[maxn * 2];
int head[maxn],cnt = 1,cur[maxn];
int q[maxn],hh,tt,S,T,maxflow,dis[maxn],sum;
struct node2{
	int l,r,tp;
	bool operator < (node2 a)const{
		return tp < a.tp;
	}
};
vector <node2> vec[maxn];

int deg[maxn],n,m,t,bl;
inline void adde(int x,int y,int c){
	e[++cnt].to = y;
	e[cnt].next = head[x];
	e[cnt].f = c;
	head[x] = cnt;
	e[++cnt].to = x;
	e[cnt].next = head[y];
	e[cnt].f = 0; //多组数据一定要把每个变量都清空
	head[y] = cnt;
}
namespace Seg{
#define ls(x) ls[x]
#define rs(x) rs[x]
	const int M = 2e6 + 20;
	int ls[M],rs[M],rt[M],tot,sz[M];
	
	inline void update(int x){
		sz[x] = sz[ls(x)] | sz[rs(x)];
		if ( sz[ls(x)] ) adde(x,ls(x),inf);
		if ( sz[rs(x)] ) adde(x,rs(x),inf);
	}
	inline void copy(int x,int y){ 
		ls(x) = ls(y) , rs(x) = rs(y);
	}
	void modify(int &x,int l,int r,int L,int R,int d){
	//	if ( x == 1 ) cout<<L<<" "<<R<<" "<<d<<endl;
	
	//	if ( l == r ) adde(y,l + n,inf);
		if ( L <= l && R >= r ) {
		//	cout<<l<<" "<<r<<" "<<d<<endl;
		    if ( d == 1 ) sz[x] = 0;
			else sz[x] = 1;
			return;
		}
		int y = ++tot;
		copy(y,x) , x = y;
		int mid = (l + r) >> 1;
		if ( L <= mid ) modify(ls(y),l,mid,L,R,d);
		if ( R > mid ) modify(rs(y),mid + 1,r,L,R,d);
		update(y);
	}
	
	void build(int &x,int l,int r){
		if ( !x ) x = ++tot;
		sz[x] = 1;
		if ( l == r ){
			adde(x,l + n,inf);
			return;
		}
		int mid = (l + r) >> 1;
		build(ls(x),l,mid) , build(rs(x),mid + 1,r);
		adde(x,ls(x),inf) , adde(x,rs(x),inf);
	}
}
using namespace Seg;

void clear(){
	bl = 1 , cnt = 1;
	rep(i,1,T) head[i] = 0;
	sum = maxflow = 0;
}

bool bfs(){
	tt = hh = 0;
	rep(i,1,T) dis[i] = 0;
	dis[S] = 1 , q[tt++] = S; //初值设为1，否则会被迷之更新而死循环，从来没有犯过的错误
	while ( hh < tt ){
		int x = q[hh++];
		for (int i = head[x] ; i ; i = e[i].next){
			if ( e[i].f && !dis[e[i].to] ){
				dis[e[i].to] = dis[x] + 1;
				q[tt++] = e[i].to;
			}
		}
	}
	return dis[T];
}
int dfs(int x,int delta){
	if ( !delta || x == T ) return delta;
	int res = 0;
	for (int &i = cur[x] ; i ; i = e[i].next){
		if ( e[i].f && dis[e[i].to] == dis[x] + 1 ){
			int d = dfs(e[i].to,min(delta,e[i].f));
			e[i].f -= d , e[i ^ 1].f += d;
			delta -= d, res += d;
			if ( !delta ) return res;
		}
	}
	if ( delta ) dis[x] = -1;
	return res;
}

int main(){
//	ios::sync_with_stdio(false);
	int q;
	scanf("%d %d",&n,&q);
	rep(i,1,q){
		int x1,x2,y1,y2;
		cin>>x1>>y1>>x2>>y2;
		vec[x1].pb((node2){y1,y2,1});
		vec[x2 + 1].pb((node2){y1,y2,-1});
	}
	tot = n * 2;
	build(rt[0],1,n);
	rep(i,1,n){
	//	cout<<" check : "<<i<<endl;
		rt[i] = rt[i - 1];
		sort(vec[i].begin(),vec[i].end());
		rvc(j,vec[i]){
			modify(rt[i],1,n,vec[i][j].l,vec[i][j].r,vec[i][j].tp);
		}
		if ( sz[rt[i]] ) adde(i,rt[i],1);
	}
	S = tot + 1 , T = tot + 2;
	rep(i,1,n) adde(S,i,1) , adde(i + n,T,1);
	while ( bfs() ){
		rep(i,1,T) cur[i] = head[i];
		maxflow += dfs(S,inf);
	}
	cout<<maxflow<<endl;
}