oj.uz

답안 #593491

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
593491 2022-07-11T09:08:30 Z Pety DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 148 ms 35936 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;

const int INF = 1e9;
const int MOD = 1e9 + 7;

int n, p1[100002], p2[100002];

struct nod {
  int fr[4];
  int cnt[4][4];
  nod () {
    memset(fr, 0, sizeof(fr));
    memset(cnt, 0, sizeof(cnt));
  }
} aint[400002];

nod merge (nod st, nod dr) {
  nod ans;
  for (int i = 1; i <= 3; i++)
    ans.fr[i] = st.fr[i] + dr.fr[i];
  for (int i = 1; i <= 3; i++)
    for (int j = 1; j <= 3; j++)
      ans.cnt[i][j] += st.cnt[i][j] + dr.cnt[i][j];
  return ans;
}

void build (int nod, int st, int dr) {
  if (st == dr) {
    aint[nod].fr[p1[st]]++;
    aint[nod].fr[p2[st]]--;
    aint[nod].cnt[p1[st]][p2[st]]++;
    return;
  }
  int mij = (st + dr) / 2;
  build(2 * nod, st, mij);
  build(2 * nod + 1, mij + 1, dr);
  aint[nod] = merge(aint[2 * nod], aint[2 * nod + 1]);
}

nod query(int nod, int st, int dr, int a, int b) {
  if (a <= st && dr <= b) {
    return aint[nod];
  }
  int mij = (st + dr) / 2;
  if (b <= mij)
    return query(2 * nod, st, mij, a, b);
  else if (a > mij)
    return query(2 * nod + 1, mij + 1, dr, a, b);
  else 
    return merge(query(2 * nod, st, mij, a, b), query(2 * nod + 1, mij + 1, dr, a, b));
}


void init (string a, string b) {
  n = a.size();
  map<char, int>mp;
  mp['A'] = 1;
  mp['C'] = 2;
  mp['T'] = 3;
  for (int i = 1; i <= n; i++) {
    p1[i] = mp[a[i - 1]];
    p2[i] = mp[b[i - 1]];
  }
  build(1, 1, n);
}

int get_distance (int x, int y) {
  x++;y++;
  
  nod ans = query(1, 1, n, x, y); 
  if (ans.fr[1] != 0 || ans.fr[2] != 0 || ans.fr[3] != 0)
    return -1;
  int cycles = 0;
  int sz = y - x + 1;
  cycles += ans.cnt[1][1];
  cycles += ans.cnt[2][2];
  cycles += ans.cnt[3][3];
  sz -= cycles;
  cycles += min(ans.cnt[1][2], ans.cnt[2][1]);
  sz -= 2 * min(ans.cnt[1][2], ans.cnt[2][1]);
  cycles += min(ans.cnt[1][3], ans.cnt[3][1]);
  sz -= 2 * min(ans.cnt[1][3], ans.cnt[3][1]);
  cycles += min(ans.cnt[2][3], ans.cnt[3][2]);
  sz -= 2 * min(ans.cnt[2][3], ans.cnt[3][2]);
  cycles += sz / 3;
  return y - x + 1 - cycles;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 34400 KB Output is correct
2 Correct 65 ms 34340 KB Output is correct
3 Correct 63 ms 34236 KB Output is correct
4 Correct 74 ms 34420 KB Output is correct
5 Correct 15 ms 31608 KB Output is correct
6 Correct 15 ms 31620 KB Output is correct
7 Correct 13 ms 31616 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 31572 KB Output is correct
2 Correct 12 ms 31572 KB Output is correct
3 Correct 17 ms 31700 KB Output is correct
4 Correct 22 ms 33064 KB Output is correct
5 Correct 19 ms 33088 KB Output is correct
6 Correct 25 ms 33108 KB Output is correct
7 Correct 22 ms 32936 KB Output is correct
8 Correct 19 ms 32972 KB Output is correct
9 Correct 20 ms 33072 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 31572 KB Output is correct
2 Correct 12 ms 31572 KB Output is correct
3 Correct 17 ms 31700 KB Output is correct
4 Correct 22 ms 33064 KB Output is correct
5 Correct 19 ms 33088 KB Output is correct
6 Correct 25 ms 33108 KB Output is correct
7 Correct 22 ms 32936 KB Output is correct
8 Correct 19 ms 32972 KB Output is correct
9 Correct 20 ms 33072 KB Output is correct
10 Correct 77 ms 34380 KB Output is correct
11 Correct 67 ms 34312 KB Output is correct
12 Correct 148 ms 34656 KB Output is correct
13 Correct 119 ms 35888 KB Output is correct
14 Correct 120 ms 35936 KB Output is correct
15 Correct 129 ms 35904 KB Output is correct
16 Correct 119 ms 35736 KB Output is correct
17 Correct 113 ms 35768 KB Output is correct
18 Correct 109 ms 35852 KB Output is correct
19 Correct 104 ms 35720 KB Output is correct
20 Correct 135 ms 35860 KB Output is correct
21 Correct 101 ms 35904 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 31572 KB Output is correct
2 Correct 12 ms 31572 KB Output is correct
3 Correct 17 ms 31700 KB Output is correct
4 Correct 22 ms 33064 KB Output is correct
5 Correct 19 ms 33088 KB Output is correct
6 Correct 25 ms 33108 KB Output is correct
7 Correct 22 ms 32936 KB Output is correct
8 Correct 19 ms 32972 KB Output is correct
9 Correct 20 ms 33072 KB Output is correct
10 Correct 20 ms 32972 KB Output is correct
11 Correct 19 ms 33164 KB Output is correct
12 Correct 19 ms 33092 KB Output is correct
13 Correct 20 ms 33168 KB Output is correct
14 Correct 20 ms 33236 KB Output is correct
15 Correct 20 ms 33192 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 34400 KB Output is correct
2 Correct 65 ms 34340 KB Output is correct
3 Correct 63 ms 34236 KB Output is correct
4 Correct 74 ms 34420 KB Output is correct
5 Correct 15 ms 31608 KB Output is correct
6 Correct 15 ms 31620 KB Output is correct
7 Correct 13 ms 31616 KB Output is correct
8 Correct 12 ms 31572 KB Output is correct
9 Correct 12 ms 31572 KB Output is correct
10 Correct 17 ms 31700 KB Output is correct
11 Correct 22 ms 33064 KB Output is correct
12 Correct 19 ms 33088 KB Output is correct
13 Correct 25 ms 33108 KB Output is correct
14 Correct 22 ms 32936 KB Output is correct
15 Correct 19 ms 32972 KB Output is correct
16 Correct 20 ms 33072 KB Output is correct
17 Correct 77 ms 34380 KB Output is correct
18 Correct 67 ms 34312 KB Output is correct
19 Correct 148 ms 34656 KB Output is correct
20 Correct 119 ms 35888 KB Output is correct
21 Correct 120 ms 35936 KB Output is correct
22 Correct 129 ms 35904 KB Output is correct
23 Correct 119 ms 35736 KB Output is correct
24 Correct 113 ms 35768 KB Output is correct
25 Correct 109 ms 35852 KB Output is correct
26 Correct 104 ms 35720 KB Output is correct
27 Correct 135 ms 35860 KB Output is correct
28 Correct 101 ms 35904 KB Output is correct
29 Correct 20 ms 32972 KB Output is correct
30 Correct 19 ms 33164 KB Output is correct
31 Correct 19 ms 33092 KB Output is correct
32 Correct 20 ms 33168 KB Output is correct
33 Correct 20 ms 33236 KB Output is correct
34 Correct 20 ms 33192 KB Output is correct
35 Correct 12 ms 31572 KB Output is correct
36 Correct 71 ms 35472 KB Output is correct
37 Correct 67 ms 35508 KB Output is correct
38 Correct 130 ms 35856 KB Output is correct
39 Correct 127 ms 35936 KB Output is correct
40 Correct 138 ms 35896 KB Output is correct
41 Correct 20 ms 33168 KB Output is correct
42 Correct 113 ms 35764 KB Output is correct
43 Correct 110 ms 35912 KB Output is correct
44 Correct 114 ms 35848 KB Output is correct
45 Correct 104 ms 35732 KB Output is correct
46 Correct 105 ms 35892 KB Output is correct
47 Correct 107 ms 35832 KB Output is correct