Submission #661097

#TimeUsernameProblemLanguageResultExecution timeMemory
661097Trisanu_DasTavan (COCI16_tavan)C++17
80 / 80
1 ms300 KiB
#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 timeMemoryGrader output
Fetching results...