# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242543 | NONAME | Tavan (COCI16_tavan) | C++14 | 6 ms | 512 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;
using ll = long long;
using ld = long double;
int n, m, k, x, ps[1000];
string s, t[1000];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m >> k >> x;
--x;
cin >> s;
for (int i = 0; i < m; ++i) {
cin >> t[i];
sort(t[i].begin(), t[i].end());
ps[i] = 0;
}
int r = m - 1;
while (x > 0) {
ps[r--] = (x % k);
x /= k;
}
int p = 0;
for (int i = 0; i < n; ++i)
if (s[i] == '#')
s[i] = t[p][ps[p]], ++p;
cout << s << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |