# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
241014 | SamAnd | Igra (COCI17_igra) | C++17 | 5 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>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 5003;
int n;
char a[N], b[N];
int qa[302], qb[302];
bool stg()
{
for (int uab = 0; uab <= qa['a']; ++uab)
{
int fa = qb['a'], fb = qb['b'], fc = qb['c'];
fb -= uab;
fc -= (qa['a'] - uab);
if (fb < 0 || fc < 0)
continue;
int sb = qa['b'], sc = qa['c'];
if (sb >= fc && sc >= fb)
return true;
continue;
if (sb <= fc)
{
fc -= sb;
sb = 0;
}
else
{
sb -= fc;
fc = 0;
}
if (sc <= fb)
{
fb -= sc;
sc = 0;
}
else
{
sc -= fb;
fb = 0;
}
}
return false;
}
void solv()
{
scanf("%d", &n);
scanf(" %s", a);
scanf(" %s", b);
for (int i = 0; i < n; ++i)
qa[a[i]]++;
for (int i = 0; i < n; ++i)
qb[b[i]]++;
for (int i = 0; i < n; ++i)
{
qb[b[i]]--;
for (char u = 'a'; u <= 'c'; ++u)
{
if (!qa[u] || u == b[i])
continue;
--qa[u];
if (stg())
{
putchar(u);
break;
}
++qa[u];
}
}
putchar('\n');
}
int main()
{
#ifdef SOMETHING
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif // SOMETHING
//ios_base::sync_with_stdio(false), cin.tie(0);
solv();
return 0;
}
//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |