# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337899 | beksultan04 | K-th path (IZhO11_kthpath) | C++14 | 1 ms | 364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int dp[201][201],m,n,k,cnt=0;
vector <char> v;
char q[50][50];
void dfs(int x,int y){
if (x == n && m == y){
cnt++;
if (cnt == k){
int i;
for (i=0;i<v.size();++i)cout <<v[i];
exit(0);
}
ret ;
}
if (y+1 <= m){
v.pb(q[x][y+1]);
dfs(x,y+1);
v.pop_back();
}
if (x + 1 <= n){
v.pb(q[x+1][y]);
dfs(x+1,y);
v.pop_back();
}
}
main(){
int i,j;
scan2(n,m)
for (i=1;i<=n;++i){
for (j=1;j<=m;++j){
cin>>q[i][j];
}
}
cin>>k;
v.pb(q[1][1]);
dfs(1,1);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |