oj.uz

답안 #880112

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880112 2023-11-28T18:02:19 Z AkibAzmain DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 64 ms 6000 KB 
#include <bits/stdc++.h>
using namespace std;
#include "dna.h"

int n;
vector < array < int, 6 > > ps;

int
toi (char x, char y)
{
  if (y > x) --y;
  return (x - 'A') * 2 + y - 'A';
}

auto
brs (int i, int l, int r)
{
  int ans = ps[r][i];
  if (l) ans -= ps[l - 1][i];
  return ans;
}

void init(std::string a, std::string b) {
  n = a.size ();
  ps.resize (n);
  for (int i = 0; i < n; ++i)
    {
      if (a[i] == 'T') a[i] = 'B';
      if (b[i] == 'T') b[i] = 'B';
      if (i) ps[i] = ps[i - 1];
      if (a[i] != b[i]) ps[i][toi (a[i], b[i])]++;
    }
}

int get_distance(int x, int y) {
  array < int, 6 > a = { brs (0, x, y), brs (1, x, y), brs (2, x, y),
                         brs (3, x, y), brs (4, x, y), brs (5, x, y) };
  int c = 0;
  auto fn = [&] ()
  {
    for (char x = 'A'; x <= 'C'; ++x)
      for (char y = 'A'; y <= 'C'; ++y)
        if (x != y)
          {
            int m = min (a[toi (x, y)], a[toi (y, x)]);
            c += m;
            a[toi (x, y)] -= m;
            a[toi (y, x)] -= m;
          }
  };
  fn ();
  for (char x = 'A'; x <= 'C'; ++x)
    for (char y = 'A'; y <= 'C'; ++y)
      if (x != y)
        {
          char z = 'A' + 'B' + 'C' - x - y;
          int m = min (a[toi (x, y)], a[toi (z, x)]);
          c += m;
          a[toi (x, y)] -= m;
          a[toi (z, x)] -= m;
          a[toi (z, y)] += m;
          fn ();
        }
  if (a[0] || a[1] || a[2] || a[3] || a[4] || a[5]) return -1;
  return c;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 5648 KB Output is correct
2 Correct 49 ms 5644 KB Output is correct
3 Correct 48 ms 5244 KB Output is correct
4 Correct 53 ms 5680 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 4 ms 3420 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 4 ms 3420 KB Output is correct
7 Correct 5 ms 3280 KB Output is correct
8 Correct 3 ms 3416 KB Output is correct
9 Correct 3 ms 3416 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 4 ms 3420 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 4 ms 3420 KB Output is correct
7 Correct 5 ms 3280 KB Output is correct
8 Correct 3 ms 3416 KB Output is correct
9 Correct 3 ms 3416 KB Output is correct
10 Correct 59 ms 5528 KB Output is correct
11 Correct 51 ms 5520 KB Output is correct
12 Correct 51 ms 5812 KB Output is correct
13 Correct 54 ms 5752 KB Output is correct
14 Correct 54 ms 5900 KB Output is correct
15 Correct 49 ms 5744 KB Output is correct
16 Correct 50 ms 5552 KB Output is correct
17 Correct 64 ms 5660 KB Output is correct
18 Correct 50 ms 5744 KB Output is correct
19 Correct 54 ms 5408 KB Output is correct
20 Correct 58 ms 5632 KB Output is correct
21 Correct 48 ms 5632 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 4 ms 3420 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 4 ms 3420 KB Output is correct
7 Correct 5 ms 3280 KB Output is correct
8 Correct 3 ms 3416 KB Output is correct
9 Correct 3 ms 3416 KB Output is correct
10 Correct 3 ms 3164 KB Output is correct
11 Correct 3 ms 3420 KB Output is correct
12 Correct 3 ms 3164 KB Output is correct
13 Correct 4 ms 3420 KB Output is correct
14 Correct 4 ms 3420 KB Output is correct
15 Correct 3 ms 3420 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 5648 KB Output is correct
2 Correct 49 ms 5644 KB Output is correct
3 Correct 48 ms 5244 KB Output is correct
4 Correct 53 ms 5680 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 356 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 4 ms 3420 KB Output is correct
12 Correct 3 ms 3420 KB Output is correct
13 Correct 4 ms 3420 KB Output is correct
14 Correct 5 ms 3280 KB Output is correct
15 Correct 3 ms 3416 KB Output is correct
16 Correct 3 ms 3416 KB Output is correct
17 Correct 59 ms 5528 KB Output is correct
18 Correct 51 ms 5520 KB Output is correct
19 Correct 51 ms 5812 KB Output is correct
20 Correct 54 ms 5752 KB Output is correct
21 Correct 54 ms 5900 KB Output is correct
22 Correct 49 ms 5744 KB Output is correct
23 Correct 50 ms 5552 KB Output is correct
24 Correct 64 ms 5660 KB Output is correct
25 Correct 50 ms 5744 KB Output is correct
26 Correct 54 ms 5408 KB Output is correct
27 Correct 58 ms 5632 KB Output is correct
28 Correct 48 ms 5632 KB Output is correct
29 Correct 3 ms 3164 KB Output is correct
30 Correct 3 ms 3420 KB Output is correct
31 Correct 3 ms 3164 KB Output is correct
32 Correct 4 ms 3420 KB Output is correct
33 Correct 4 ms 3420 KB Output is correct
34 Correct 3 ms 3420 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 48 ms 5412 KB Output is correct
37 Correct 48 ms 5648 KB Output is correct
38 Correct 50 ms 5660 KB Output is correct
39 Correct 56 ms 6000 KB Output is correct
40 Correct 50 ms 5896 KB Output is correct
41 Correct 2 ms 3416 KB Output is correct
42 Correct 50 ms 5404 KB Output is correct
43 Correct 49 ms 5784 KB Output is correct
44 Correct 57 ms 5644 KB Output is correct
45 Correct 48 ms 5656 KB Output is correct
46 Correct 48 ms 5648 KB Output is correct
47 Correct 48 ms 5744 KB Output is correct