Submission #2547710

---

Source Code Expand

#include<cstdio>
const int inf=1<<30;
int H,W,V[110][110][2],tot=2;
char a[110][110];
struct edge{int to,cap;edge*rev,*next;}E[110000],*ne=E,*fir[22000],*cur[22000];
void link(int a,int b,int c){
	*ne=(edge){b,c,ne+1,fir[a]};fir[a]=ne++;
	*ne=(edge){a,0,ne-1,fir[b]};fir[b]=ne++;
}
int Q[22000],D[22000];
int dfs(int i,int c){
	if(i==1||!c)return c;
	int fl=0,f;
	for(edge*&e=cur[i];e&&c;e=e->next)
		if(e->cap&&D[e->to]==D[i]-1&&(f=dfs(e->to,c<e->cap?c:e->cap)))
			fl+=f,e->cap-=f,e->rev->cap+=f,c-=f;
	return fl;
}
int mf(){
	for(int f=0;;f+=dfs(0,1<<30)){
		for(int i=0;i<tot;i++)D[i]=0,cur[i]=fir[i];
		for(int*h=Q,*t=Q+(D[*Q=1]=1);h<t;h++)
			for(edge*e=fir[*h];e;e=e->next)
				if(e->rev->cap&&!D[e->to])D[*t++=e->to]=D[*h]+1;
		if(!*D)return f;
	}
}
int main(){
	scanf("%d%d",&H,&W);
	for(int i=0;i<H;i++){
		scanf("%s",a[i]);
		int o=tot++;
		for(int j=0;j<W;j++)if(a[i][j]!='.'){
			V[i][j][0]=tot++;
			V[i][j][1]=tot++;
			link(V[i][j][0],V[i][j][1],1);
			link(V[i][j][1],o,inf);
			link(o,V[i][j][0],inf);
			if(a[i][j]=='S')link(0,V[i][j][1],inf);
			if(a[i][j]=='T')link(V[i][j][0],1,inf);
		}
	}
	for(int j=0;j<W;j++){
		int o=tot++;
		for(int i=0;i<H;i++)if(a[i][j]!='.'){
			link(V[i][j][1],o,inf);
			link(o,V[i][j][0],inf);
		}
	}
	int ans=mf();
	printf("%d\n",ans>=inf?-1:ans);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&H,&W);
                     ^
./Main.cpp:31:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",a[i]);
                   ^

Judge Result