Submission #1159430

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159430		equation_tracker	Mutating DNA (IOI21_dna)	C++20	35 / 100	23 ms	7180 KiB

dna

#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> pre_ta, pre_at, pre_ct, pre_tc, pre_ac, pre_ca;
void init(std::string a, std::string b)
{
  ll n = a.size();
  pre_ca.resize(n + 1, 0);
  pre_ac.resize(n + 1, 0);
  pre_at.resize(n + 1, 0);
  pre_ta.resize(n + 1, 0);
  pre_tc.resize(n + 1, 0);
  pre_ct.resize(n + 1, 0);
  for (ll i = 0; i < n; i++)
  {
    if (a[i] == 'C' && b[i] == 'A')
      pre_ca[i + 1]++;
    else if (a[i] == 'A' && b[i] == 'C')
      pre_ac[i + 1]++;
    else if (a[i] == 'A' && b[i] == 'T')
      pre_at[i + 1]++;
    else if (a[i] == 'T' && b[i] == 'A')
      pre_ta[i + 1]++;
    else if (a[i] == 'T' && b[i] == 'C')
      pre_tc[i + 1]++;
    else if (a[i] == 'C' && b[i] == 'T')
      pre_ct[i + 1]++;
  }
  for (ll i = 1; i <= n; i++)
  {
    pre_ca[i] += pre_ca[i - 1];
    pre_ac[i] += pre_ac[i - 1];
    pre_at[i] += pre_at[i - 1];
    pre_ta[i] += pre_ta[i - 1];
    pre_tc[i] += pre_tc[i - 1];
    pre_ct[i] += pre_ct[i - 1];
  }
}
int get_distance(int x, int y)
{
  ll ca = pre_ca[y + 1] - pre_ca[x];
  ll ac = pre_ac[y + 1] - pre_ac[x];
  ll at = pre_at[y + 1] - pre_at[x];
  ll ta = pre_ta[y + 1] - pre_ta[x];
  ll tc = pre_tc[y + 1] - pre_tc[x];
  ll ct = pre_ct[y + 1] - pre_ct[x];

  ll AT = min(at, ta);
  ll AC = min(ac, ca);
  ll TC = min(tc, ct);

  ll TA = max(at, ta) - AT, CT = max(ct, tc) - TC, CA = max(ac, ca) - AC;
  if (TA == CT && CT == CA) return 2 * CT + AT + AC + TC;
  return -1;
}

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