Submission #5878332
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
#define show(x) cout<<#x<<" = "<<x<<endl;
#define all(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define bitComb(a,n,k) for(int a##x,a##y,a=(1<<k)-1;a<(1<<n);a##x=a&-a,a##y=a+a##x,a=(((a&~a##y)/a##x)>>1)|a##y)
#define uniq(v) sort(all(v));v.erase(unique(all(v)), v.end())
#define bit(n) (1LL<<(n))
#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))
#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))
#define dout(d) printf("%.12f\n",d)
typedef long long ll;
typedef __int128_t lll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>ostream& operator<<(ostream& o,const pair<T,Y>& p){return o<<"("<<p.fi<<", "<<p.se<<")";}
template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}
lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll gcd(ll a,ll b){lll x=0,y=0;return gcd(a,b,x,y);}
ll modInv(ll a,ll m){lll x,y;gcd(a,m,x,y);return (x%m+m)%m;}
ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}
bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}
const int IINF = 1e9+6;
const ll LINF = 2e18;
const int MOD = 1e9+7;
const double PI = acos(-1);
const double EPS = 1e-10;
static random_device rd;
static mt19937 rnd(rd());
const int N = 1e6;
string s;
int idx[N+1][26], n;
ll DP[N+2], k;
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> s >> k;
k++;
n = sz(s);
FOR(i, 0, 26) idx[n][i] = n+1;
FORR(i, n-1, 0){
memcpy(idx[i], idx[i+1], sizeof idx[i]);
mins(idx[i][s[i]-'a'], i+1);
}
FORR(i, n, 0){
DP[i] = 1;
FOR(j, 0, 26) if(DP[i]<LINF) DP[i] += DP[idx[i][j]];
mins(DP[i], LINF);
}
if(DP[0]<k){
cout << "Eel" << endl;
return 0;
}
int i=0;
int t = 100;
while(--k>0 && i<n){
FOR(j, 0, 26){
if(k<=DP[idx[i][j]]){
cout << char('a'+j);
i = idx[i][j];
break;
}else{
k -= DP[idx[i][j]];
}
}
}
cout << endl;
}
Submission Info
Submission Time |
|
Task |
G - 辞書順 |
User |
char134217728 |
Language |
C++14 (GCC 5.4.1) |
Score |
4 |
Code Size |
2885 Byte |
Status |
AC |
Exec Time |
80 ms |
Memory |
110876 KB |
Judge Result
Set Name |
All |
Score / Max Score |
4 / 4 |
Status |
|
Set Name |
Test Cases |
All |
00, 01, 02, 90, 91 |
Case Name |
Status |
Exec Time |
Memory |
00 |
AC |
80 ms |
110876 KB |
01 |
AC |
3 ms |
4480 KB |
02 |
AC |
2 ms |
2304 KB |
90 |
AC |
2 ms |
2304 KB |
91 |
AC |
2 ms |
2304 KB |