SGU 518 Kidnapping BFS，暴力

Berland's Police has a serious problem. A foreign ambassador arrived to Berland with an important mission, and his daughter was kidnapped just from the Royal Palace! Inspired by adventures of Erast Fandorin, the Police Chief developed the following ingenious plan.

The ambassador agrees to pay ransom, but only if the kidnappers allow his servant to visit the girl and ensure that she is alive. The kidnappers take the blindfolded servant into a coach and transport him to the secret place, where they keep the ambassador's daughter. Certainly, the role of the servant is certainly played by a secret agent of the Police. The Police Chief knows that when the coach is moving, the wheels are creaking once on each full rotation. So, by counting the number of creaks and multiplying it by the length of the rim, one can easily calculate the distance covered by the coach.

In spite of this brilliant idea, the affair turned to be much more difficult than it could be in a detective story. There are n intersections in the city numbered from 1 to n, some pairs of intersections are connected by bidirectional roads. The kidnappers agreed to take the "servant" to the secret place, and the servant is quite sure that this place is located at one of the intersections. Also the agent has calculated the lengths of roads between each pair of consecutive intersections on the route passed by the coach. But during the trip the agent was concentrated on counting creaks, so he could not remember in which directions the coach turned at the intersections.

Now the route probably couldn't be restored uniquely! Moreover, the agent has a suspicion that the kidnappers could intentionally pass the same intersection or even the same road more than once to confuse the Police.

Your task is to determine all possible locations of the secret place, given that the trip starts at the intersection number 1.

Input

The first line of the input contains a single integer n (2 ≤ n ≤ 200). Each of the next n lines contains n integers each. The i-th number in the j-th line l_ij is the length of the road between the i-th and the j-th intersections. If l_ij = 0 then the road doesn't exist.

It is guaranteed that 0 ≤ l_ij ≤ 200, l_ii = 0 and l_ij = l_ji. The next line contains one integer k (1 ≤ k ≤ 200) — the number of roads passed by the couch. The following line contains k integers r₁, r₂, ..., r_k (1 ≤ r_i ≤ 200) — the lengths of roads between each pair of consecutive intersections on the route passed by the coach from the starting point to the secret place.

Output

To the first line of the output write m — the number of all possible locations of the secret place. The second line should contain the numbers of intersections in increasing order separated by spaces.

If there are no possible locations of the secret place, the output must contain the only integer 0.

Example

Input

4
0 1 2 0
1 0 1 0
2 1 0 2
0 0 2 0
3
1 1 2

Output

3
1 3 4

题意，给一个邻接矩阵，然后给一条规定路径，从1出发，依次走过1 3 4，最后可能的终点在哪，这样就能发现小偷的。

果断用dfs，用pair类型，（结构体也行，），分别记录层数和顶点数，然后就好了，第一次见到了bfs可以这样用，不管加什么条件，都不能阻碍搜索的进程，而应该设置一个变量来记录，记录对自己有用的东西

还有一种方法，就是果断暴力，因为数据是有限制的，所以直接暴力即刻。

1 bfs

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <utility>
#include <queue>
#include <cstring>
using namespace std;
const int maxn=300;
queue<pair<int,int> >q;
int dis[maxn][maxn];
vector <int>G[maxn];
int vis[maxn];
int keep[maxn];
int kind;
int k;
int has[maxn][maxn];
int m;
//二维的dfs；
void BFS()
{   memset(has,0,sizeof(has));
    memset(vis,0,sizeof(vis));
    kind=0;
     has[1][0]=1;
     q.push(make_pair(1,0));
     while(!q.empty())
     {   int u=q.front().first;//顶点数，
         int deep=q.front().second;//层数
         q.pop();
         if(deep!=k)
         {  for(int i=0;i<G[u].size();i++)
            {   if(dis[u][G[u][i]]==keep[deep+1]&&!has[G[u][i]][deep+1])
                {  q.push(make_pair(G[u][i],deep+1));
                   has[G[u][i]][deep+1]=1;
                }
            }
         }
         else
         {
             vis[u]=1;
         }
     }
      int all=0;
    for(int i=1;i<=m;i++)
    {  if(vis[i])
         all++;




    }
    printf("%d\n",all);
    for(int i=1;i<=m;i++)
    {   if(vis[i])
       printf("%d ",i);


    }
printf("\n");




}
int main()
{   freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);




   cin>>m;
   for(int i=1;i<=m;i++) G[i].clear();
    for(int i=1;i<=m;i++)
        for(int j=1;j<=m;j++)
        {scanf("%d",&dis[i][j]);
           if(dis[i][j])
            G[i].push_back(j);


        }
     scanf("%d",&k);
    for(int i=1;i<=k;i++)
        scanf("%d",&keep[i]);
    BFS();


    return 0;
}

2 暴力

#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
const int maxn=200;
int G[maxn][maxn];
int dp[maxn][maxn];
int vim[maxn];
int lu[maxn];
int main()
{    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    
    int m;
  cin>>m;
  for(int i=1;i<=m;i++)
    for(int j=1;j<=m;j++)
    scanf("%d",&G[i][j]);
    int k;
    int c=0;
   scanf("%d",&k);
    for(int i=1;i<=k;i++)
     scanf("%d",&lu[i]);
      dp[0][1]=1;
     for(int i=1;i<=k;i++)
     {   for(int j=1;j<=m;j++)
          {  if(dp[i-1][j])
             {  for(int l=1;l<=m;l++)
                {   if(G[j][l]==lu[i])
                    dp[i][l]=1;


                }


             }




          }
          for(int x=1;x<=m;x++)
          {   if(dp[k][x])
               {vim[x]=1;
                 c++;
               }
          }






     }
       printf("%d\n",c);
     for(int i=1;i<=m;i++)
     {  if(vim[i])
        printf("%d ",i);




     }
        printf("\n");










    return 0;
}