답안 #371000

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
371000 2021-02-25T11:47:10 Z Atill83 Igra (COCI17_igra) C++14
100 / 100
1 ms 364 KB
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
string s, t;
int cnt1[3], cnt2[3]; 

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n>>s>>t;

    for(char c: s)
        cnt1[c - 'a']++;
    for(char c: t)
        cnt2[c - 'a']++;

    string ans;
    for(int i = 0; i < n; i++){
        cnt2[t[i] - 'a']--;
        for(int j = 0; j < 3; j++){
            if(j == t[i] - 'a')
                continue;
            if(cnt1[j] == 0)
                continue;
            cnt1[j]--;
            bool dur = 1;
            for(int l = 0; l < 3; l++){
                if(n - 1 - i - cnt2[l] < cnt1[l]){
                    dur = 0;
                    break;
                }
            }
            if(dur){
                ans += (char) ('a' + j);
                break;
            }
            cnt1[j]++;
        }
    }


    cout<<ans<<endl;

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 268 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct