11582022-03-15 15:02:30vandrasKígyózó szavakcpp14Accepted 100/1008ms2540 KiB
#include <bits/stdc++.h>
using namespace std;

/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

tem T>
string _ARR_(T* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array

const ll INF = 1e9+7;

ll n, h, dp[26][1001];

void add(ll &a, ll b){
	if(b == INF || a == INF) a = INF;
	else{
		a += b;
		if(a >= INF) a = INF;
	}
}

int main()
{
	FAST;
	cin >> h >> n;
	//dp[i][j] : number of words starting with char i of length j or shorter

	for(int i = 0; i < 26; ++i) dp[i][1] = 1;

	for(int j = 2; j <= h; ++j){
		for(int i = 0; i < 26; ++i){
			if(i) add(dp[i][j], dp[i-1][j-1]);
			if(i < 25) add(dp[i][j], dp[i+1][j-1]);
			add(dp[i][j], 1);
		}
	}

	while(n--){
		int x; cin >> x;
		string ans;
		int len = h, lst;

		for(int i = 0; i < 26; ++i){
			if(x - dp[i][len] > 0) x-= dp[i][len];
			else{
				ans.pb('a'+i);		
				lst = i;
				--len;
				break;
			}
		}
		debug() << exp(ans) exp(x) exp(len) exp(dp[0][3]) exp(dp[1][3]);

		while(x){
			--x;
			if(x == 0) break;
			debug() << exp(x);
			for(int i = 0; i < 26; ++i){
				if(abs(lst-i) == 1){
					debug() << exp(dp[i][len]) exp(char('a'+i)) exp(len);
					if(x - dp[i][len] > 0) x -= dp[i][len];
					else{
						ans.pb('a' + i);
						lst = i;
						--len;
						break;
					}
				}
			}
		}
		cout << ans << '\n';

	}

	return 0;
}
SubtaskSumTestVerdictTimeMemory
base100/100
1Accepted0/02ms1924 KiB
2Accepted0/01ms2036 KiB
3Accepted5/51ms2100 KiB
4Accepted5/51ms2008 KiB
5Accepted5/51ms2000 KiB
6Accepted5/51ms2020 KiB
7Accepted5/51ms2040 KiB
8Accepted5/51ms2128 KiB
9Accepted5/54ms2344 KiB
10Accepted5/54ms2316 KiB
11Accepted5/54ms2412 KiB
12Accepted5/54ms2432 KiB
13Accepted5/58ms2472 KiB
14Accepted6/63ms2328 KiB
15Accepted6/64ms2464 KiB
16Accepted6/64ms2396 KiB
17Accepted6/63ms2380 KiB
18Accepted7/73ms2376 KiB
19Accepted7/78ms2540 KiB
20Accepted7/74ms2432 KiB