Submission #2098509


Source Code Expand

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

const int N=21005,M=N*10,nn=105,INF=1e9;

typedef long long LL;

int n,m,tot,In[nn][nn],Out[nn][nn],H[nn],W[nn],S,T,sum;

int h[N],e[M],nxt[M],fl[M],f[N],vis[N],calc,Now[N],ans;

char Map[nn][nn];

void Add(int x,int y,int z)
{
	e[++tot]=y; nxt[tot]=h[x]; fl[tot]=z; h[x]=tot;
}

bool aug(int x)
{
	vis[x]=calc;
	if (x==T) return 1;
	for (int i=Now[x];i;i=nxt[i]) if (fl[i] && vis[e[i]]<calc && f[x]==f[e[i]]+1)
	{
		if (aug(e[i]))
		{
			fl[i]--; fl[i^1]++; Now[x]=i; return 1;
		}
	}
	return Now[x]=0;
}

void flow()
{
	memcpy(Now,h,sizeof(h));
	for (;;)
	{
		calc++;
		if (aug(S)) ans++;else break;
	}
}

bool check()
{
	int tmp=INF;
	for (int i=1;i<=sum;i++) if (vis[i]==calc)
	{
		for (int j=h[i];j;j=nxt[j]) if (fl[j] && vis[e[j]]<calc)
			tmp=min(tmp,f[e[j]]+1-f[i]);
	}
	if (tmp==INF) return 0;
	for (int i=1;i<=sum;i++) if (vis[i]==calc) f[i]+=tmp;
	return 1;
}

int main()
{
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)
	{
		scanf("%s",Map[i]+1);
		for (int j=1;j<=m;j++) if (Map[i][j]!='.')
		{
			In[i][j]=++tot; Out[i][j]=++tot;
			if (Map[i][j]=='S') S=Out[i][j];
			else if (Map[i][j]=='T') T=In[i][j];
		}
	}
	for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) if (Map[i][j]=='S')
	{
		for (int k=1;k<=n;k++) if (Map[k][j]=='T')
		{
			printf("-1\n"); return 0;
		}
		for (int k=1;k<=m;k++) if (Map[i][k]=='T')
		{
			printf("-1\n"); return 0;
		}
	}
	for (int i=1;i<=n;i++) H[i]=++tot; for (int i=1;i<=m;i++) W[i]=++tot;
	sum=tot; tot=1;
	for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) if (Map[i][j]!='.')
	{
		Add(In[i][j],Out[i][j],1); Add(Out[i][j],In[i][j],0);
		Add(Out[i][j],H[i],INF); Add(H[i],Out[i][j],0);
		Add(Out[i][j],W[j],INF); Add(W[j],Out[i][j],0);
		Add(H[i],In[i][j],INF); Add(In[i][j],H[i],0);
		Add(W[j],In[i][j],INF); Add(In[i][j],W[j],0);
	}
	for (flow();check();flow());
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task F - Lotus Leaves
User worldwideD
Language C++14 (GCC 5.4.1)
Score 800
Code Size 2033 Byte
Status AC
Exec Time 6 ms
Memory 1792 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:62:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:65:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",Map[i]+1);
                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 4
AC × 54
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 128 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 128 KB
1_01.txt AC 1 ms 128 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 2 ms 1024 KB
1_06.txt AC 4 ms 1792 KB
1_07.txt AC 1 ms 128 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 1 ms 256 KB
1_10.txt AC 2 ms 512 KB
1_11.txt AC 2 ms 640 KB
1_12.txt AC 1 ms 384 KB
1_13.txt AC 3 ms 640 KB
1_14.txt AC 4 ms 768 KB
1_15.txt AC 3 ms 896 KB
1_16.txt AC 3 ms 512 KB
1_17.txt AC 1 ms 640 KB
1_18.txt AC 2 ms 512 KB
1_19.txt AC 3 ms 768 KB
1_20.txt AC 3 ms 896 KB
1_21.txt AC 1 ms 384 KB
1_22.txt AC 3 ms 896 KB
1_23.txt AC 4 ms 768 KB
1_24.txt AC 1 ms 512 KB
1_25.txt AC 2 ms 896 KB
1_26.txt AC 2 ms 896 KB
1_27.txt AC 3 ms 640 KB
1_28.txt AC 2 ms 512 KB
1_29.txt AC 3 ms 640 KB
1_30.txt AC 1 ms 640 KB
1_31.txt AC 4 ms 896 KB
1_32.txt AC 6 ms 896 KB
1_33.txt AC 1 ms 384 KB
1_34.txt AC 4 ms 768 KB
1_35.txt AC 6 ms 768 KB
1_36.txt AC 3 ms 896 KB
1_37.txt AC 4 ms 896 KB
1_38.txt AC 1 ms 768 KB
1_39.txt AC 6 ms 896 KB
1_40.txt AC 1 ms 256 KB
1_41.txt AC 1 ms 256 KB
1_42.txt AC 1 ms 256 KB
1_43.txt AC 1 ms 256 KB
1_44.txt AC 1 ms 256 KB
1_45.txt AC 1 ms 256 KB
1_46.txt AC 1 ms 256 KB
1_47.txt AC 1 ms 256 KB
1_48.txt AC 1 ms 256 KB
1_49.txt AC 1 ms 256 KB