#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
inline void io() {
#ifdef LOCAL_PROJECT
freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else
/* online submission */
#endif
ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 R7 P3*************************/
int N;
string myStr, badStr;
int myCnt[3], badCnt[3];
bool isGood(int a0, int b0, int c0, int a1, int b1, int c1) {
FORE(br, 0, min(b1, c0)) {
int ar = c0 - br;
int al = a1 - ar;
int bl = b1 - br;
if (ar >= 0 && al >= 0 && bl >= 0 && bl <= a0 && al <= b0)
return 1;
}
return 0;
}
int main() {
io();
cin >> N;
cin >> myStr >> badStr;
FOR(i, 0, N) myCnt[myStr[i] - 'a']++;
FOR(i, 0, N) badCnt[badStr[i] - 'a']++;
FOR(i, 0, N) {
FOR(c, 0, 3) if (myCnt[c]>0 && c + 'a' != badStr[i]) {
myCnt[c]--;
badCnt[badStr[i] - 'a']--;
if (isGood(badCnt[0], badCnt[1], badCnt[2], myCnt[0], myCnt[1], myCnt[2])) {
cout << (char)('a' + c);
break;
}
else {
myCnt[c]++;
badCnt[badStr[i] - 'a']++;
}
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
508 KB |
Output is correct |
| 3 |
Correct |
2 ms |
508 KB |
Output is correct |
| 4 |
Correct |
2 ms |
508 KB |
Output is correct |
| 5 |
Correct |
2 ms |
584 KB |
Output is correct |
| 6 |
Correct |
2 ms |
584 KB |
Output is correct |
| 7 |
Correct |
0 ms |
584 KB |
Output is correct |
| 8 |
Correct |
2 ms |
584 KB |
Output is correct |
| 9 |
Correct |
4 ms |
620 KB |
Output is correct |
| 10 |
Correct |
4 ms |
620 KB |
Output is correct |
