2019暑假牛客第10场-B-Coffee Chicken-递归搜索-签到题

最新推荐文章于 2019-10-30 23:48:05 发布

Mavis code

最新推荐文章于 2019-10-30 23:48:05 发布

阅读量184

点赞数

分类专栏：优雅的暴力

本文链接：https://blog.csdn.net/pythonbanana/article/details/99703884

版权

优雅的暴力专栏收录该内容

4 篇文章

订阅专栏

题面：
在这里插入图片描述

思路：
对于每一个字母都递归搜索，因为只有10个字母所以没关系。
我想太复杂了，就是一次将10个字母全部找出来。
简单递归·代码：

#include<bits/stdc++.h>
#define per(i,a,b) for(int i = (a);i <= (b);++i)
#define rep(i,a,b) for(int i = (a);i >= (b);--i)
#define INF 1e18
using namespace std;
typedef long long LL;
const int maxn = 5e2 + 10;
int n = 0,m = 0;
LL k = 0;
LL f[maxn];
char s1[7] = "COFFEE",s2[8] = "CHICKEN";
void pre_solve(){
	memset(f,-1,sizeof(f));
	f[1] = 6;f[2] = 7;
	per(i,3,500){
		f[i] = f[i-2] + f[i-1];
		if(f[i] > 1e12){
			break;
		}
	}
}
void dfs(int depth,LL pos){
	if(depth == 1){
		printf("%c",s1[pos-1]);
		return ;
	}
	if(depth == 2){
		printf("%c",s2[pos-1]);
		return ;
	}
	if(pos <= f[depth-2] || f[depth-2] == -1){
		dfs(depth-2,pos);
	}else{
		dfs(depth-1,pos - f[depth-2]);
	}
}
int main(){
	// ios::sync_with_stdio(false);
	// cin.tie(0);cout.tie(0);
	pre_solve();
	int T = 0;
	scanf("%d",&T);
	while(T--){
		scanf("%d %lld",&n,&k);
		for(LL i = k;i < k+10;++i){
			if(f[n] != -1 && i > f[n]){
				break;
			}
			dfs(n,i);
		}
		puts("");
	}
	return 0;
}

复杂，非递归代码：

#include<bits/stdc++.h>
#define per(i,a,b) for(int i = (a);i <= (b);++i)
#define rep(i,a,b) for(int i = (a);i >= (b);--i)
#define INF 1e18
using namespace std;
typedef long long LL;
const int maxn = 5e2 + 10;
int n = 0,m = 0;
LL k = 0;
string s1 = "COFFEE",s2 = "CHICKEN";
string s3;
string str1 = "COFFEE",str2 = "CHICKEN";
int pos = 0,loc = 0;
LL f[maxn];
LL gi(){
    char a=getchar();LL b=0;
    while(a<'0'||a>'9')a=getchar();
    while(a>='0'&&a<='9')b=b*10+a-'0',a=getchar();
    return b;
}
int gi2(){
    char a=getchar();int b=0;
    while(a<'0'||a>'9')a=getchar();
    while(a>='0'&&a<='9')b=b*10+a-'0',a=getchar();
    return b;
}
void pre_solve(){

	memset(f,0,sizeof(f));
	f[1] = 6; f[2] = 7;
	pos = 0,loc = 0;
	per(i,3,500){
		f[i] = f[i-1] + f[i-2];
		if(f[i] > 1e12){
			pos = i;
			break;
		}
	}
}
void solve(){
	s1 = "COFFEE";s2 = "CHICKEN";
	int i = n;
	LL tmp = f[n];
	while(f[i] > 1e6 && k > 0){
		if(f[i-2] < k){
			k -= f[i-2];
			tmp -= f[i-2];
			i = i - 1;
		}else{
			i = i-2;
		}
	}
	if(k > f[i]){//这个要加上，否则会输出空，判定为超时
		++i;
	}
	per(j,3,i){
		s3 = s1 + s2;
		s1 = s2; s2 = s3;
	}
	bool fg = true;
	for(int j = k;j < k+10 && j <= tmp;++j){
		printf("%c",s3[j-1]);
		fg = false;
	}
	puts("");
}
int main(){
	// std::ios::sync_with_stdio(false);
	// cin.tie(0);cout.tie(0);
	pre_solve();
	int T = 0;
	scanf("%d",&T);
	while(T--){
		// scanf("%d %lld",&n,&k);
		n = gi2(); k = gi();
		if(n == 1){
			per(i,k-1,6-1){
				printf("%c",str1[i]);
			}
			puts("");
			continue;
		}else if(n == 2){
			per(i,k-1,7-1){
				printf("%c",str2[i]);
			}
			puts("");
			continue;
		}
		if(f[n] == 0){
			n = pos;
		}
		solve();
	}

	return 0;
}