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
Submission Time
2018-05-22 17:55:20+0900
Task
F - Lotus Leaves
User
mn3twe
Language
C++14 (GCC 5.4.1)
Score
800
Code Size
1352 Byte
Status
AC
Exec Time
114 ms
Memory
3072 KB
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
Set Name
Sample
All
Score / Max Score
0 / 0
800 / 800
Status
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
256 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
128 KB
1_03.txt
AC
1 ms
128 KB
1_04.txt
AC
1 ms
256 KB
1_05.txt
AC
2 ms
1664 KB
1_06.txt
AC
114 ms
3072 KB
1_07.txt
AC
1 ms
256 KB
1_08.txt
AC
2 ms
1664 KB
1_09.txt
AC
2 ms
3072 KB
1_10.txt
AC
1 ms
640 KB
1_11.txt
AC
5 ms
768 KB
1_12.txt
AC
1 ms
256 KB
1_13.txt
AC
11 ms
1024 KB
1_14.txt
AC
10 ms
1152 KB
1_15.txt
AC
2 ms
1280 KB
1_16.txt
AC
2 ms
640 KB
1_17.txt
AC
1 ms
896 KB
1_18.txt
AC
2 ms
640 KB
1_19.txt
AC
10 ms
1024 KB
1_20.txt
AC
1 ms
1280 KB
1_21.txt
AC
1 ms
384 KB
1_22.txt
AC
2 ms
1280 KB
1_23.txt
AC
6 ms
1024 KB
1_24.txt
AC
1 ms
512 KB
1_25.txt
AC
1 ms
1408 KB
1_26.txt
AC
1 ms
1280 KB
1_27.txt
AC
2 ms
768 KB
1_28.txt
AC
1 ms
640 KB
1_29.txt
AC
4 ms
896 KB
1_30.txt
AC
1 ms
896 KB
1_31.txt
AC
4 ms
1408 KB
1_32.txt
AC
23 ms
1408 KB
1_33.txt
AC
1 ms
384 KB
1_34.txt
AC
2 ms
1152 KB
1_35.txt
AC
10 ms
1152 KB
1_36.txt
AC
2 ms
1280 KB
1_37.txt
AC
19 ms
1408 KB
1_38.txt
AC
1 ms
1152 KB
1_39.txt
AC
19 ms
1408 KB
1_40.txt
AC
1 ms
512 KB
1_41.txt
AC
1 ms
1408 KB
1_42.txt
AC
1 ms
256 KB
1_43.txt
AC
1 ms
896 KB
1_44.txt
AC
1 ms
256 KB
1_45.txt
AC
1 ms
640 KB
1_46.txt
AC
1 ms
512 KB
1_47.txt
AC
1 ms
256 KB
1_48.txt
AC
1 ms
896 KB
1_49.txt
AC
1 ms
1152 KB