oj.uz

Submission #738611

# Submission time Handle Problem Language Result Execution time Memory
738611 2023-05-09T07:49:26 Z Toxtaq Mutating DNA (IOI21_dna) C++17
100 / 100
 113 ms 26044 KB 
#include<bits/stdc++.h>
using namespace std;
string a, b;
/// 0-A, 1-T, 2-C
vector<int>prefA, prefT, prefC;
vector<int>pref2A, pref2T, pref2C;
vector<vector<vector<int>>>table;
map<char, int>mp;
void init(string s1, string s2){
    a = s1;
    b = s2;
    mp['A'] = 0;
    mp['T'] = 1;
    mp['C'] = 2;
    prefA.resize(s1.size() + 1);
    prefT.resize(s1.size() + 1);
    prefC.resize(s1.size() + 1);
    pref2A.resize(s1.size() + 1);
    pref2T.resize(s1.size() + 1);
    pref2C.resize(s1.size() + 1);
    table.assign(s1.size(), vector<vector<int>>(3, vector<int>(3)));
    for(int i = 0;i < s1.size();++i){
        prefA[i + 1] = prefA[i] + (s1[i] == 'A');
        prefT[i + 1] = prefT[i] + (s1[i] == 'T');
        prefC[i + 1] = prefC[i] + (s1[i] == 'C');
        pref2A[i + 1] = pref2A[i] + (s2[i] == 'A');
        pref2T[i + 1] = pref2T[i] + (s2[i] == 'T');
        pref2C[i + 1] = pref2C[i] + (s2[i] == 'C');
        if(i)table[i] = table[i - 1];
        table[i][mp[a[i]]][mp[b[i]]]++;
    }
}
int get_distance(int x, int y){
    long long res = 0, cnt = 0;
    vector<vector<int>>cur(3, vector<int>(3));
    if(prefA[y + 1] - prefA[x] != pref2A[y + 1] - pref2A[x])return -1;
    if(prefT[y + 1] - prefT[x] != pref2T[y + 1] - pref2T[x])return -1;
    if(prefC[y + 1] - prefC[x] != pref2C[y + 1] - pref2C[x])return -1;
    for(int i = 0;i < 3;++i){
        for(int j = 0;j < 3;++j){
            cur[i][j] = table[y][i][j];
            if(x - 1 >= 0)cur[i][j] -= table[x - 1][i][j];
//            cout << cur[i][j] << " ";
        }
//        cout << '\n';
    }
    for(int i = 0;i < 3;++i){
        for(int j = 0;j < 3;++j){
            if(i == j)continue;
            int num = min(cur[i][j], cur[j][i]);
            res += num;
            cur[i][j] -= num;
            cur[j][i] -= num;
            cnt += cur[i][j];
        }
    }
    cnt = cnt * 2 / 3;
    return cnt + res;
}
//int main()
//{
//    string a, b;
//    cin >> a >> b;
//    init(a, b);
//    int q;
//    cin >> q;
//    while(q--){
//        int l, r;
//        cin >> l >> r;
//        cout << get_distance(l, r) << '\n';
//    }
//}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:22:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(int i = 0;i < s1.size();++i){
      |                   ~~^~~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 24028 KB Output is correct
2 Correct 105 ms 24352 KB Output is correct
3 Correct 98 ms 22320 KB Output is correct
4 Correct 94 ms 24288 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 35 ms 22712 KB Output is correct
5 Correct 35 ms 22900 KB Output is correct
6 Correct 53 ms 22784 KB Output is correct
7 Correct 32 ms 21432 KB Output is correct
8 Correct 35 ms 22920 KB Output is correct
9 Correct 33 ms 23012 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 35 ms 22712 KB Output is correct
5 Correct 35 ms 22900 KB Output is correct
6 Correct 53 ms 22784 KB Output is correct
7 Correct 32 ms 21432 KB Output is correct
8 Correct 35 ms 22920 KB Output is correct
9 Correct 33 ms 23012 KB Output is correct
10 Correct 88 ms 24000 KB Output is correct
11 Correct 88 ms 24304 KB Output is correct
12 Correct 93 ms 23104 KB Output is correct
13 Correct 99 ms 23684 KB Output is correct
14 Correct 91 ms 24680 KB Output is correct
15 Correct 100 ms 24652 KB Output is correct
16 Correct 88 ms 23056 KB Output is correct
17 Correct 93 ms 23684 KB Output is correct
18 Correct 93 ms 24708 KB Output is correct
19 Correct 82 ms 23100 KB Output is correct
20 Correct 73 ms 23668 KB Output is correct
21 Correct 77 ms 24764 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 35 ms 22712 KB Output is correct
5 Correct 35 ms 22900 KB Output is correct
6 Correct 53 ms 22784 KB Output is correct
7 Correct 32 ms 21432 KB Output is correct
8 Correct 35 ms 22920 KB Output is correct
9 Correct 33 ms 23012 KB Output is correct
10 Correct 38 ms 20932 KB Output is correct
11 Correct 48 ms 22948 KB Output is correct
12 Correct 37 ms 21508 KB Output is correct
13 Correct 39 ms 23084 KB Output is correct
14 Correct 38 ms 23124 KB Output is correct
15 Correct 38 ms 23120 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 24028 KB Output is correct
2 Correct 105 ms 24352 KB Output is correct
3 Correct 98 ms 22320 KB Output is correct
4 Correct 94 ms 24288 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 35 ms 22712 KB Output is correct
12 Correct 35 ms 22900 KB Output is correct
13 Correct 53 ms 22784 KB Output is correct
14 Correct 32 ms 21432 KB Output is correct
15 Correct 35 ms 22920 KB Output is correct
16 Correct 33 ms 23012 KB Output is correct
17 Correct 88 ms 24000 KB Output is correct
18 Correct 88 ms 24304 KB Output is correct
19 Correct 93 ms 23104 KB Output is correct
20 Correct 99 ms 23684 KB Output is correct
21 Correct 91 ms 24680 KB Output is correct
22 Correct 100 ms 24652 KB Output is correct
23 Correct 88 ms 23056 KB Output is correct
24 Correct 93 ms 23684 KB Output is correct
25 Correct 93 ms 24708 KB Output is correct
26 Correct 82 ms 23100 KB Output is correct
27 Correct 73 ms 23668 KB Output is correct
28 Correct 77 ms 24764 KB Output is correct
29 Correct 38 ms 20932 KB Output is correct
30 Correct 48 ms 22948 KB Output is correct
31 Correct 37 ms 21508 KB Output is correct
32 Correct 39 ms 23084 KB Output is correct
33 Correct 38 ms 23124 KB Output is correct
34 Correct 38 ms 23120 KB Output is correct
35 Correct 1 ms 292 KB Output is correct
36 Correct 101 ms 23632 KB Output is correct
37 Correct 110 ms 25628 KB Output is correct
38 Correct 103 ms 24660 KB Output is correct
39 Correct 113 ms 26044 KB Output is correct
40 Correct 109 ms 26036 KB Output is correct
41 Correct 40 ms 23084 KB Output is correct
42 Correct 103 ms 24564 KB Output is correct
43 Correct 110 ms 25940 KB Output is correct
44 Correct 100 ms 25948 KB Output is correct
45 Correct 86 ms 24536 KB Output is correct
46 Correct 89 ms 26020 KB Output is correct
47 Correct 90 ms 25928 KB Output is correct