2010-2011 ACM-ICPC, NEERC, Southern Subregional Contest E - Kidnapping(滚动数组+dfs)

E. Kidnapping

time limit per test

1.0 s

memory limit per test

256 MB

input

input.txt

output

output.txt

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 lij is the length of the road between the i-th and the j-th intersections. If lij = 0 then the road doesn't exist.

It is guaranteed that 0 ≤ lij ≤ 200, lii = 0 and lij = lji. The next line contains one integer k (1 ≤ k ≤ 200) — the number of roads passed by the couch. The following line contains k integers r1, r2, ..., rk (1 ≤ ri ≤ 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.

Examples

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到N个点的路径长度二维数组，现在要求从1点开始，按照所给出的要求，走要求的路径长度，按照字典序最小输出终点个数

解题思路:这道题用滚动数组，按照他所说的要求依次遍历即可

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
using namespace std;
typedef long long LL;

vector<int> qua[5];
vector<int> tu[205],cost[205];
int l,i,n,j,x,m,cnt,k;
bool vis[205];
int b[205];
int main()
{
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
	cin>>n;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			cin>>x;
			if(i==j||x==0) continue;
			tu[i].push_back(j);
			cost[i].push_back(x);
		}
	}
	cin>>m;
	for(i=1;i<=m;i++) cin>>b[i];
	cnt=0;
	qua[cnt].push_back(1);
	for(i=1;i<=m;i++)
	{
		qua[cnt ^ 1].clear();
		memset(vis,0,sizeof(vis));
		for(j=0;j<qua[cnt].size();j++)
		{
			x=qua[cnt][j];
			for(l=0;l<tu[x].size();l++)
			{
				k=tu[x][l];
				if(cost[x][l]==b[i]&&!vis[k])
				{
					vis[k]=1;
					qua[cnt ^ 1].push_back(k);
				}
			}
		}
		cnt ^=1;
	}
	sort(qua[cnt].begin(),qua[cnt].end());
	cout<<qua[cnt].size()<<endl;
	for(i=0;i<qua[cnt].size();i++)
	{
		if(i==qua[cnt].size()-1)
			cout<<qua[cnt][i]<<endl;
		else
			cout<<qua[cnt][i]<<" ";
	}
	return 0;
}