# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
249033 | Vladikus004 | Igra (COCI17_igra) | C++14 | 1 ms | 384 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>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int N = 5000;
int n, cnt[3], ocnt[3];
string s, t;
bool can(){
for (int i = 0; i < 3; i++){
int sum = 0;
for (int j = 0; j < 3; j++){
if (i == j) continue;
sum += ocnt[j];
}
if (cnt[i] > sum) return false;
}
return true;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif // LOCAL
cin >> n >> t >> s;
for (int i = 0; i < t.size(); i++) cnt[t[i] - 'a']++;
for (int i = 0; i < s.size(); i++) ocnt[s[i] - 'a']++;
vector <int> ans;
for (int i = 0; i < s.size(); i++){
for (int j = 0; j < 3; j++){
if (cnt[j] && j != s[i] - 'a'){
cnt[j]--;
ocnt[s[i] - 'a']--;
if (!can()){
cnt[j]++;
ocnt[s[i] - 'a']++;
}else{
ans.push_back(j);
break;
}
}
}
}
for (auto u: ans) cout << char(u + 'a');
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |