【TC SRM 627】LaserTowersDiv1（最小割）

传送门

---

题解：

非法情况就是存在一条从横的炮台走到纵的炮台的路径。

考虑利用最小割来构造一个不包含这样路径的攻击方案。

首先所有炮台能够打到的位置中的最大值加入答案。

源点向所有纵向攻击的炮台连边，所有横向攻击的炮台向汇点连边，容量为INF。

所有非炮台点建立两个点，纵向向横向连边INF，表示割不掉。

然后每个炮台拉出来一条链，相邻的点连边，容量为攻击更接近炮台的点会少攻击的敌人数。

跑最小割，割掉某条边说明会攻击这条边之前的那个位置，显然这样构造一个S-T割能够保证没有任何纵向连到横向的路径。

---

代码：

#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const

using std::string;

class LaserTowersDiv1{
	private:
		static cs int N=1e4+7,M=55,INF=0x3f3f3f3f;
		int S,T,tot,n,m,row[M][M],col[M][M];
		
		struct edge{int to,cap,rev;};
		typedef std::vector<edge>::iterator iter;
		std::vector<edge> G[N];iter cur[N];
		inline void adde(int u,int v,int val){
			G[u].push_back((edge){v,val,G[v].size()});
			G[v].push_back((edge){u,0,G[u].size()-1});
		}
		
		int lev[N],gap[N],finish;
		inline void BFS(){
			memset(lev+1,0,sizeof(int)*tot);
			memset(gap+1,0,sizeof(int)*tot);
			std::queue<int> q;q.push(T);gap[1]=lev[T]=1;
			while(!q.empty()){
				int u=q.front();q.pop();cur[u]=G[u].begin();
				for(auto e:G[u])if(!lev[e.to]){
					lev[e.to]=lev[u]+1;
					++gap[lev[e.to]];
					q.push(e.to);
				}
			}
			finish=lev[S]==0;
		}
		
		inline int dfs(int u,int flow){
			if(u==T)return flow;
			int ans=0;
			for(iter &e=cur[u];e!=G[u].end();++e)
			if(e->cap&&lev[e->to]+1==lev[u]){
				int delta=dfs(e->to,std::min(flow-ans,e->cap));
				if(delta){
					e->cap-=delta;
					G[e->to][e->rev].cap+=delta;
					if((ans+=delta)==flow)return flow;
				}
			}
			if(!--gap[lev[u]++])finish=true;
			++gap[lev[u]],cur[u]=G[u].begin();
			return ans;
		}
		
		inline int Flow(){
			int flow=0;BFS();
			while(!finish)flow+=dfs(S,INF);
			return flow; 
		}
		
		inline bool istower(char c){return c=='<'||c=='>'||c=='A'||c=='V';}
		inline int val(char c){if(!isdigit(c))return 0;return c^48;}
	public:
		LaserTowersDiv1(){}
		int countMaxEnemies(std::vector<string> s){
			n=s.size();m=s[0].size();
		//	std::cerr<<n<<" "<<m<<"\n";
			S=tot=1,T=++tot;int ans=0;
			for(int re i=0;i<n;++i)
			for(int re j=0;j<m;++j)row[i][j]=++tot,col[i][j]=++tot;
			for(int re i=0;i<n;++i)
			for(int re j=0;j<m;++j)if(istower(s[i][j])){
				int dx,dy,x=i,y=j,mx=0;
				switch(s[i][j]){
					case 'A':dx=-1,dy=0;break;
					case 'V':dx=1,dy=0;break;
					case '<':dx=0,dy=-1;break;
					case '>':dx=0,dy=1;break;
				}
				while(true){
					x+=dx,y+=dy;
					if(x<0||x>=n||y<0||y>=m)break;
					mx=std::max(mx,val(s[x][y]));
				}
				ans+=mx;
				if(!dy)adde(S,col[i][j],INF);
				else adde(row[i][j],T,INF);
				x=i,y=j;
				while(true){
					int xx=x,yy=y;x+=dx,y+=dy;
					if(x<0||x>=n||y<0||y>=m)break;
					if(!dy)adde(col[xx][yy],col[x][y],mx-val(s[xx][yy]));
					else adde(row[x][y],row[xx][yy],mx-val(s[xx][yy]));
				}
			}else adde(col[i][j],row[i][j],INF);
			return ans-Flow();
		}
};

#ifdef zxyoi

LaserTowersDiv1 Solver;

signed main(){
	std::cout<<Solver.countMaxEnemies(
{
"........7..7......4...<...V9.5.",
">.........2.........5..46......",
".6...........9..<..>...5.......",
".6...................<..A>...5.",
".V>....................6.......",
".....57.............<...>....7.",
"..............6.........<V....7",
"V..V7..V..AA>..............61..",
"..V.......V..A.....>.....5.....",
"......7....V....>.........7....",
"1...........<>..............6..",
"............5...........<......",
".........6..V.......V...V..A...",
".2...........<....A..>....7....",
"5..........................<...",
".............V...5...>.....6...",
"........5.......V.V....A...>.8.",
".....A.........7.....>......5..",
"96.........................<...",
"....AV..............7V.....VA.A",
"..............5....6........<.V",
"..6................<........V..",
"....V..............>.......5..6",
"8.6................<...>....6..",
".........A.............V.....A.",
".....6A........A.A.>.....6.....",
"69....<.A>.............3.......",
"...2.....<....A.......>...2.6..",
"...76..5.....7..7..5........7<.",
"...8.......6..<..V5>.....9..7..",
"....7.....5.5.<>.4...7.556.4..."
}
	)<<"\n";
	return 0;
}

#endif