# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
580830 | Metal_Sonic | Igra (COCI17_igra) | C++17 | 1 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz(x) (int)(x).size()
#define all(x) x.begin() , x.end()
void setIO(string name = "") {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
if(sz(name)){
freopen((name+".in").c_str(), "r", stdin);
freopen((name+".out").c_str(), "w", stdout);
}
}
void run_test_case(){
// ffs stop brute forcing anything and think
int n;cin>>n;
string s , m;cin>>s>>m;
char a='a',b='b',c='c';
string ans = "";
map<char,int>A,B;
for(int i = 0; i < n; i++){
A[s[i]]++;
B[m[i]]++;
}
for(int i = 0; i < n; i++){
if(m[i] == 'a' && A[b] && A[b]-1+A[a] >= B[c] && A[b]-1+A[c] >= B[a]-1)ans+='b',A[b]--,B[a]--;
else if(m[i] == 'a')ans+='c',A[c]--,B[a]--;
else if(m[i] == 'b' && A[a] && A[a]-1+A[b] >= B[c] && A[a]-1+A[c] >= B[b]-1)ans+='a',A[a]--,B[b]--;
else if(m[i] == 'b')ans+='c',A[c]--,B[b]--;
else if(m[i] == 'c' && A[a] && A[a]-1+A[c] >= B[b] && A[a]-1+A[b] >= B[c]-1)ans+='a',A[a]--,B[c]--;
else ans+='b',A[b]--,B[c]--;
}
cout<<ans;
}
int main() {
setIO();
int T = 1;
while(T--){
run_test_case();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |