제출 #438111

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
438111	2021-06-27 15:07:17	mango_lassi	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	62 ms	6072 KiB

dna

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
vector<array<int, 9>> cou;
int getInd(char c) {
  if (c == 'A') return 0;
  if (c == 'C') return 1;
  if (c == 'T') return 2;
  assert(false);
  return -1;
}
void init(string a, string b) {
  int n = a.size();
  cou.resize(n + 1);
  for (int x = 0; x < 9; ++x) cou[0][x] = 0;
  for (int j = 1; j <= n; ++j) {
    for (int x = 0; x < 9; ++x) cou[j][x] = cou[j-1][x];
    int va = getInd(a[j-1]);
    int vb = getInd(b[j-1]);
    ++cou[j][va + 3*vb];
  }
}
int get_distance(int x, int y) {
  array<int, 9> counts = cou[y + 1];
  for (int j = 0; j < 9; ++j) counts[j] -= cou[x][j];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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