DSA/string_2.cpp at main · riteshkantule/DSA · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mod 1000000007
#define inf 1e18
#define endl '\n'
#define debug(a) cerr<<#a<<'='<<(a)<<endl
const ll N=2e5+5;
void solve()
{
    ll n,a[5]={0},ans[N];
    cin>>n;
    string s;
    cin>>s;
    for(ll i=0;i<n;i++)
    {
        if(s[i]=='A') a[1]++;
        else if(s[i]=='C') a[2]++;
        else if(s[i]=='G') a[3]++;
        else if(s[i]=='T') a[4]++;
    }
    ll mx=0,idx=0;
    for(ll i=1;i<=4;i++)
    {
        if(a[i]>mx)
        {
            mx=a[i];
            idx=i;
        }
    }
    if(n%4!=0 || (mx>n/2))
    {
        cout<<"==="<<endl;
        return;
    }
    ll each=n/4;
    for(ll i=0;i<n;i++)
    {
        if(s[i]!='?')
            ans[i]=s[i];
        else
        {
            if(a[1]<each) ans[i]='A',a[1]++;
            else if(a[2]<each) ans[i]='C',a[2]++;
            else if(a[3]<each) ans[i]='G',a[3]++;
            else ans[i]='T',a[4]++;
        }
    }
    for(ll i=1;i<=4;i++)
    {
        if(a[i]!=each)
        {
            cout<<"==="<<endl;
            return;
        }
    }
    for(ll i=0;i<n;i++)
        cout<<(char)ans[i];
    cout<<endl;
    return;
}
int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}