S-Trees

最新推荐文章于 2018-08-25 20:48:48 发布

起个名字怎么就这么难

最新推荐文章于 2018-08-25 20:48:48 发布

阅读量320

点赞数

本文链接：https://blog.csdn.net/baidu_22079207/article/details/47787685

版权

S-Trees

Description

A Strange Tree (S-tree) over the variable set $X_n = \{x_1, x_2, \dots, x_n\}$ is a binary tree representing a Boolean function $f: \{0, 1\}^n \rightarrow \{ 0, 1\}$ . Each path of the S-tree begins at the root node and consists of n+1 nodes. Each of the S-tree's nodes has a depth, which is the amount of nodes between itself and the root (so the root has depth 0). The nodes with depth less than n are called non-terminal nodes. All non-terminal nodes have two children: the right child and the left child. Each non-terminal node is marked with some variable x_i from the variable set X_n. All non-terminal nodes with the same depth are marked with the same variable, and non-terminal nodes with different depth are marked with different variables. So, there is a unique variable x_i₁ corresponding to the root, a unique variable x_i₂ corresponding to the nodes with depth 1, and so on. The sequence of the variables $x_{i_1}, x_{i_2}, \dots, x_{i_n}$ is called the variable ordering. The nodes having depth n are called terminal nodes. They have no children and are marked with either 0 or 1. Note that the variable ordering and the distribution of 0's and 1's on terminal nodes are sufficient to completely describe an S-tree.

As stated earlier, each S-tree represents a Boolean function f. If you have an S-tree and values for the variables $x_1, x_2, \dots, x_n$ , then it is quite simple to find out what $f(x_1, x_2, \dots, x_n)$ is: start with the root. Now repeat the following: if the node you are at is labelled with a variable x_i, then depending on whether the value of the variable is 1 or 0, you go its right or left child, respectively. Once you reach a terminal node, its label gives the value of the function.

Figure 1: S-trees for the function $x_1 \wedge (x_2 \vee x_3)$

On the picture, two S-trees representing the same Boolean function, $f(x_1, x_2, x_3) = x_1 \wedge (x_2 \vee x_3)$ , are shown. For the left tree, the variable ordering is x₁, x₂, x₃, and for the right tree it is x₃, x₁, x₂.

The values of the variables $x_1, x_2, \dots, x_n$ , are given as a Variable Values Assignment (VVA)

$\begin{displaymath}(x_1 = b_1, x_2 = b_2, \dots, x_n = b_n) \end{displaymath}$

with $b_1, b_2, \dots, b_n \in \{0,1\}$ . For instance, ( x ₁ = 1, x ₂ = 1 x ₃ = 0) would be a valid VVA for n = 3, resulting for the sample function above in the value $f(1, 1, 0) = 1 \wedge (1 \vee 0) = 1$ . The corresponding paths are shown bold in the picture.

Your task is to write a program which takes an S-tree and some VVAs and computes $f(x_1, x_2, \dots, x_n)$ as described above.

Input

The input file contains the description of several S-trees with associated VVAs which you have to process. Each description begins with a line containing a single integer n, $1 \le n \le 7$ , the depth of the S-tree. This is followed by a line describing the variable ordering of the S-tree. The format of that line is x i ₁ x i ₂ ... x i _n. (There will be exactly n different space-separated strings). So, for n = 3 and the variable ordering x ₃, x ₁, x ₂, this line would look as follows:

x3 x1 x2

In the next line the distribution of 0's and 1's over the terminal nodes is given. There will be exactly 2ⁿ characters (each of which can be 0 or 1), followed by the new-line character. The characters are given in the order in which they appear in the S-tree, the first character corresponds to the leftmost terminal node of the S-tree, the last one to its rightmost terminal node.

The next line contains a single integer m, the number of VVAs, followed by m lines describing them. Each of the m lines contains exactly n characters (each of which can be 0 or 1), followed by a new-line character. Regardless of the variable ordering of the S-tree, the first character always describes the value of x₁, the second character describes the value of x₂, and so on. So, the line

110

corresponds to the VVA ( x₁ = 1, x₂ = 1, x₃ = 0).

The input is terminated by a test case starting with n = 0. This test case should not be processed.

Output

For each S-tree, output the line `` S-Tree # j :", where j is the number of the S-tree. Then print a line that contains the value of $f(x_1, x_2, \dots, x_n)$ for each of the given m VVAs, where f is the function defined by the S-tree.

Output a blank line after each test case.

Sample Input

Sample Output

S-Tree #1:
0011

S-Tree #2:
0011

Miguel A. Revilla
2000-02-09

大意：

给出一个完全深度为n+1的完全二叉树，并给出所有叶子的值；

现在给出几组命令，0代表向左走，1代表向右走，求出最后所到的叶子的值；

要点：

构造完全二叉树，递归求值；

代码：

#include <iostream>
#include <string>
using namespace std;

int cou, ans[1024];

struct node{
	char data;
	node *left;
	node *right;
	node(char d = 3, node *l = 0, node *r = 0) :data(d), left(l), right(r){}
};

void build(string str, int depth, node *t){
	if (depth > 0){
		t->left = new node(3, 0, 0);
		build(str, depth - 1, t->left);
		t->right = new node(3, 0, 0);
		build(str, depth - 1, t->right);
	}
	if (depth == 0){
		t->data = str[cou++];
	}
}

void serch(int cur, string com, node *t, int i){
	if (t->data == '0' || t->data == '1'){
		ans[i] = t->data - '0';
		return;
	}
	if (com[cur] == '0'){
		serch(cur + 1, com, t->left, i);
	}
	else{
		serch(cur + 1, com, t->right, i);
	}
}

int main(){
	int depth;
	string str, x;
	int j = 1;
	while (cin >> depth && depth != 0){
		for (int i = 0; i < depth; i++)
			cin >> x;
		cin >> str;
		node tree(3, 0, 0);
		cou = 0;
		build(str, depth, &tree);
		int comnum;
		cin >> comnum;
		for (int i = 0; i < comnum; i++){
			string com;
			cin >> com;
			serch(0, com, &tree, i);
		}
		cout << "S-Tree #" << j++ << ":" << endl;
		for (int i = 0; i < comnum; i++)
			cout << ans[i];
		cout << endl << endl;
	}
	return 0;
}