oj.uz

Submission #98355

# Submission time Handle Problem Language Result Execution time Memory
98355 2019-02-22T18:07:57 Z dalgerok Tavan (COCI16_tavan) C++17
80 / 80
 3 ms 640 KB 
#include<bits/stdc++.h>
using namespace std;




int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n, m, k, x;
    cin >> n >> m >> k >> x;
    string s;
    cin >> s;
    vector < int > q;
    for(int i = 0; i < n; i++){
        if(s[i] == '#'){
            q.push_back(i);
        }
    }
    string t[m];
    for(int i = 0; i < m; i++){
        cin >> t[i];
        sort(t[i].begin(), t[i].end());
    }
    x -= 1;
    for(int i = n - 1, j = m - 1; i >= 0; i--){
        if(s[i] == '#'){
            s[i] = t[j][x % k];
            x /= k;
            j -= 1;
        }
    }
    cout << s;
}

Subtask #1
80.0 / 80.0

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