#include<bits/stdc++.h>
using namespace std ;
#define maxn 79
#define ll long long
#define fi first
#define se second
#define pb push_back
#define left id<<1
#define right id<<1|1
#define re exit(0);
const int mod = 1e9+7;
const int INF = 1e9;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<ll> vl;
void add ( int &a , int b )
{
a += b ;
if ( a > mod ) a -= mod ;
if ( a < 0 ) a += mod ;
}
template <typename T> void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template <typename T> void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }
int _pow ( int a , int n )
{
if ( n == 0 ) return 1 ;
int res = _pow (a,n/2) ;
if ( n % 2 ) return 1ll*res*res%mod*a%mod ;
else return 1ll*res*res%mod ;
}
void rf ()
{
freopen ("bai1.inp","r",stdin) ;
}
int n , m ;
ll k ;
int ans [maxn] ;
int a [maxn][maxn] ;
ll dp [maxn][maxn] ;
ll num_way ( int x , int y )
{
if ( ans [x+y-1] != -1 && ans [x+y-1] != a [x][y] ) return 0 ;
if ( x == n && y == m ) return 1 ;
ll &res = dp [x][y] ;
if ( res + 1 ) return res ;
res = 0 ;
if ( x+1 <= n ) res += num_way (x+1,y) ;
if ( y+1 <= m ) res += num_way (x,y+1) ;
return res ;
}
int main ()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
// rf () ;
cin >> n >> m ;
for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= m ; j ++ )
{
char c ; cin >> c ;
a [i][j] = c - 'a' ;
}
cin >> k ;
memset ( ans , -1 , sizeof ans ) ;
ans [1] = a [1][1] ;
for ( int run = 2 ; run < n+m ; run ++ )
{
for ( int ch = 0 ; ch < 26 ; ch ++ )
{
ans [run] = ch ;
memset ( dp , -1 , sizeof dp ) ;
if ( num_way (1,1) >= k ) break ;
else k -= num_way (1,1) ;
}
}
for ( int run = 1 ; run < n+m ; run ++ ) cout << char ('a'+ans[run]) ;
}
Compilation message
kthpath.cpp: In function 'void rf()':
kthpath.cpp:40:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
40 | freopen ("bai1.inp","r",stdin) ;
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
388 KB |
Output is correct |
9 |
Correct |
1 ms |
600 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
496 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
344 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
1 ms |
344 KB |
Output is correct |
17 |
Correct |
1 ms |
344 KB |
Output is correct |
18 |
Correct |
1 ms |
348 KB |
Output is correct |
19 |
Correct |
2 ms |
348 KB |
Output is correct |
20 |
Correct |
1 ms |
344 KB |
Output is correct |