oj.uz

답안 #370997

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370997 2021-02-25T11:27:23 Z Atill83 Igra (COCI17_igra) C++14
0 / 100
 464 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 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;
    vector<int> cnt1(26), cnt2(26);
    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 < 26; j++){
            if(j == t[i] - 'a')
                continue;
            cnt1[j]--;
            bool dur = 1;
            vector<int> ot1 = cnt1, ot2 = cnt2;
            for(int l = i + 1; l < n; l++){
                int mx = (t[l] - 'a' == 0 ? 1 : 0);
                ot2[t[l] - 'a']--;
                for(int x = 0; x < 26; x++){
                    if(x == t[l] - 'a')
                        continue;
                    if(ot1[x] > ot1[mx])
                        mx = x;
                }

                if(ot1[mx] == 0){
                    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
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 364 KB Output isn't correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Incorrect 0 ms 364 KB Output isn't correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Incorrect 1 ms 364 KB Output isn't correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Incorrect 21 ms 364 KB Output isn't correct
9 Incorrect 436 ms 364 KB Output isn't correct
10 Incorrect 464 ms 364 KB Output isn't correct