Submission #853137

#	Time	Username	Problem	Language	Result	Execution time	Memory
853137		onepunchac168	Mutating DNA (IOI21_dna)	C++17	100 / 100	41 ms	11128 KiB

dna

//------------------------------------\\
//   ------------------------------   \\
//  |  created by Dinh Manh Hung   |  \\
//  |      tht.onepunchac168       |  \\
//  |     THPT CHUYEN HA TINH      |  \\
//  |      HA TINH, VIET NAM       |  \\
//  |           Siuuu              |  \\
//   ------------------------------   \\
//------------------------------------\\

#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

#define            task     ""
#define       file(name)    if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define             ldb     long double
#define              pb     push_back
#define              eb     emplace_back
#define              fi     first
#define              se     second
#define           all(x)    begin(x),end(x)
#define       uniquev(v)    v.resize(unique(all(v))-v.begin())
#define       rep(i,a,b)    for (int i=a;i<=b;i++)
#define        cntbit(v)    __builtin_popcountll(v)
#define         gcd(a,b)    __gcd(a,b)
#define         lcm(a,b)    ((1LL*a*b)/__gcd(a,b))
#define          mask(x)    (1LL<<(x))
#define     readbit(x,i)    ((x>>i)&1)
#define             Yes     cout << "Yes"
#define             YES     cout << "YES"
#define              No     cout << "No"
#define              NO     cout << "NO"

typedef long long ll;
typedef pair <ll,ll> ii;
typedef pair <ll,ii> iii;
typedef pair <ii,ii> iiii;

ll dx[]= {1,-1,0,0,1,-1,1,-1};
ll dy[]= {0,0,-1,1,1,-1,-1,1};

const ldb PI = acos (-1);
//const ll mod=978846151;
//const ll base=29;
const ll mod=1e9+7;
const char nl = '\n';

inline int ReadInt()
{
    char co;
    for (co = getchar(); co < '0' || co > '9'; co = getchar());
    int xo = co - '0';
    for (co = getchar(); co >= '0' && co <= '9'; co = getchar())
        xo = (xo<<1) + (xo<<3) + co - '0';
    return xo;
}

void WriteInt(int xo)
{
    if (xo > 9)
        WriteInt(xo / 10);
    putchar(xo % 10 + '0');
}

// DEBUG

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}


#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif


/* END OF TEMPLATE*/

// ================= Solution =================//

const int N=1e5+5;
ll n;
ll dp[N][3][3];
ll solve(char aa)
{
    if (aa=='A')
    {
        return 0;
    }
    if (aa=='T')
    {
        return 1;
    }
    return 2;
}
void init(std::string a, std::string b) {
    n=a.size();
    a=" "+a;
    b=" "+b;
    for (int i=1;i<=n;i++)
    {
        for (int j=0;j<=2;j++)
        {
            for (int h=0;h<=2;h++)
            {
                dp[i][j][h]+=dp[i-1][j][h];
            }
        }
        dp[i][solve(a[i])][solve(b[i])]++;
    }
}
ll s[3][3];
ll d[3][2];
int get_distance(int x, int y) {
    x++;
    y++;
    for (int i=0;i<=2;i++)
    {
        for (int j=0;j<=1;j++)
        {
            d[i][j]=0;
        }
    }
    for (int i=0;i<=2;i++)
    {
        for (int j=0;j<=2;j++)
        {
            s[i][j]=dp[y][i][j]-dp[x-1][i][j];
            d[i][0]+=s[i][j];
            d[j][1]+=s[i][j];
            if (i==j)
            {
                s[i][j]=0;
            }
        }
    }
    for (int i=0;i<=2;i++)
    {
        if (d[i][0]!=d[i][1])
        {
            return -1;
        }
    }
    int dem=0;
    for (int i=0;i<=2;i++)
    {
        for (int j=0;j<=2;j++)
        {
            ll pp=min(s[i][j],s[j][i]);
            s[i][j]-=pp;
            s[j][i]-=pp;
            dem+=pp;
        }
    }
    ll gmax=0;
    for (int i=0;i<=2;i++)
    {
        for (int j=0;j<=2;j++)
        {
            if (s[i][j]!=0)
            {
                gmax=s[i][j];
            }
        }
    }
    dem+=gmax*2;
	return dem;
}
/*
void onepunchac168();

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    file(task);
    int tests;
    tests=1;
    //cin>>tests;
    while (tests--)
    {
        onepunchac168();
    }
}

const int N=2e5+5;

void onepunchac168()
{

}
*/

// goodbye see ya

Compilation message (stderr)

dna.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //------------------------------------\\
      | ^

• Subtask 1: 21 / 21
• Subtask 2: 22 / 22
• Subtask 3: 13 / 13
• Subtask 4: 28 / 28
• Subtask 5: 16 / 16