fork download
copy 
  1. /*
  2. Author : Chandan Agrawal
  3. College : Poornima College of Engg. jaipur, Raj
  4. Mail : chandanagrawal23@gmail.com
  5.  
  6.  
  7. " when you are not practicing someone else is ,
  8.  and the day u meet them u will lose "
  9.  
  10. */
  11. #include<bits/stdc++.h>
  12. #include<stdio.h>
  13. using namespace std;
  14.  
  15. #define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  16. #define MAX 2050
  17.  
  18. #define ll long long
  19. #define ld long double
  20. #define lli  int
  21.  
  22. #define pb push_back
  23. #define INF 1000000000000
  24. #define mod 1000000007
  25.  
  26. // trignometric function always give value in Radians only
  27. #define PI acos(-1) //3.1415926535897932384626433832795028
  28. #define dsin(degree) sin(degree*(PI/180.0))
  29. #define dcos(degree) cos(degree*(PI/180.0))
  30. #define dtan(degree) tan(degree*(PI/180.0))
  31.  
  32. #define rsin(radian) sin(radian)
  33. #define rcos(radian) cos(radian)
  34. #define rtan(radian) tan(radian)
  35.  
  36. #define mem0(a) memset(a,0,sizeof(a))
  37. #define mem1(a) memset(a,-1,sizeof(a))
  38. #define memf(a) memset(a,false,sizeof(a))
  39.  
  40. #define loop(i,n) for (lli i = 0; i < n; i++)
  41. #define FOR(i,a,b) for (lli i = a; i < b; i+=1)
  42.  
  43. #define all(v) v.begin(),v.end()
  44. #define rall(v) v.rbegin(),v.rend()
  45. #define sz(x) int(x.size())
  46. #define F first
  47. #define S second
  48.  
  49. #define mii map<lli,lli>
  50. #define mci map<char,lli>
  51. #define vi vector<lli>
  52. #define vbool vector<bool>
  53. #define seti set<lli>
  54. #define pii pair<lli,lli>
  55. #define pcc pair<char,char>
  56.  
  57. #define gcd(a,b) __gcd((a),(b))
  58. #define lcm(a,b) (a/gcd(a,b))*b
  59. #define abs(x) ((x < 0)?-(x):x)
  60.  
  61. #define endl '\n'
  62.  
  63. template <typename T>
  64. void print(T x){cout<<x<<endl;}
  65. template <typename T1, typename T2>
  66. void print2(T1 x,T2 y){cout<<x<<" "<<y<<endl;}
  67. template <typename T1, typename T2,typename T3>
  68. void print3(T1 x, T2 y,T3 z){cout<<x<<" "<<y<<" "<<z<<endl;}
  69.  
  70. #define scanarr(a,n) for(lli i=0;i<n;i++)    cin>>a[i];
  71. #define scanvec(a,n) for(lli i=0;i<n;i++){ lli x ; cin>>x; a.pb(x);}
  72.  
  73. #define printarr(a,n) for(lli i=0;i<n;i++)   cout<<a[i]<<" "; cout<<endl;
  74. #define printvec(vec) for(auto xt : vec) cout<<xt<<" ";    cout<<"\n";
  75.  
  76. #define FD(N) fixed<<setprecision(N)
  77.  
  78. #define deb(x) cout<<#x<<" "<<x<<endl;
  79.  
  80. // chandan1,2
  81. void chandan1(){int y=1;return;}
  82. void chandan2(){
  83.         loop(i,10){
  84.         lli x=1;
  85.     }
  86.     return(chandan1());
  87. }
  88.  
  89. vi adj[MAX];
  90.  
  91. lli bfs(lli src , lli n)
  92. {
  93.     queue<lli>q;
  94.     bool vis[n+1]={0};
  95.     lli parent[n+1]={0};
  96.     vis[src]=1;
  97.     parent[src]=-1;
  98.     q.push(src);
  99.     while(!q.empty())
  100.     {
  101.         lli u = q.front(); q.pop();
  102.  
  103.         for(auto xt : adj[u])
  104.         {
  105.             if(xt == src)
  106.             {
  107.                 lli cnt = 0;
  108.                 while(u!=-1){
  109.                         cnt++;
  110.                         u = parent[u];
  111.                         //cout<<u<<" ";
  112.                     }
  113.                     return cnt;
  114.             }
  115.             if(!vis[xt])
  116.             {
  117.                 q.push(xt);
  118.                 vis[xt]=1;
  119.                 parent[xt] = u;
  120.             }
  121.         }
  122.     }
  123.     return -1;
  124.  
  125.  
  126. }
  127.  
  128.  
  129. int main(){
  130. fastio
  131. lli t=1;
  132. //cin>>t;
  133. //chandan2();
  134. while(t--) {
  135.     lli n;
  136.     scanf("%d", &n);
  137.     loop(i,n)
  138.     {
  139.         loop(j,n)
  140.         {
  141.             lli x;
  142.             scanf("%d", &x);
  143.             if(x==1)
  144.                 adj[i+1].pb(j+1);
  145.         }
  146.     }
  147.  
  148.     for(lli i=1;i<=n;i++)
  149.     {
  150.         lli val = bfs(i,n);
  151.         if(val==-1)
  152.             printf("NO WAY\n");
  153.         else
  154.             printf("%d\n", val);;
  155.  
  156.     }
  157.  
  158.  
  159.  
  160.   }
  161. return 0;
  162. }
  163.  
Success #stdin #stdout 0s 4564KB
comments (?)
stdin
copy 
5
0 1 1 1 1
1 0 0 0 1
0 0 1 1 0
0 0 1 0 0
0 0 0 1 0
stdout
copy 
2
2
1
2
NO WAY
https://ideone.com/2vft6k
language:
C++14 (gcc 8.3)
created:
5 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!