Submission #67922003

---

Source Code Expand

// @yuuzaa_tkms
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, a, b) for(ll i = a; i < (ll)(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define YeNo(a) cout<<((a)?"Yes":"No")<<endl;
#define YENO(a) cout<<((a)?"YES":"NO")<<endl;
#define Ye cout<<"Yes"<<endl
#define YE cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define NO cout<<"NO"<<endl
#define Vcin(a) rep(i,a.size())cin>>a[i];
#define println(n) cout<<n<<endl
#define printsp(n) cout<<n<<" "
#define print(n) cout<<n
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define vec vector
#define fin do{return 0;}while(0)
using namespace std;
using ll=long long;
using ull=unsigned long long;
vector<int>dx={0,1,0,-1,-1,-1,1,1};
vector<int>dy={1,0,-1,0,-1,1,-1,1};
ll LINF=1e18;
int INF=1e9;
bool edge(int x,int y,int H,int W){
    if(x<0||x>=H||y<0||y>=W)return 0;
    else return 1;
}

//実装は丁寧に書こう
//考察は文章化してみる
//その条件分岐は正しいですか?
//わからないときは答えの二分探索,ナップザックDP,遅延セグ木,平方分割
//1400復帰しよう!
int N,K;
vec<string>U;
vec<string>S;
string T;
void dfs(int i){
    if(i==K){
        U.pb(T);
        return;
    }
    rep(j,N){
        string V=T;
        T+=S[j];

        dfs(i+1);
        T=V;
    }
    return;
}
int main(){
    int X;
    cin>>N>>K>>X;
    S.resize(N);
    rep(i,N){
        cin>>S[i];
    }
    dfs(0);
    sort(all(U));
    println(U[X-1]);
}

Submission Info

Judge Result