oj.uz

답안 #486495

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486495 2021-11-11T20:57:03 Z perchuts Igra (COCI17_igra) C++17
10 / 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],maxq[3],q2[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']++;
    q2[0]=q[0],q2[1]=q[1],q2[2]=q[2];
    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;
        }
        if(q[y]){
            if(q[z]==q2[y]+q2[x]){
                q[z]--;
                ans+=char('a'+z);
            }else{
                q[y]--;
                ans+=char('a'+y);
            }
        }else{
            q[z]--;
            ans+=char('a'+z);
        }
        q2[x]--;
        
    }
    cout<<ans<<endl;
}

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Incorrect 0 ms 204 KB Output isn't 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 1 ms 204 KB Output isn't correct
8 Correct 1 ms 312 KB Output is correct
9 Incorrect 1 ms 332 KB Output isn't correct
10 Incorrect 0 ms 332 KB Output isn't correct