#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 cnt[3];
bool seen[5001][5001];
bool dp[5001][5001]; // cnts for [a][b]
stack<char> ans;
bool solve(int idx) {
if (idx == N) {
ans.push('\n');
return 1;
}
if (seen[cnt[0]][cnt[1]]) {
return dp[cnt[0]][cnt[1]];
}
seen[cnt[0]][cnt[1]] = 1;
FOR(c, 0, 3) {
if (cnt[c]>0 && badStr[idx] != c + 'a') {
cnt[c]--;
if (solve(idx + 1)) {
ans.push((char)(c + 'a'));
return dp[cnt[0]][cnt[1]] = 1;
}
cnt[c]++;
}
}
return dp[cnt[0]][cnt[1]] = 0;
}
int main() {
io();
cin >> N;
cin >> myStr >> badStr;
FOR(i, 0, N)
cnt[myStr[i] - 'a']++;
solve(0);
while (!ans.empty()) {
cout << ans.top();
ans.pop();
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Incorrect |
2 ms |
508 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
608 KB |
Output isn't correct |
| 4 |
Incorrect |
2 ms |
608 KB |
Output isn't correct |
| 5 |
Incorrect |
2 ms |
752 KB |
Output isn't correct |
| 6 |
Incorrect |
2 ms |
752 KB |
Output isn't correct |
| 7 |
Incorrect |
2 ms |
1048 KB |
Output isn't correct |
| 8 |
Incorrect |
6 ms |
3480 KB |
Output isn't correct |
| 9 |
Incorrect |
60 ms |
17020 KB |
Output isn't correct |
| 10 |
Incorrect |
64 ms |
17020 KB |
Output isn't correct |
