oj.uz

Submission #777345

# Submission time Handle Problem Language Result Execution time Memory
777345 2023-07-09T06:21:34 Z Trisanu_Das Mutating DNA (IOI21_dna) C++17
100 / 100
 41 ms 7400 KB 
#include <bits/stdc++.h>
using namespace std;

int pref[100005][3][3];
map<char, int> mp;

void init(string a, string b){
    mp['A'] = 0; mp['C'] = 1; mp['T'] = 2;
    for(int i = 1; i <= a.size(); i++) for(int j = 0; j < 3; j++) for(int k = 0; k < 3; k++) pref[i][j][k] = pref[i - 1][j][k] + (mp[a[i - 1]] == j && mp[b[i - 1]] == k);
}

int get_distance(int x, int y){
    int actual = 0, add = 0;
    for(int i = 0; i < 3; i++){
        int j = (i + 1) % 3;
        int m = pref[y + 1][i][j] - pref[x][i][j], n = pref[y + 1][j][i] - pref[x][j][i];
        if(i == 0) add = m - n;
        else if(m - n != add) return -1;
        actual += min(m, n);
    }
    return actual + abs(add) * 2;
}

Compilation message

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

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 6924 KB Output is correct
2 Correct 39 ms 6936 KB Output is correct
3 Correct 29 ms 6628 KB Output is correct
4 Correct 31 ms 6996 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 7 ms 4436 KB Output is correct
5 Correct 7 ms 4544 KB Output is correct
6 Correct 7 ms 4536 KB Output is correct
7 Correct 7 ms 4308 KB Output is correct
8 Correct 7 ms 4580 KB Output is correct
9 Correct 6 ms 4564 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 7 ms 4436 KB Output is correct
5 Correct 7 ms 4544 KB Output is correct
6 Correct 7 ms 4536 KB Output is correct
7 Correct 7 ms 4308 KB Output is correct
8 Correct 7 ms 4580 KB Output is correct
9 Correct 6 ms 4564 KB Output is correct
10 Correct 40 ms 6956 KB Output is correct
11 Correct 30 ms 7028 KB Output is correct
12 Correct 31 ms 7000 KB Output is correct
13 Correct 30 ms 7192 KB Output is correct
14 Correct 31 ms 7288 KB Output is correct
15 Correct 29 ms 7320 KB Output is correct
16 Correct 30 ms 7020 KB Output is correct
17 Correct 31 ms 7028 KB Output is correct
18 Correct 30 ms 7308 KB Output is correct
19 Correct 28 ms 7048 KB Output is correct
20 Correct 28 ms 7160 KB Output is correct
21 Correct 29 ms 7280 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 7 ms 4436 KB Output is correct
5 Correct 7 ms 4544 KB Output is correct
6 Correct 7 ms 4536 KB Output is correct
7 Correct 7 ms 4308 KB Output is correct
8 Correct 7 ms 4580 KB Output is correct
9 Correct 6 ms 4564 KB Output is correct
10 Correct 9 ms 4120 KB Output is correct
11 Correct 9 ms 4592 KB Output is correct
12 Correct 10 ms 4280 KB Output is correct
13 Correct 9 ms 4536 KB Output is correct
14 Correct 11 ms 4536 KB Output is correct
15 Correct 7 ms 4576 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 6924 KB Output is correct
2 Correct 39 ms 6936 KB Output is correct
3 Correct 29 ms 6628 KB Output is correct
4 Correct 31 ms 6996 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 304 KB Output is correct
11 Correct 7 ms 4436 KB Output is correct
12 Correct 7 ms 4544 KB Output is correct
13 Correct 7 ms 4536 KB Output is correct
14 Correct 7 ms 4308 KB Output is correct
15 Correct 7 ms 4580 KB Output is correct
16 Correct 6 ms 4564 KB Output is correct
17 Correct 40 ms 6956 KB Output is correct
18 Correct 30 ms 7028 KB Output is correct
19 Correct 31 ms 7000 KB Output is correct
20 Correct 30 ms 7192 KB Output is correct
21 Correct 31 ms 7288 KB Output is correct
22 Correct 29 ms 7320 KB Output is correct
23 Correct 30 ms 7020 KB Output is correct
24 Correct 31 ms 7028 KB Output is correct
25 Correct 30 ms 7308 KB Output is correct
26 Correct 28 ms 7048 KB Output is correct
27 Correct 28 ms 7160 KB Output is correct
28 Correct 29 ms 7280 KB Output is correct
29 Correct 9 ms 4120 KB Output is correct
30 Correct 9 ms 4592 KB Output is correct
31 Correct 10 ms 4280 KB Output is correct
32 Correct 9 ms 4536 KB Output is correct
33 Correct 11 ms 4536 KB Output is correct
34 Correct 7 ms 4576 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 30 ms 6608 KB Output is correct
37 Correct 31 ms 7048 KB Output is correct
38 Correct 41 ms 7136 KB Output is correct
39 Correct 31 ms 7396 KB Output is correct
40 Correct 31 ms 7400 KB Output is correct
41 Correct 6 ms 4580 KB Output is correct
42 Correct 31 ms 7076 KB Output is correct
43 Correct 32 ms 7288 KB Output is correct
44 Correct 31 ms 7288 KB Output is correct
45 Correct 29 ms 7060 KB Output is correct
46 Correct 30 ms 7316 KB Output is correct
47 Correct 39 ms 7316 KB Output is correct