oj.uz

Submission #242537

# Submission time Handle Problem Language Result Execution time Memory
242537 2020-06-28T06:45:55 Z VEGAnn Tavan (COCI16_tavan) C++14
80 / 80
 5 ms 512 KB 
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
using namespace std;
const int N = 510;
int n, m, k, id[N], x;
string s[N], t;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n >> m >> k >> x;

    cin >> t;

    for (int i = 0; i < m; i++){
        cin >> s[i];

        sort(all(s[i]));
    }

    int lst = m - 1; x--;

    while (x > 0){
        id[lst--] = x % k;

        x /= k;
    }

    lst = 0;

    for (int i = 0; i < n; i++){
        if (t[i] != '#') continue;

        t[i] = s[lst][id[lst]];

        lst++;
    }

    cout << t;

    return 0;
}

Subtask #1
80.0 / 80.0

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