oj.uz

답안 #251842

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251842 2020-07-22T11:01:00 Z kartel Igra (COCI17_igra) C++14
100 / 100
 67 ms 468 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
//#define F first
//#define S second
#define pb push_back
#define N +5005
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_A int(1e9)
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define Max_S int(3e6)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int n, i;
string s, t, ans;
int mp[3], kl[3][3], can[N][3];

int main()
{
    cout.precision(2);
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");
    cin >> n;
    cin >> s >> t;
    for (i = 0; i < n; i++)
        mp[s[i] - 'a']++, ans += 'c';

    for (i = 0; i < n; i++)
    {
        can[i][0] = can[i][1] = can[i][2] = 1;
        can[i][t[i] - 'a'] = 0;
    }

    for (i = 0; i < n; i++)
    {
        int f = -1, s = -1;
        if (can[i][0]) f = 0;
        if (can[i][1] && f == 0) s = 1;
        else if (can[i][1]) f = 1;

        if (can[i][2]) s = 2;

        for (int a = 0; a < 3; a++)
        for (int b = 0; b < 3; b++) kl[a][b] = 0;

        int bad = (mp[f] == 0);

        for (int j = i + 1; j < n; j++)
        {
            int F = -1, S = -1;

            if (can[j][0]) F = 0;
            if (can[j][1] && F == 0) S = 1;
            else if (can[j][1]) F = 1;

            if (can[j][2]) S = 2;

//            cerr << F << " " << S << el;

            kl[F][S]++;
        }

        bad |= (mp[0] + mp[1] - (f == 0 || f == 1) < kl[0][1] || mp[0] + mp[2] - (f == 0) < kl[0][2] || mp[1] + mp[2] - (f == 1) < kl[1][2]);

        if (!bad) ans[i] = f + 'a', mp[f]--;
             else ans[i] = s + 'a', mp[s]--;
    }

    cout << ans;
}
//
//00000
//00110
//00111
//00011
//00000

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 3 ms 384 KB Output is correct
9 Correct 67 ms 384 KB Output is correct
10 Correct 67 ms 468 KB Output is correct