#include<cstdio> #include<algorithm> #include<ctime> #include<cstring> #include<iostream> #include<cstdlib> #include<cmath> #include<vector> #include<map> #include<set> #include<queue> #include<bitset> using namespace std; typedef long long ll; typedef double db; const db pi=acos(-1); void gn(int &x){ int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-'); if(c=='-')sg=-1,x=0;else x=c-'0'; while((c=getchar())>='0'&&c<='9')x=x*10+c-'0'; x*=sg; } void gn(ll &x){ int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-'); if(c=='-')sg=-1,x=0;else x=c-'0'; while((c=getchar())>='0'&&c<='9')x=x*10+c-'0'; x*=sg; } int gcd(int a,int b){return b?gcd(b,a%b):a;} int n,c,r; char s[205][205]; int g[205][205]; int a[205]; int b[205]; inline int test(){ for (int i=c+1;i<=n;i++)if(a[i])return 0; return 1; } int main() { scanf("%d%d%d",&n,&c,&r); for (int i=1;i<=n;i++)scanf("%s",s[i]+1); for (int i=1;i<=n;i++) for (int j=1;j<=n;j++)g[i][j]=s[i][j]-'0'; while(r--){ int x;scanf("%d",&x); a[x]=1; } for (int k=0;k<=1000;k++){ if(test()){ printf("%d\n",k); return 0; } for (int i=1;i<=n;i++)b[i]=0; for (int i=1;i<=n;i++)if(a[i]) for (int j=1;j<=n;j++)b[j]|=g[i][j]; for (int i=1;i<=n;i++)a[i]=b[i]; } printf("-1\n"); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 | #include<cstdio> #include<algorithm> #include<ctime> #include<cstring> #include<iostream> #include<cstdlib> #include<cmath> #include<vector> #include<map> #include<set> #include<queue> #include<bitset> using namespace std; typedef long long ll; typedef double db; const db pi=acos(-1); void gn(int &x){ int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-'); if(c=='-')sg=-1,x=0;else x=c-'0'; while((c=getchar())>='0'&&c<='9')x=x*10+c-'0'; x*=sg; } void gn(ll &x){ int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-'); if(c=='-')sg=-1,x=0;else x=c-'0'; while((c=getchar())>='0'&&c<='9')x=x*10+c-'0'; x*=sg; } int gcd(int a,int b){return b?gcd(b,a%b):a;} int n,c,r; char s[205][205]; int g[205][205]; int a[205]; int b[205]; inline int test(){ for (int i=c+1;i<=n;i++)if(a[i])return 0; return 1; } int main() { scanf("%d%d%d",&n,&c,&r); for (int i=1;i<=n;i++)scanf("%s",s[i]+1); for (int i=1;i<=n;i++) for (int j=1;j<=n;j++)g[i][j]=s[i][j]-'0'; while(r--){ int x;scanf("%d",&x); a[x]=1; } for (int k=0;k<=1000;k++){ if(test()){ printf("%d\n",k); return 0; } for (int i=1;i<=n;i++)b[i]=0; for (int i=1;i<=n;i++)if(a[i]) for (int j=1;j<=n;j++)b[j]|=g[i][j]; for (int i=1;i<=n;i++)a[i]=b[i]; } printf("-1\n"); return 0; } |