oj.uz

Submission #242543

# Submission time Handle Problem Language Result Execution time Memory
242543 2020-06-28T07:15:57 Z NONAME Tavan (COCI16_tavan) C++14
80 / 80
 6 ms 512 KB 
#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";
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct