/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
const int N = 30;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll n, m, k, ans;
char a[N][N];
set<string> ss;
void str(int i, int j, string s){
//cout<<i<<" "<<j<<endl;
if(i == n-1 && j == m-1){
ss.insert(s+a[i][j]);
return;
}
if(i+1 < n) str(i+1, j, s+a[i][j]);
if(j+1 < m) str(i, j+1, s+a[i][j]);
}
void solve(){
fastios
cin>>n>>m;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++) cin>>a[i][j];
}
cin>>k;
str(0, 0, "");
auto x = ss.begin();
for(int i=1;i<k-1;i++, x++){}
cout<<*x<<endl;
return;
}
int main(){
fastios
int t = 1;
if(t) solve();
else {
cin>>t;
while (t--) solve();
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
