Submission #705490

#	Time	Username	Problem	Language	Result	Execution time	Memory
705490		jakobrs	Mutating DNA (IOI21_dna)	C++17	100 / 100	43 ms	4868 KiB

dna

#include <xmmintrin.h>

#include <iostream>
#include <vector>

struct Count {
  int at, ca, tc;
  int qw;

  Count() : at(0), ca(0), tc(0), qw(0) {}

  inline Count operator-(Count rhs) const {
    Count result = *this;
    result.at -= rhs.at;
    result.ca -= rhs.ca;
    result.tc -= rhs.tc;
    result.qw -= rhs.qw;
    return result;
  }
};

std::string a, b;
std::vector<Count> prefixes;

void init(std::string A, std::string B) {
  a = A;
  b = B;

  prefixes.reserve(A.size() + 1);
  Count count;
  prefixes.push_back(count);
  for (int i = 0; i < A.size(); i++) {
    if (A[i] == 'A' && B[i] == 'T') count.at += 1;
    if (A[i] == 'T' && B[i] == 'A') count.at -= 1;
    if (A[i] == 'C' && B[i] == 'A') count.ca += 1;
    if (A[i] == 'A' && B[i] == 'C') count.ca -= 1;
    if (A[i] == 'T' && B[i] == 'C') count.tc += 1;
    if (A[i] == 'C' && B[i] == 'T') count.tc -= 1;
    if (A[i] != B[i]) count.qw += 1;
    prefixes.push_back(count);
  }
}

int get_distance(int x, int y) {
  y += 1;

  Count count = prefixes[y] - prefixes[x];

  if (!(count.at == count.ca && count.ca == count.tc)) return -1;

  int total =
      count.qw - std::abs(count.at) - std::abs(count.tc) - std::abs(count.ca);
  total /= 2;

  return total + std::abs(count.at) * 2;
}

Compilation message (stderr)

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:32:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   for (int i = 0; i < A.size(); i++) {
      |                   ~~^~~~~~~~~~

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