习题6-2 S树（S-Trees, UVa 712）

再水一发。。

#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define LL long long
#define maxn 100005
#define maxm 1005
#define mod 1000000007
#define INF 1000000007
#define eps 1e-5
#define PI 3.1415926535898
#define N 26
using namespace std;
//-------------------------CHC------------------------------//
struct Node {
	char val;
	int idx;
	bool operator<(const Node rhs) const {
		return idx < rhs.idx;
	}
}node[maxn];
char s[maxn];
char tree[maxn];

void query(int n) {
	int pos = 1;
	for (int i = 0; i < n; ++i) {
		if (node[i].val == '0') pos <<= 1;
		else pos = pos << 1 | 1;
		//printf("pos = %d\n", pos);
	}
	putchar(tree[pos - (1<<n)]);
}

int main() {
	//IN(); OUT();
	int n, kase = 1;
	while (scanf("%d", &n) && n) {
		for (int i = 0; i < n; ++i)
			scanf("%s", s), node[i].idx = s[1] - '0';
		scanf("%s", tree);
		int q;
		scanf("%d", &q);
		printf("S-Tree #%d:\n", kase++);
		while (q--) {
			scanf("%s", s);
			for (int i = 0; i < n; ++i) node[i].val = s[i];
			sort(node, node + n);
			query(n);
		}
		puts("\n");
	}
	return 0;
}