# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
752505 | AtabayRajabli | K-th path (IZhO11_kthpath) | C++11 | 365 ms | 262144 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>
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MAX 5e4 + 1
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define OPT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define sec second
#define fi first
#define elif else if
#define print(k) cerr << "Ans : "; cout << k << endl;
#define int ll
#define ask(a, b) cout << "? " << a << " " << b << endl;
#define ins insert
typedef long long ll;
typedef unsigned long long ull;
const int oo = INT_MAX;
const int ooo = 0x3F3F3F3F3F3F3F3FLL;
const int mod = 301907;
using namespace std;
string c[35];
vector<vector<int>> wy(35, vector<int>(35, 0));
vector<char> ans;
int a, b, k;
void solve()
{
cin >> a >> b;
for(int i = 0 ; i<a; i++)cin >> c[i];
cin >> k;
for(int i = 1; i<35; i++)
for(int j = 1; j<35; j++)
wy[i][j] = wy[i-1][j] + wy[i][j-1], wy[1][1] = 1;
string ans(a+b-1, c[0][0]);
vector<array<int, 2>> now = {{0, 0}}, temp;
for(int j = 0; j<a+b-1; j++)
{
map<char, int> sum;
for(auto &[x, y] : now)
sum[c[x][y]] += wy[a-x][b-y];
for(auto &[x, y] : sum)
{
ans[j] = x;
if(y < k)k -= y;
else break;
}
for(auto &[x, y] : now)
{
if(c[x][y] == ans[j])
{
if(x+1 <= a)
{
temp.pb({x+1, y});
}
if(y+1 <= b)
{
temp.pb({x, y+1});
}
}
}
now = temp;
temp.clear();
}
cout << ans;
}
int32_t main()
{
OPT
int t = 1;
//cin >> t;
while(t--)
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |