結果

問題 No.3290 Encrypt Failed, but Decrypt Succeeded
コンテスト
ユーザー 👑 binap
提出日時 2025-10-03 23:22:39
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 844 ms / 2,000 ms
コード長 2,999 bytes
コンパイル時間 4,196 ms
コンパイル使用メモリ 253,704 KB
実行使用メモリ 7,720 KB
最終ジャッジ日時 2025-10-03 23:22:58
合計ジャッジ時間 17,942 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

const long long INF = 2002002002002002002;

int main(){
	int n;
	cin >> n;
	long long k;
	cin >> k;
	string s;
	cin >> s;
	
	vector<long long> dp(n + 1);
	dp[n] = 1;
	for(int i = n - 1; i >= 0; i--){
		if(s[i] == '0'){
			dp[i] = 0;
			continue;
		}
		if(i < n - 1 and (s[i] - '0') * 10 + (s[i + 1] - '0')<= 26){
			dp[i] = dp[i + 1] + dp[i + 2];
		}else{
			dp[i] = dp[i + 1];
		}
		if(dp[i] > INF) dp[i] = INF;
	}
	
	string ans;
	int i = 0;
	while(i < n){
		if(s[i] == '0') assert(false);
		if(i < n - 1 and (s[i] - '0') * 10 + (s[i + 1] - '0') <= 26){
			if(k <= dp[i + 1]){
				char c = (s[i] - '0') - 1 + 'a';
				ans += c;
				i++;
			}else{
				char c = (s[i] - '0') * 10 + (s[i + 1] - '0') - 1 + 'a';
				ans += c;
				k -= dp[i + 1];
				i += 2;
			}
		}else{
			char c = (s[i] - '0') - 1 + 'a';
			ans += c;
			i++;
		}
	}
	cout << ans;
	cerr << dp;
	
	
	return 0;
}
0