Submission #1042452

#	Time	Username	Problem	Language	Result	Execution time	Memory
1042452		vjudge1	Mutating DNA (IOI21_dna)	C++17	0 / 100	16 ms	6840 KiB

dna

#include <bits/stdc++.h>
#include "dna.h"

using namespace std;
 
vector<long long> at, ac, ca, ct, ta, tc;
 
void init(string a,string b)
{
    int n = a.size() + 1;
    a = '#' + a;
    b = '#' + b;
    at.resize(n + 1, 0);
    ac.resize(n + 1, 0);
    ca.resize(n + 1, 0);
    ct.resize(n + 1, 0);
    ta.resize(n + 1, 0);
    tc.resize(n + 1, 0);
    for(int i = 1; i <= n; ++i)
    {
        if(a[i] == 'A')
        {
            if(b[i] == 'C')
                ac[i] = ac[i - 1] + 1;
            if(b[i] == 'T')
                at[i] = at[i - 1] + 1;
        }
        if(a[i] == 'T')
        {
            if(b[i] == 'A')
                ta[i] = ta[i - 1] + 1;
            if(b[i] == 'C')
                tc[i] = tc[i - 1] + 1;
        }
        if(a[i] == 'C')
        {
            if(b[i] == 'A')
                ca[i] = ca[i - 1] + 1;
            if(b[i] == 'T')
                ct[i] = ct[i - 1] + 1;
        }
    }
}

int get_distance(int x, int y) 
{
    int acc = (ac[y + 1] - ac[x]);
    int att = (at[y + 1] - at[x]);
    int ctt = (ct[y + 1] - ct[x]);
    int caa = (ca[y + 1] - ca[x]);
    int tcc = (tc[y + 1] - tc[x]);
    int taa = (ta[y + 1] - ta[x]);
    if(acc + att != taa + caa)    {return -1;}
    if(caa + ctt != acc + tcc)    {return -1;}
    if(taa + tcc != att + ctt)    {return -1;}
    int ans = min(acc, caa) + min(att, taa) + min(tcc, ctt);
}

Compilation message (stderr)

dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:56:9: warning: unused variable 'ans' [-Wunused-variable]
   56 |     int ans = min(acc, caa) + min(att, taa) + min(tcc, ctt);
      |         ^~~
dna.cpp:56:59: warning: control reaches end of non-void function [-Wreturn-type]
   56 |     int ans = min(acc, caa) + min(att, taa) + min(tcc, ctt);
      |                                                           ^

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