oj.uz

답안 #249504

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249504 2020-07-15T07:20:35 Z Vimmer Igra (COCI17_igra) C++14
100 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100010
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 6> a6;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int kol[30], kl[30], n;

string s;

int main()
{
    //freopen("input.txt", "r", stdin); freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;

    cin >> s;

    for (int i = 0; i < n; i++) kol[s[i] - 'a']++;

    cin >> s;

    for (int i = 0; i < n; i++) kl[s[i] - 'a']++;

    string ans = "";

    for (int i = 0; i < n; i++)
        for (int j = 0; j < 3; j++)
        {
            if (kol[j] == 0 || j == s[i] - 'a') continue;

            bool gd = 1;

            kol[j]--;

            kl[s[i] - 'a']--;

            for (int u = 0; u < 3; u++)
                if (n - i - 1 - kl[u] < kol[u]) gd = 0;

            if (!gd)
            {
                kol[j]++;

                kl[s[i] - 'a']++;

                continue;
            }

            ans += char(j + 'a');

            break;
        }


    cout << ans << endl;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct