# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17856 | Elibay | K-th path (IZhO11_kthpath) | C++14 | 0 ms | 2256 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;
const int MaxN = 30 + 17, INF = 1e9;
long long d[MaxN][MaxN], n, m, q;
char a[MaxN][MaxN];
vector < string > g[MaxN][MaxN];
int main ()
{
ios_base :: sync_with_stdio (0);
#ifdef Elibay
freopen (".in", "r", stdin);
#endif
cin >> n >> m;
for (int i = 1; i <= n; ++ i)
for (int j = 1; j <= m; ++ j)
cin >> a[i][j];
cin >> q;
string w = "" + a[1][1];
g[1][1].push_back (w);
for (int i = 1; i <= n; ++ i)
{
for (int j = 1; j <= m; ++ j)
{
if (i - 1 >= 1)
{
for (int k = 0; k < g[i - 1][j].size(); ++ k)
g[i][j].push_back (g[i - 1][j][k] + a[i][j]);
}
if (j - 1 >= 1)
{
for (int k = 0; k < g[i][j - 1].size(); ++ k)
g[i][j].push_back (g[i][j - 1][k] + a[i][j]);
}
}
}
-- q;
sort (g[n][m].begin (), g[n][m].end ());
cout << a[1][1] + g[n][m][q];
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |