Submission #1009482

#	Time	Username	Problem	Language	Result	Execution time	Memory
1009482		somefjord	Mutating DNA (IOI21_dna)	C++17	0 / 100	17 ms	3676 KiB

dna

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

using namespace std;

string as, bs;
vector<int> balance1, balance2, misplacecount;

void init(string a, string b) {
  as = a;
  bs = b;

  int n = a.length();
  balance1.resize(n + 2, 0);
  balance2.resize(n + 2, 0);
  misplacecount.resize(n + 2, 0);

  for (int i = 1; i <= n; ++i) {
    balance1[i] = balance1[i - 1] + (as[i - 1] == 'A' ? 1 : -1);
    balance2[i] = balance2[i - 1] + (bs[i - 1] == 'A' ? 1 : -1);
    misplacecount[i] =
        misplacecount[i - 1] + (as[i - 1] == 'A' && as[i - 1] != bs[i - 1]);
    // printf("i : %d, %d %d %d\n", i, acount1[i], acount2[i],
    // misplacecount[i]);
  }
}

int get_distance(int x, int y) {
  if ((balance1[y] - balance2[x]) != (balance2[y] - balance2[x]))
    return -1;

  return misplacecount[y] - misplacecount[x];
}

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