oj.uz

Submission #442955

# Submission time Handle Problem Language Result Execution time Memory
442955 2021-07-09T11:50:00 Z ltf0501 Mutating DNA (IOI21_dna) C++17
100 / 100
 46 ms 7404 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

const int kN = 1e5 + 10;
int n, pre[kN][3][3];
map<char, int> mp;
void init(std::string a, std::string b) {
  mp['A'] = 0, mp['T'] = 1, mp['C'] = 2;
  n = a.length();
  for(int i = 0; i < n; i++) {
    if(i) {
      for(int x = 0; x < 3; x++) {
        for(int y = 0; y < 3; y++) pre[i][x][y] = pre[i - 1][x][y];
      }
    }

    pre[i][mp[a[i]]][mp[b[i]]]++;
  }
}

int get_distance(int l, int r) {

  auto Getnum = [&](int x, int y) {
    if(!l) return pre[r][x][y];
    else return pre[r][x][y] - pre[l - 1][x][y];
  };

  int num[3][3] = {};
  for(int i = 0; i < 3; i++) {
    for(int j = 0; j < 3; j++) num[i][j] = Getnum(i, j);
  }

  int cnt = 0;
  for(int i = 0; i < 3; i++) {
    int j = (i + 1) % 3;
    int mn = min(num[i][j], num[j][i]);
    cnt += mn;
    num[i][j] -= mn, num[j][i] -= mn;
  }

  bool flag = 1;
  for(int i = 0; i < 3; i++) flag &= (num[i][(i + 1) % 3] == num[0][1]);
  for(int i = 0; i < 3; i++) flag &= (num[(i + 1) % 3][i] == num[1][0]);

  if(!flag) return -1;
  else {
    cnt += 2 * (num[0][1] + num[1][0]);
    return cnt;
  }
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 7044 KB Output is correct
2 Correct 44 ms 7040 KB Output is correct
3 Correct 42 ms 6676 KB Output is correct
4 Correct 44 ms 7028 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 7 ms 4532 KB Output is correct
5 Correct 6 ms 4556 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 7 ms 4532 KB Output is correct
5 Correct 6 ms 4556 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct
10 Correct 42 ms 6964 KB Output is correct
11 Correct 42 ms 6992 KB Output is correct
12 Correct 41 ms 7056 KB Output is correct
13 Correct 46 ms 7272 KB Output is correct
14 Correct 43 ms 7276 KB Output is correct
15 Correct 41 ms 7240 KB Output is correct
16 Correct 40 ms 6976 KB Output is correct
17 Correct 41 ms 7084 KB Output is correct
18 Correct 40 ms 7296 KB Output is correct
19 Correct 46 ms 7000 KB Output is correct
20 Correct 38 ms 7188 KB Output is correct
21 Correct 39 ms 7296 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 7 ms 4532 KB Output is correct
5 Correct 6 ms 4556 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct
10 Correct 5 ms 4172 KB Output is correct
11 Correct 6 ms 4556 KB Output is correct
12 Correct 6 ms 4300 KB Output is correct
13 Correct 6 ms 4556 KB Output is correct
14 Correct 6 ms 4556 KB Output is correct
15 Correct 5 ms 4536 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 7044 KB Output is correct
2 Correct 44 ms 7040 KB Output is correct
3 Correct 42 ms 6676 KB Output is correct
4 Correct 44 ms 7028 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 7 ms 4532 KB Output is correct
12 Correct 6 ms 4556 KB Output is correct
13 Correct 5 ms 4556 KB Output is correct
14 Correct 5 ms 4300 KB Output is correct
15 Correct 6 ms 4556 KB Output is correct
16 Correct 5 ms 4556 KB Output is correct
17 Correct 42 ms 6964 KB Output is correct
18 Correct 42 ms 6992 KB Output is correct
19 Correct 41 ms 7056 KB Output is correct
20 Correct 46 ms 7272 KB Output is correct
21 Correct 43 ms 7276 KB Output is correct
22 Correct 41 ms 7240 KB Output is correct
23 Correct 40 ms 6976 KB Output is correct
24 Correct 41 ms 7084 KB Output is correct
25 Correct 40 ms 7296 KB Output is correct
26 Correct 46 ms 7000 KB Output is correct
27 Correct 38 ms 7188 KB Output is correct
28 Correct 39 ms 7296 KB Output is correct
29 Correct 5 ms 4172 KB Output is correct
30 Correct 6 ms 4556 KB Output is correct
31 Correct 6 ms 4300 KB Output is correct
32 Correct 6 ms 4556 KB Output is correct
33 Correct 6 ms 4556 KB Output is correct
34 Correct 5 ms 4536 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 42 ms 6616 KB Output is correct
37 Correct 44 ms 6964 KB Output is correct
38 Correct 44 ms 7144 KB Output is correct
39 Correct 43 ms 7404 KB Output is correct
40 Correct 42 ms 7296 KB Output is correct
41 Correct 5 ms 4608 KB Output is correct
42 Correct 40 ms 6992 KB Output is correct
43 Correct 41 ms 7296 KB Output is correct
44 Correct 41 ms 7280 KB Output is correct
45 Correct 39 ms 7004 KB Output is correct
46 Correct 39 ms 7296 KB Output is correct
47 Correct 38 ms 7296 KB Output is correct