模拟赛补题

L1-7 前世档案 (20 分)

比赛用数组模拟了个很蠢的二叉树，数组要开2的30次方（大概在1e9左右），开小了段错误，开大了内存超限，所以最大数据量的点没过。

#include<bits/stdc++.h>
typedef long long ll;
const int N = 1e7+9999999;
using namespace std;
int a[N];
int  main()
{
	int n, m;
	cin >> n >> m;
	int len = pow(2, n + 1);
	for (int i = 1; i <=len; i++)a[i] = i;
	while (m--)
	{
		string s;
		cin >> s;
		int k = 1;
		for (int i = 0; s[i]; i++)
		{
			if (s[i] == 'y')k = k * 2;
			else k = k * 2 + 1;
		}
		cout << a[k]-len/2+1<<endl;
	}
   return 0;
}

 正解（其实就是个二分）

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int  main()
{
	int n, m;
	cin >> n >> m;
	while (m--)
	{
		int l = 1, r = pow(2, n);
		string s;
		cin >> s;
		int i = 0;
		while (s[i])
		{
			int mid = l + r >> 1;
			if (s[i++] == 'y')r = mid;
			else l = mid+1;
		}
		cout << l << endl;
	}
   return 0;
}

L2-3 完全二叉树的层序遍历 

 比赛完全没有思路，因为只写过sdutoj的模板题

 

#include<bits/stdc++.h>
typedef long long ll;
const int N = 1e3;
using namespace std;
int ans[N],a[N],n,idx;
void dfs(int i)
{
	if (i> n)return;
	dfs(i * 2);//dfs左子树
	dfs(i * 2 + 1);//dfs右子树
	ans[i] = a[idx++];
}

int  main()
{
	cin >> n;
	for (int i = 1; i <= n; i++)cin >> a[i];
	idx = 1;
	dfs(1);
	for (int i = 1; i <= n; i++)cout << ans[i] << (i==n?"\n":" ");//顺序输出即为层序遍历结果
    return 0;
}

未完待续