#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, k, x; string s; cin >> n >> m >> k >> x >> s;
x--;
string checks[m];
vector<int> anss;
for (int i = 0; i < m; i++) {
cin >> checks[i]; sort(checks[i].begin(), checks[i].end());
anss.push_back(x % k); x /= k;
}
reverse(anss.begin(), anss.end());
int cnt = 0;
for (int i = 0; i < n; i++) if (s[i] == '#') s[i] = checks[cnt][anss[cnt]], cnt++;
cout << s << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
300 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
296 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |