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="", in=".in", out=".out";
  31. //Var
  32. struct E
  33. {
  34.     int next,node,cap;
  35. }e[400008];
  36. queue<int> q;
  37. int h[1008],map[28][28],node[28][28],dis[1008];
  38. bool s[28][28];
  39. int n,m,d,tot=1,cnt,ans,st,ed;
  40. inline bool CanOut(int x,int y){return x+d>n||x-d<1||y+d>m||y-d<1;}
  41. inline bool Dis(int x1,int y1,int x2,int y2){return abs(x1-x2)+abs(y1-y2)<=d;}
  42. void add(int a,int b,int c)
  43. {
  44.     e[++tot].next=h[a];e[tot].node=b;e[tot].cap=c;h[a]=tot;
  45.     e[++tot].next=h[b];e[tot].node=a;e[tot].cap=0;h[b]=tot;
  46. }
  47. void Init()
  48. {
  49.     cin>>n>>m>>d;
  50.     char ch;
  51.     int size=n*m;st=size*2+1;ed=size*2+2;
  52.     rep(i,1,n)rep(j,1,m)node[i][j]=++cnt;
  53.     rep(i,1,n)rep(j,1,m)
  54.     {
  55.         cin>>ch;
  56.         map[i][j]=ch-'0';
  57.         if(ch-'0')add(node[i][j],size+node[i][j],map[i][j]);
  58.     }
  59.     rep(i,1,n)rep(j,1,m)
  60.     {
  61.         cin>>ch;
  62.         if(ch=='L')
  63.         {
  64.             add(st,node[i][j],1);
  65.             ans++;
  66.         }
  67.     }
  68.     rep(i,1,n)rep(j,1,m)if(map[i][j]&&CanOut(i,j))add(size+node[i][j],ed,oo);
  69.     rep(i,1,n)rep(j,1,m)
  70.     {
  71.         rep(k,1,n)rep(l,1,m)
  72.         {
  73.             if((i!=k||j!=l)&&map[i][j]&&map[k][l]&&Dis(i,j,k,l))
  74.                 add(size+node[k][l],node[i][j],oo);
  75.         }
  76.     }
  77. }
  78. bool BFS()
  79. {
  80.     q.push(ed);
  81.     memset(dis,-1,sizeof dis);
  82.     dis[ed]=0;int u,v;bool flag=0;
  83.     while(!q.empty())
  84.     {
  85.         u=q.front();q.pop();
  86.         erep(i,e,h[u])
  87.         {
  88.             if(dis[v=e[i].node]==-1&&e[i^1].cap)
  89.             {
  90.                 dis[v]=dis[u]+1;
  91.                 q.push(v);
  92.                 if(v==st)flag=true;
  93.             }   
  94.         }
  95.     }
  96.     return flag;
  97. }
  98. int DFS(int u,int low)
  99. {
  100.     if(u==ed)return low;
  101.     int ret=low,v,tmp;
  102.     erep(i,e,h[u])
  103.     {
  104.         if(dis[v=e[i].node]==dis[u]-1&&e[i].cap)
  105.         {
  106.             tmp=DFS(v,min(low,e[i].cap));
  107.             e[i].cap-=tmp;
  108.             e[i^1].cap+=tmp;
  109.             low-=tmp;
  110.             if(low==0)break;
  111.         }
  112.     }
  113.     if(ret==low)dis[u]=-1;
  114.     return ret-low;
  115. }
  116. void Work()
  117. {
  118.     int flow;
  119.     while(BFS())
  120.         while(flow=DFS(st,oo))
  121.             ans-=flow;
  122.     cout<<ans<<endl;
  123. }
  124. int main()
  125. {
  126. //  freopen((name+in).c_str(),"r",stdin);
  127. //  freopen((name+out).c_str(),"w",stdout);
  128.     Init();
  129.     Work();
  130.     return 0;
  131. }
  132. 
Not running #stdin #stdout 0s 0KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/x7X0e
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!