Submission #443658

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
443658	2021-07-11 07:45:10	Xellos	Mutating DNA (IOI21_dna)	C++17	100 / 100	71 ms	6060 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 <vector>
using namespace std;
static string C = "ATC";
static vector<int> cnt[3][3];
void init(string a, string b) {
  int N = a.length();
  for(int k = 0; k < 9; k++) cnt[k/3][k%3].resize(N+1, 0);
  for(int j = 0; j < 3; j++)
    for(int k = 0; k < 3; k++)
      for(int i = 0; i < N; i++)
        cnt[j][k][i+1] = (a[i] == C[j] && b[i] == C[k]);
  for(int j = 0; j < 3; j++)
    for(int k = 0; k < 3; k++)
      for(int i = 0; i < N; i++)
        cnt[j][k][i+1] += cnt[j][k][i];
}
int get_distance(int x, int y) {
  int cnt_sub[3][3];
  for(int j = 0; j < 3; j++)
    for(int k = 0; k < 3; k++)
      cnt_sub[j][k] = cnt[j][k][y+1] - cnt[j][k][x];
  for(int i = 0; i < 3; i++) {
    int d = 0;
    for(int j = 0; j < 3; j++) d += cnt_sub[i][j];
    for(int j = 0; j < 3; j++) d -= cnt_sub[j][i];
    if(d) return -1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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