# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
246753 | Vladikus004 | Tavan (COCI16_tavan) | C++17 | 5 ms | 384 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 int long long
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int N = 501;
int n, m, k, x;
string s, t[N];
ll pr;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif // LOCAL
cin >> n >> m >> k >> x >> s;
for (int i = 0; i < m; i++) {
cin >> t[i];
sort(all(t[i]));
}
pr = 1;
for (int i = m - 1; i > 0; i--) pr *= (int)t[i].size();
vector <int> ans;
for (int i = 0; i < m; i++){
for (int j = 0; j < t[i].size(); j++){
if (x - pr * j < 1){
ans.push_back(j - 1);
x -= pr * j;
break;
}
}
if (ans.size() == i) {
ans.push_back(t[i].size() - 1);
x -= pr * (int)(t[i].size() - 1);
}
if (i + 1 < m)
pr /= (int)t[i + 1].size();
}
reverse(all(ans));
// for (auto u: ans) cout << u << " ";
int ind = 0;
for (int i = 0; i < n; i++){
if (s[i] != '#') {
cout << s[i];
continue;
}
cout << t[ind++][ans.back()];
ans.pop_back();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |