fork download
copy 
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<set>
  14. #include<map>
  15. using namespace std;
  16. //Macro
  17. #define rep(i,a,b)  for(int i=a,tt=b;i<=tt;++i)
  18. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  19. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  20. #define irep(i,x)   for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  21. #define read()  (strtol(ipos,&ipos,10))
  22. #define sqr(x)  ((x)*(x))
  23. #define pb  push_back
  24. #define PS  system("pause");
  25. typedef long long   ll;
  26. typedef pair<int,int> pii;
  27. const int oo=~0U>>1;
  28. const double inf=1e100;
  29. const double eps=1e-6;
  30. string name="ws", in=".in", out=".out";
  31. //Var
  32. queue<int> q;
  33. struct E
  34. {
  35.     int next,node,cap;  
  36. }e[100008];
  37. int h[100008],node[108][108],dis[10008];
  38. int n,m,cnt,ans,st,ed,tot=1;
  39. void add(int a,int b,int c)
  40. {
  41.     e[++tot].next=h[a];e[tot].node=b;e[tot].cap=c;h[a]=tot;
  42.     e[++tot].next=h[b];e[tot].node=a;e[tot].cap=0;h[b]=tot;
  43. }
  44. void Init()
  45. {
  46.     scanf("%d%d",&n,&m);
  47.     rep(i,1,n)rep(j,1,m)node[i][j]=++cnt;
  48.     st=++cnt;ed=++cnt;int a;
  49.     rep(i,1,n)rep(j,1,m)
  50.     {
  51.         if(i!=n)add(node[i][j],node[i+1][j],1);
  52.         if(j!=m)add(node[i][j],node[i][j+1],1);
  53.         if(i!=1)add(node[i][j],node[i-1][j],1);
  54.         if(j!=1)add(node[i][j],node[i][j-1],1);
  55.     }
  56.     rep(i,1,n)rep(j,1,m)
  57.     {
  58.         scanf("%d",&a);
  59.         if(a==1)add(st,node[i][j],oo);
  60.         else if(a==2) add(node[i][j],ed,oo);
  61.     }
  62. }
  63. bool BFS()
  64. {
  65.     memset(dis,-1,sizeof dis);
  66.     dis[ed]=0;q.push(ed);
  67.     int u,v;bool flag=false;
  68.     while(!q.empty())
  69.     {
  70.         u=q.front();q.pop();
  71.         erep(i,e,h[u])
  72.         {
  73.             if(dis[v=e[i].node]!=-1||!e[i^1].cap)continue;
  74.             dis[v]=dis[u]+1;
  75.             if(v==st)flag=true;
  76.             q.push(v);
  77.         }
  78.     }
  79.     return flag;
  80. }
  81. int DFS(int u,int low)
  82. {
  83.     if(u==ed)return low;
  84.     int v,tmp,ret=low;
  85.     erep(i,e,h[u])
  86.     {
  87.         if(dis[v=e[i].node]!=dis[u]-1||!e[i].cap)continue;
  88.         tmp=DFS(v,min(e[i].cap,low));
  89.         e[i].cap-=tmp;
  90.         e[i^1].cap+=tmp;
  91.         low-=tmp;
  92.         if(low==0)break;
  93.     }
  94.     if(ret==low)dis[u]=-1;
  95.     return ret-low;
  96. }
  97. void Work()
  98. {
  99.     int flow;
  100.     while(BFS())
  101.         while(flow=DFS(st,oo))
  102.             ans+=flow;  
  103.     cout<<ans<<endl;
  104. }
  105. int main()
  106. {
  107. //  freopen((name+in).c_str(),"r",stdin);
  108. //  freopen((name+out).c_str(),"w",stdout);
  109.     Init();
  110.     Work();
  111.     return 0;
  112. }
Not running #stdin #stdout 0s 0KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/AiIPD
language:
C++ (gcc 8.3)
created:
12 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!