oj.uz

Submission #486103

# Submission time Handle Problem Language Result Execution time Memory
486103 2021-11-10T14:40:59 Z perchuts Igra (COCI17_igra) C++17
20 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
#define maxn (int)(1e5+51)
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ii pair<int,int>
#define iii tuple<int,int,int>
#define inf (int)(2e9+1)
#define mod (int)(1e9+7)

using namespace std;
int n,q[3];
int main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    string in,m,ans="";
    cin>>n>>in>>m;   
    
    for(int i=0;i<n;i++)
        q[in[i]-'a']++;

    for(int i=0;i<n;i++){
        int x,y,z;
        if(m[i]=='a'){
            x=0,y=1,z=2;
        }else if(m[i]=='b'){
            x=1,y=0,z=2;
        }else{
            x=2,y=0,z=1;
        }
        int ok=1;
        if(!q[x]&&q[y]==1){
            for(int j=1+i;j<n;j++){
                if(m[j]==(char)(z+'a')){
                    ok=0;
                    q[z]--;ans+=(char)(z+'a');   
                    break;
                }
            }
        }
        if(ok){
            if(!q[y]){
                q[z]--;ans+=(char)(z+'a');
            }else{
                q[y]--;ans+=(char)(y+'a');
            }
        }
    }
    cout<<ans<<endl;
}

Subtask #1
20.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Incorrect 0 ms 204 KB Output isn't correct
5 Incorrect 0 ms 204 KB Output isn't correct
6 Incorrect 0 ms 204 KB Output isn't correct
7 Incorrect 0 ms 316 KB Output isn't correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Incorrect 0 ms 332 KB Output isn't correct
10 Incorrect 0 ms 320 KB Output isn't correct