# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
661097 | Trisanu_Das | Tavan (COCI16_tavan) | C++17 | 1 ms | 300 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;
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 |
---|---|---|---|---|
Fetching results... |