oj.uz

Submission #626309

# Submission time Handle Problem Language Result Execution time Memory
626309 2022-08-11T11:25:52 Z juancarlovieri Mutating DNA (IOI21_dna) C++17
84 / 100
 1500 ms 7636 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

int pre[100005][3][3];
int n;
string a, b;

void init(std::string A, std::string B) {
  a = A, b = B;
  n = a.length();
  for (int i = 0; i < n; ++i) {
    if (a[i] == 'A') a[i] = 'a';
    else if (a[i] == 'C') a[i] = 'b';
    else a[i] = 'c';
    if (b[i] == 'A') b[i] = 'a';
    else if (b[i] == 'C') b[i] = 'b';
    else b[i] = 'c';
  }
  for (int i = 0; i < n; ++i) {
    pre[i][a[i] - 'a'][b[i] - 'a']++;
  }
  for (int i = 1; i < n; ++i) {
    for (int j = 0; j < 3; ++j) {
      for (int k = 0; k < 3; ++k) pre[i][j][k] += pre[i - 1][j][k];
    }
  }
  // for (int i = 0; i < 3; ++i) {
  //   for (int j = 0; j < 3; ++j) cout << pre[n - 1][i][j] << ' ';
  //   cout << endl;
  // }
}

int arr[3][3];

int get_distance(int x, int y) {
  // cout << y << endl;
  memset(arr, 0, sizeof arr);
  for (int i = 0; i < 3; ++i) {
    for (int j = 0; j < 3; ++j) {
      arr[i][j] = pre[y][i][j];
      if (x) arr[i][j] -= pre[x - 1][i][j];
      // cout << pre[n - 1][i][j] << ' ';
      // cout << arr[i][j] << ' ';
    }
    // cout << endl;
    // cout << endl;
  }
  int ans = 0;
  for (int rep = 0; rep < 100; ++rep) {
    for (int i = 0; i < 3; ++i) {
      for (int j = 0; j < 3; ++j) {
        if (i == j) continue;
        if (arr[i][j] == 0) continue;
        int take = arr[i][j];
        take = min(take, arr[j][i]);
        arr[i][j] -= take;
        arr[j][i] -= take;
        ans += take;
      }
    }
  }
  for (int rep = 0; rep < 100; ++rep) {
    for (int i = 0; i < 3; ++i) {
      for (int j = 0; j < 3; ++j) {
        if (i == j) continue;
        if (arr[i][j] == 0) continue;
        int take = arr[i][j];
        take = min(take, arr[j][i]);
        arr[i][j] -= take;
        arr[j][i] -= take;
        ans += take;
        if (arr[i][j] == 0) continue;
        for (int k = 0; k < 3; ++k) {
          if (arr[j][k] == 0) continue;
          if (j == k) continue;
          int take = arr[i][j];
          take = min(take, arr[j][k]);
          arr[i][j] -= take;
          arr[j][k] -= take;
          arr[i][k] += take;
          ans += take;
        }
      }
    }
  }
  int can = 1;
  for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) if (i != j && arr[i][j] != 0) can = 0;
  if (!can) {
    // int cnt = 0;
    vector<vector<int>> cnt(2, vector<int> (3, 0));
    for (int i = x; i <= y; ++i) {
      ++cnt[0][a[i] - 'a'];
      ++cnt[1][b[i] - 'a'];
    }
    int cann = 1;
    for (int i = 0; i < 3; ++i) if (cnt[0][i] != cnt[1][i]) cann = 0;
    assert(cann == 0);
    // cout << cnt[0][0] << ' ' << cnt[1][0] << endl;
  }
  if (!can) return -1;
  return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 7244 KB Output is correct
2 Correct 324 ms 7248 KB Output is correct
3 Correct 298 ms 6828 KB Output is correct
4 Correct 301 ms 7340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 4660 KB Output is correct
5 Correct 6 ms 4692 KB Output is correct
6 Correct 7 ms 4664 KB Output is correct
7 Correct 6 ms 4436 KB Output is correct
8 Correct 7 ms 4812 KB Output is correct
9 Correct 6 ms 4800 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 4660 KB Output is correct
5 Correct 6 ms 4692 KB Output is correct
6 Correct 7 ms 4664 KB Output is correct
7 Correct 6 ms 4436 KB Output is correct
8 Correct 7 ms 4812 KB Output is correct
9 Correct 6 ms 4800 KB Output is correct
10 Correct 314 ms 7216 KB Output is correct
11 Correct 322 ms 7252 KB Output is correct
12 Correct 965 ms 7304 KB Output is correct
13 Correct 1102 ms 7428 KB Output is correct
14 Correct 1136 ms 7624 KB Output is correct
15 Correct 516 ms 7512 KB Output is correct
16 Correct 1225 ms 7208 KB Output is correct
17 Correct 1288 ms 7348 KB Output is correct
18 Correct 1303 ms 7552 KB Output is correct
19 Correct 304 ms 7192 KB Output is correct
20 Correct 327 ms 7328 KB Output is correct
21 Correct 303 ms 7628 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 4660 KB Output is correct
5 Correct 6 ms 4692 KB Output is correct
6 Correct 7 ms 4664 KB Output is correct
7 Correct 6 ms 4436 KB Output is correct
8 Correct 7 ms 4812 KB Output is correct
9 Correct 6 ms 4800 KB Output is correct
10 Correct 6 ms 4416 KB Output is correct
11 Correct 6 ms 4800 KB Output is correct
12 Correct 6 ms 4436 KB Output is correct
13 Correct 6 ms 4704 KB Output is correct
14 Correct 7 ms 4708 KB Output is correct
15 Correct 6 ms 4692 KB Output is correct

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 7244 KB Output is correct
2 Correct 324 ms 7248 KB Output is correct
3 Correct 298 ms 6828 KB Output is correct
4 Correct 301 ms 7340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 7 ms 4660 KB Output is correct
12 Correct 6 ms 4692 KB Output is correct
13 Correct 7 ms 4664 KB Output is correct
14 Correct 6 ms 4436 KB Output is correct
15 Correct 7 ms 4812 KB Output is correct
16 Correct 6 ms 4800 KB Output is correct
17 Correct 314 ms 7216 KB Output is correct
18 Correct 322 ms 7252 KB Output is correct
19 Correct 965 ms 7304 KB Output is correct
20 Correct 1102 ms 7428 KB Output is correct
21 Correct 1136 ms 7624 KB Output is correct
22 Correct 516 ms 7512 KB Output is correct
23 Correct 1225 ms 7208 KB Output is correct
24 Correct 1288 ms 7348 KB Output is correct
25 Correct 1303 ms 7552 KB Output is correct
26 Correct 304 ms 7192 KB Output is correct
27 Correct 327 ms 7328 KB Output is correct
28 Correct 303 ms 7628 KB Output is correct
29 Correct 6 ms 4416 KB Output is correct
30 Correct 6 ms 4800 KB Output is correct
31 Correct 6 ms 4436 KB Output is correct
32 Correct 6 ms 4704 KB Output is correct
33 Correct 7 ms 4708 KB Output is correct
34 Correct 6 ms 4692 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 310 ms 6836 KB Output is correct
37 Correct 316 ms 7244 KB Output is correct
38 Correct 1236 ms 7352 KB Output is correct
39 Correct 1261 ms 7636 KB Output is correct
40 Correct 1237 ms 7628 KB Output is correct
41 Correct 7 ms 4820 KB Output is correct
42 Correct 1407 ms 7276 KB Output is correct
43 Correct 1477 ms 7628 KB Output is correct
44 Execution timed out 1527 ms 7540 KB Time limit exceeded
45 Halted 0 ms 0 KB -