oj.uz

Submission #437116

# Submission time Handle Problem Language Result Execution time Memory
437116 2021-06-25T20:37:14 Z MilosMilutinovic Mutating DNA (IOI21_dna) C++17
100 / 100
 70 ms 6016 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int pref[N][3][3];
map<char, int> mp;

void init(string a, string b) {
  mp['A'] = 0;
  mp['C'] = 1;
  mp['T'] = 2;
  int n = (int) a.size();
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 3; j++) {
      for (int k = 0; k < 3; k++) {
        pref[i + 1][j][k] = pref[i][j][k] + (j == mp[a[i]] && k == mp[b[i]]);
      }
    }
  }
}

int get_distance(int l, int r) {
  vector<vector<int>> tmp(3, vector<int>(3));
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
      tmp[i][j] = pref[r + 1][i][j] - pref[l][i][j];
    }
  }
  if (tmp[0][1] + tmp[0][2] != tmp[1][0] + tmp[2][0]) {
    return -1;
  }
  if (tmp[1][0] + tmp[1][2] != tmp[0][1] + tmp[2][1]) {
    return -1;
  }
  int ans = 0;
  for (int i = 0; i < 3; i++) {
    for (int j = i + 1; j < 3; j++) {
      int mn = min(tmp[i][j], tmp[j][i]);
      tmp[i][j] -= mn;
      tmp[j][i] -= mn;
      ans += mn;
    }
  }
  int add = 1e9;
  for (int i = 0; i < 3; i++) {
    for (int j = i + 1; j < 3; j++) {
      add = min(add, max(tmp[i][j], tmp[j][i]));
    }
  }
  return ans + add * 2;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 5644 KB Output is correct
2 Correct 62 ms 5624 KB Output is correct
3 Correct 59 ms 5352 KB Output is correct
4 Correct 61 ms 5632 KB Output is correct
5 Correct 1 ms 204 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 204 KB Output is correct
4 Correct 11 ms 4320 KB Output is correct
5 Correct 11 ms 4392 KB Output is correct
6 Correct 11 ms 4300 KB Output is correct
7 Correct 13 ms 4052 KB Output is correct
8 Correct 11 ms 4300 KB Output is correct
9 Correct 10 ms 4300 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 204 KB Output is correct
4 Correct 11 ms 4320 KB Output is correct
5 Correct 11 ms 4392 KB Output is correct
6 Correct 11 ms 4300 KB Output is correct
7 Correct 13 ms 4052 KB Output is correct
8 Correct 11 ms 4300 KB Output is correct
9 Correct 10 ms 4300 KB Output is correct
10 Correct 60 ms 5632 KB Output is correct
11 Correct 59 ms 5632 KB Output is correct
12 Correct 70 ms 5744 KB Output is correct
13 Correct 59 ms 5748 KB Output is correct
14 Correct 59 ms 6012 KB Output is correct
15 Correct 59 ms 5884 KB Output is correct
16 Correct 57 ms 5692 KB Output is correct
17 Correct 56 ms 5772 KB Output is correct
18 Correct 59 ms 6012 KB Output is correct
19 Correct 54 ms 5872 KB Output is correct
20 Correct 55 ms 5900 KB Output is correct
21 Correct 58 ms 6016 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 204 KB Output is correct
4 Correct 11 ms 4320 KB Output is correct
5 Correct 11 ms 4392 KB Output is correct
6 Correct 11 ms 4300 KB Output is correct
7 Correct 13 ms 4052 KB Output is correct
8 Correct 11 ms 4300 KB Output is correct
9 Correct 10 ms 4300 KB Output is correct
10 Correct 11 ms 3996 KB Output is correct
11 Correct 11 ms 4300 KB Output is correct
12 Correct 11 ms 4044 KB Output is correct
13 Correct 12 ms 4300 KB Output is correct
14 Correct 12 ms 4300 KB Output is correct
15 Correct 10 ms 4300 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 5644 KB Output is correct
2 Correct 62 ms 5624 KB Output is correct
3 Correct 59 ms 5352 KB Output is correct
4 Correct 61 ms 5632 KB Output is correct
5 Correct 1 ms 204 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 204 KB Output is correct
11 Correct 11 ms 4320 KB Output is correct
12 Correct 11 ms 4392 KB Output is correct
13 Correct 11 ms 4300 KB Output is correct
14 Correct 13 ms 4052 KB Output is correct
15 Correct 11 ms 4300 KB Output is correct
16 Correct 10 ms 4300 KB Output is correct
17 Correct 60 ms 5632 KB Output is correct
18 Correct 59 ms 5632 KB Output is correct
19 Correct 70 ms 5744 KB Output is correct
20 Correct 59 ms 5748 KB Output is correct
21 Correct 59 ms 6012 KB Output is correct
22 Correct 59 ms 5884 KB Output is correct
23 Correct 57 ms 5692 KB Output is correct
24 Correct 56 ms 5772 KB Output is correct
25 Correct 59 ms 6012 KB Output is correct
26 Correct 54 ms 5872 KB Output is correct
27 Correct 55 ms 5900 KB Output is correct
28 Correct 58 ms 6016 KB Output is correct
29 Correct 11 ms 3996 KB Output is correct
30 Correct 11 ms 4300 KB Output is correct
31 Correct 11 ms 4044 KB Output is correct
32 Correct 12 ms 4300 KB Output is correct
33 Correct 12 ms 4300 KB Output is correct
34 Correct 10 ms 4300 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 62 ms 5268 KB Output is correct
37 Correct 61 ms 5632 KB Output is correct
38 Correct 59 ms 5724 KB Output is correct
39 Correct 59 ms 6016 KB Output is correct
40 Correct 61 ms 5940 KB Output is correct
41 Correct 9 ms 4300 KB Output is correct
42 Correct 57 ms 5744 KB Output is correct
43 Correct 60 ms 6012 KB Output is correct
44 Correct 59 ms 6016 KB Output is correct
45 Correct 70 ms 5772 KB Output is correct
46 Correct 57 ms 5980 KB Output is correct
47 Correct 56 ms 5988 KB Output is correct