oj.uz

Submission #464224

# Submission time Handle Problem Language Result Execution time Memory
464224 2021-08-12T14:37:47 Z ljuba Mutating DNA (IOI21_dna) C++17
100 / 100
 128 ms 34684 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> pref, pref2;
map<char, int> mp;
int n;

vector<vector<vector<int>>> cnt;

void init(std::string _a, std::string _b) {
    mp['A'] = 0;
    mp['C'] = 1;
    mp['T'] = 2;
    n = (int)_a.size();
    vector<int> a(n), b(n);
    for(int i = 0; i < n; ++i) {
        a[i] = mp[_a[i]];
    }
    for(int i = 0; i < n; ++i) {
        b[i] = mp[_b[i]];
    }

    pref.assign(n, vector<int>(3, 0));
    pref2.assign(n, vector<int>(3, 0));

    pref[0][a[0]] = 1;

    for(int i = 1; i < n; ++i) {
        for(int j = 0; j < 3; ++j) {
            pref[i][j] = pref[i-1][j];
        }
        ++pref[i][a[i]];
    }

    pref2[0][b[0]] = 1;
    for(int i = 1; i < n; ++i) {
        for(int j = 0; j < 3; ++j) {
            pref2[i][j] = pref2[i-1][j];
        }
        ++pref2[i][b[i]];
    }

    cnt.assign(n, vector<vector<int>>(3, vector<int>(3, 0)));
    cnt[0][a[0]][b[0]] = 1;

    for(int i = 1; i < n; ++i) {
        for(int j = 0; j < 3; ++j) {
            for(int k = 0; k < 3; ++k) {
                cnt[i][j][k] = cnt[i-1][j][k];
            }
        }
        ++cnt[i][a[i]][b[i]];
    }
}

int get_distance(int x, int y) {
    for(int j = 0; j < 3; ++j) {
        int s1 = pref[y][j];
        if(x-1 >= 0)
            s1 -= pref[x-1][j];
        int s2 = pref2[y][j];
        if(x-1 >= 0)
            s2 -= pref2[x-1][j];

        if(s1 != s2) {
            return -1;
        }
    }
    int ans = 0;
    int vel = y - x + 1;
    for(int j = 0; j < 3; ++j) {
        int s1 = cnt[y][j][j];
        if(x-1 >= 0)
            s1 -= cnt[x-1][j][j];
        vel -= s1;
    }

    for(int j = 0; j < 3; ++j) {
        for(int k = j+1; k < 3; ++k) {
            int ima1 = cnt[y][j][k];
            if(x - 1 >= 0)
                ima1 -= cnt[x-1][j][k];
            int ima2 = cnt[y][k][j];
            if(x - 1 >= 0)
                ima2 -= cnt[x-1][k][j];

            ans += min(ima1, ima2);
            vel -= 2*min(ima1, ima2);
        }
    }

    //konacno ce izgledati oblika
    //CCAATT
    //TTCCAA
    //ovde treba 4 poteza

    ans += (vel / 3) * 2;

    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 32964 KB Output is correct
2 Correct 107 ms 33340 KB Output is correct
3 Correct 106 ms 30484 KB Output is correct
4 Correct 106 ms 33348 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 45 ms 31684 KB Output is correct
5 Correct 57 ms 32192 KB Output is correct
6 Correct 45 ms 31908 KB Output is correct
7 Correct 42 ms 29952 KB Output is correct
8 Correct 46 ms 32076 KB Output is correct
9 Correct 45 ms 32092 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 45 ms 31684 KB Output is correct
5 Correct 57 ms 32192 KB Output is correct
6 Correct 45 ms 31908 KB Output is correct
7 Correct 42 ms 29952 KB Output is correct
8 Correct 46 ms 32076 KB Output is correct
9 Correct 45 ms 32092 KB Output is correct
10 Correct 106 ms 32952 KB Output is correct
11 Correct 110 ms 33340 KB Output is correct
12 Correct 106 ms 31152 KB Output is correct
13 Correct 120 ms 31904 KB Output is correct
14 Correct 111 ms 33340 KB Output is correct
15 Correct 108 ms 33332 KB Output is correct
16 Correct 101 ms 31072 KB Output is correct
17 Correct 106 ms 31844 KB Output is correct
18 Correct 103 ms 33344 KB Output is correct
19 Correct 83 ms 31028 KB Output is correct
20 Correct 88 ms 31812 KB Output is correct
21 Correct 84 ms 33328 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 45 ms 31684 KB Output is correct
5 Correct 57 ms 32192 KB Output is correct
6 Correct 45 ms 31908 KB Output is correct
7 Correct 42 ms 29952 KB Output is correct
8 Correct 46 ms 32076 KB Output is correct
9 Correct 45 ms 32092 KB Output is correct
10 Correct 45 ms 29388 KB Output is correct
11 Correct 46 ms 32152 KB Output is correct
12 Correct 45 ms 30060 KB Output is correct
13 Correct 48 ms 32152 KB Output is correct
14 Correct 48 ms 32320 KB Output is correct
15 Correct 46 ms 32376 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 32964 KB Output is correct
2 Correct 107 ms 33340 KB Output is correct
3 Correct 106 ms 30484 KB Output is correct
4 Correct 106 ms 33348 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 45 ms 31684 KB Output is correct
12 Correct 57 ms 32192 KB Output is correct
13 Correct 45 ms 31908 KB Output is correct
14 Correct 42 ms 29952 KB Output is correct
15 Correct 46 ms 32076 KB Output is correct
16 Correct 45 ms 32092 KB Output is correct
17 Correct 106 ms 32952 KB Output is correct
18 Correct 110 ms 33340 KB Output is correct
19 Correct 106 ms 31152 KB Output is correct
20 Correct 120 ms 31904 KB Output is correct
21 Correct 111 ms 33340 KB Output is correct
22 Correct 108 ms 33332 KB Output is correct
23 Correct 101 ms 31072 KB Output is correct
24 Correct 106 ms 31844 KB Output is correct
25 Correct 103 ms 33344 KB Output is correct
26 Correct 83 ms 31028 KB Output is correct
27 Correct 88 ms 31812 KB Output is correct
28 Correct 84 ms 33328 KB Output is correct
29 Correct 45 ms 29388 KB Output is correct
30 Correct 46 ms 32152 KB Output is correct
31 Correct 45 ms 30060 KB Output is correct
32 Correct 48 ms 32152 KB Output is correct
33 Correct 48 ms 32320 KB Output is correct
34 Correct 46 ms 32376 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 104 ms 31744 KB Output is correct
37 Correct 108 ms 34684 KB Output is correct
38 Correct 128 ms 32660 KB Output is correct
39 Correct 110 ms 34588 KB Output is correct
40 Correct 110 ms 34628 KB Output is correct
41 Correct 54 ms 32324 KB Output is correct
42 Correct 101 ms 32660 KB Output is correct
43 Correct 113 ms 34532 KB Output is correct
44 Correct 106 ms 34500 KB Output is correct
45 Correct 83 ms 32616 KB Output is correct
46 Correct 93 ms 34464 KB Output is correct
47 Correct 85 ms 34500 KB Output is correct