codeforces 897C. Nephren gives a riddle（DFS）

题意：有这样一个函数

f(0) = What are you doing at the end of the world? Are you busy? Will you save us?
f(i)  = What are you doing while sending "f(i-1)"? Are you busy? Will you send "f(i-1)"?

有q次询问，每次问f(n)的第K个字符是什么，如果f(n)的长度小于k则输出一个'.'

思路：DFS，容易发现这是一个递归的过程，我们可以认为：f(i) = a + f(i-1) + b + f(i-1) + c。如果k大于f(n)的长度直接输出'.'，否则进行深搜。深搜传两个参数n，k表示该字符在f(n)的k位置，对于当前情况N,K共有六种情况

k > 0时，

①属于a段 ②属于第一个f(n-1)位置③属于b段④属于第二个f(n-1)段⑤属于c段

k == 0时，⑥属于f(0)段

注意用long long。f(n)的长度会超long long，超的时候赋一个超过K的值就行。

#include<bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 5;
const int MAXN = 1e5 + 5;

string f0 = "What are you doing at the end of the world? Are you busy? Will you save us?";
//f(i) = What are you doing while sending "f(i-1)"? Are you busy? Will you send "f(i-1)"?
string a = "What are you doing while sending \"";
string b = "\"? Are you busy? Will you send \"";
string c = "\"?";
//f(i) = a + f(i-1) + b + f(i-1) + c
int lenf0 = f0.length(), lena = a.length(), lenb = b.length(), lenc = c.length();

long long q, n, k, len_f[MAXN];
void init()//预处理出来f(n)的长度 ，但是注意可能会超long long ，此时令其等于k的最大值就行 
{
	len_f[0] = lenf0;
	for(int i = 1; i < MAXN; i++)
	{
	    if (len_f[i - 1] >= INF) { len_f[i] = INF; continue; }
		len_f[i] = lena + len_f[i - 1] + lenb + len_f[i - 1] + lenc;
	}
}
void work(long long n, long long k)//f(n)的第k个字符 
{
	if(n == 0){ printf("%c",f0[k - 1]); return ; };//属于f(0) 
	if(k <= lena) printf("%c",a[k - 1]);//f(i)的a段 
	else if(k <= lena + len_f[n - 1]) work(n - 1,k - lena);//f(i)第一个的f(i-1)段 
	else if(k <= lena + len_f[n - 1] + lenb) printf("%c",b[k - lena - len_f[n - 1] - 1]);//f(i)的b段 
	else if(k <= lena + len_f[n - 1] + lenb + len_f[n - 1]) work(n - 1,k - lena - len_f[n-1] - lenb);//f(i)第二个的f(i-1)段 
	else if(k <= lena + len_f[n - 1] + lenb + len_f[n - 1] + lenc) printf("%c",c[k - lena - len_f[n - 1] - lenb - len_f[n - 1] - 1]);//f(i)的c段 
}
int main()
{
	init();
	while(~scanf("%lld",&q))
	{
		while(q--)
		{
			scanf("%lld%lld",&n, &k);
			if(len_f[n] < k) printf(".");
			else work(n,k);
		}
		printf("\n");
	}
	return 0;
}