Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int n,viz[20],i,prim,pi,ps,l[100][100],l1,c1,j,li,ci;
- struct camera
- {
- int l,c;
- } c[30];
- int main()
- { ifstream f("Lee.txt");
- f>>n;
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- f>>l[i][j];
- for(i=0;i<=n+1;i++)
- {l[0][i]=-1;
- l[n+1][i]=-1;
- l[i][0]=-1;
- l[i][n+1]=-1;
- }
- cin>>l1>>c1;
- viz[prim]=1;
- pi=1;
- ps=1;
- c[pi].l=l1;
- c[pi].c=c1;
- while(ps<=pi)
- { li=c[ps].l;
- ci=c[ps].c;
- if(l[li-1][ci]==0&& !(li-1==l1&&c1==ci))
- {
- pi++;
- c[pi].l=li-1;
- c[pi].c=ci;
- l[li-1][ci]=l[li][ci]+1;
- }
- if(l[li][ci-1]==0&& !(li==l1&&c1-1==ci))
- {
- pi++;
- c[pi].l=li;
- c[pi].c=ci-1;
- l[li][ci-1]=l[li][ci]+1;
- }
- if(l[li+1][ci]==0&& !(li+1==l1&&c1==ci))
- {
- pi++;
- c[pi].l=li+1;
- c[pi].c=ci;
- l[li+1][ci]=l[li][ci]+1;
- }
- if(l[li][ci+1]==0&& !(li==l1&&c1+1==ci))
- {
- pi++;
- c[pi].l=li;
- c[pi].c=ci+1;
- l[li][ci+1]=l[li][ci]+1;
- }
- ps++;
- }
- for(i=1;i<=n;i++)
- {for(j=1;j<=n;j++)
- cout<<l[i][j]<<" ";
- cout<<endl;}
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement