2019暑期集训牛客多校10-B.Coffee Chicken
思路
s[1]=“COFFEE”,s[2]=“CHICKEN”,s[i]=s[i-2]+s[i-1],有T次询问,每次询问输入n、k,表示在s[n]中输出从第k个字符开始紧接连续的10个字符的子串,不足10个则尽量多的输出。
很显然,s[i]是由s[i-2]和s[i-1]前后相连组成的串,若是s[i-2]的长度小于k,则k=k-|s[i-2]|,在s[i-1]里面找目标子串,若是s[i-2]的长度大于等于k,则目标子串可能全部在s[i-2]内,可能一部分在s[i-2]、一部分在s[i-1]内。一步步递推过去就行了。
题解
#include<bits/stdc++.h>
using namespace std;
long long s[600];
char a[3][100]={"0","0COFFEE","0CHICKEN"};
void dfs(int n,long long k)
{
if(n<=2)
{
printf("%c",a[n][k]);
return;
}
if(s[n-2]<k)dfs(n-1,k-s[n-2]);
if(s[n-2]>=k)dfs(n-2,k);
}
int main()
{
s[1]=6;
s[2]=7;
for(int i=3;i<=70;i++)
s[i]=s[i-2]+s[i-1];
for(int i=71;i<=500;i++)
s[i]=s[70];
int T;
cin>>T;
while(T--)
{
int n;
long long k;
cin>>n>>k;
if(n<=2)
{
for(int i=0;i<min(1ll*10,s[n]-k+1);i++)
cout<<a[n][k+i];
cout<<endl;
}
else
{
for(int i=0;i<min(1ll*10,s[n]-k+1);i++)
dfs(n,i+k);
cout<<endl;
}
}
}
许老师用栈模拟dfs代码
#include<bits/stdc++.h>
#define ll long long
#define pi pair<int, ll>
#define mk make_pair
using namespace std;
char s[2][10] = {"0COFFEE", "0CHICKEN"};
ll d[500], N = 1e14;
/*
d[49] = 51479979270
d[50] = 83296356199
d[51] = 134776335469
d[52] = 218072691668
d[53] = 352849027137
*/
stack<pi> sta;
int main() {
d[1] = 6;
d[2] = 7;
for (int i = 3; d[i - 1] <= N; i++) {
d[i] = d[i - 1] + d[i - 2];
//printf("d[%d] = %lld\n", i, d[i]);
}
int T, n;
scanf("%d", &T);
while (T--) {
ll k;
scanf("%d%lld", &n, &k);
sta.push(mk(n, k));
int cnt = 10;
while (!sta.empty() && cnt) {
pi tmp = sta.top();
sta.pop();
n = tmp.first;
k = tmp.second;
if (n <= 2) {
int len = min(1ll * cnt, d[n] - k + 1);
for (int i = 0; i < len; i++)
printf("%c", s[n - 1][i + k]);
cnt -= len;
continue;
}
if (k > d[n - 2])
sta.push(mk(n - 1, k - d[n - 2]));
else {
if (d[n - 2] - k + 1 < cnt)
sta.push(mk(n - 1, 1));
sta.push(mk(n - 2, k));
}
}
while (!sta.empty())
sta.pop();
puts("");
}
}