oj.uz

Submission #479214

# Submission time Handle Problem Language Result Execution time Memory
479214 2021-10-10T16:48:10 Z couplefire Mutating DNA (IOI21_dna) C++17
100 / 100
 55 ms 7412 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 100005;

int n, cnt[3][3][N];

void init(string a, string b){
    n = a.size();
    for(auto &c : a)
        if(c=='A') c = '0';
        else if(c=='C') c = '1';
        else c = '2';
    for(auto &c : b)
        if(c=='A') c = '0';
        else if(c=='C') c = '1';
        else c = '2';
    a = "$"+a, b = "$"+b;
    for(int i = 0; i<3; ++i)
        for(int j = 0; j<3; ++j)
            for(int id = 1; id<=n; ++id)
                cnt[i][j][id] = cnt[i][j][id-1]+(a[id]-'0'==i && b[id]-'0'==j);
}

int get_distance(int l, int r){
    ++l, ++r; int ans = 0;
    int tmp[3][3]; memset(tmp, 0, sizeof tmp);
    for(int i = 0; i<3; ++i)
        for(int j = 0; j<3; ++j)
            tmp[i][j] = cnt[i][j][r]-cnt[i][j][l-1];
    for(int i = 0; i<3; ++i)
        for(int j = i+1; j<3; ++j){
            int x = min(tmp[i][j], tmp[j][i]);
            ans += x, tmp[i][j] -= x, tmp[j][i] -= x;
        }
    if(tmp[0][1] != tmp[1][2] || tmp[0][1] != tmp[2][0] || 
       tmp[1][0] != tmp[2][1] || tmp[1][0] != tmp[0][2]) return -1;
    ans += 2*(tmp[0][1]+tmp[1][0]);
    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 6956 KB Output is correct
2 Correct 45 ms 7048 KB Output is correct
3 Correct 41 ms 6696 KB Output is correct
4 Correct 41 ms 7088 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 9 ms 4652 KB Output is correct
5 Correct 9 ms 4792 KB Output is correct
6 Correct 9 ms 4684 KB Output is correct
7 Correct 8 ms 4428 KB Output is correct
8 Correct 8 ms 4744 KB Output is correct
9 Correct 6 ms 4684 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 9 ms 4652 KB Output is correct
5 Correct 9 ms 4792 KB Output is correct
6 Correct 9 ms 4684 KB Output is correct
7 Correct 8 ms 4428 KB Output is correct
8 Correct 8 ms 4744 KB Output is correct
9 Correct 6 ms 4684 KB Output is correct
10 Correct 44 ms 7084 KB Output is correct
11 Correct 43 ms 7088 KB Output is correct
12 Correct 40 ms 7100 KB Output is correct
13 Correct 43 ms 7220 KB Output is correct
14 Correct 41 ms 7356 KB Output is correct
15 Correct 40 ms 7356 KB Output is correct
16 Correct 40 ms 7056 KB Output is correct
17 Correct 42 ms 7120 KB Output is correct
18 Correct 55 ms 7228 KB Output is correct
19 Correct 40 ms 7064 KB Output is correct
20 Correct 38 ms 7100 KB Output is correct
21 Correct 37 ms 7228 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 9 ms 4652 KB Output is correct
5 Correct 9 ms 4792 KB Output is correct
6 Correct 9 ms 4684 KB Output is correct
7 Correct 8 ms 4428 KB Output is correct
8 Correct 8 ms 4744 KB Output is correct
9 Correct 6 ms 4684 KB Output is correct
10 Correct 8 ms 4428 KB Output is correct
11 Correct 13 ms 4796 KB Output is correct
12 Correct 8 ms 4468 KB Output is correct
13 Correct 10 ms 4716 KB Output is correct
14 Correct 9 ms 4684 KB Output is correct
15 Correct 7 ms 4684 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 6956 KB Output is correct
2 Correct 45 ms 7048 KB Output is correct
3 Correct 41 ms 6696 KB Output is correct
4 Correct 41 ms 7088 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 9 ms 4652 KB Output is correct
12 Correct 9 ms 4792 KB Output is correct
13 Correct 9 ms 4684 KB Output is correct
14 Correct 8 ms 4428 KB Output is correct
15 Correct 8 ms 4744 KB Output is correct
16 Correct 6 ms 4684 KB Output is correct
17 Correct 44 ms 7084 KB Output is correct
18 Correct 43 ms 7088 KB Output is correct
19 Correct 40 ms 7100 KB Output is correct
20 Correct 43 ms 7220 KB Output is correct
21 Correct 41 ms 7356 KB Output is correct
22 Correct 40 ms 7356 KB Output is correct
23 Correct 40 ms 7056 KB Output is correct
24 Correct 42 ms 7120 KB Output is correct
25 Correct 55 ms 7228 KB Output is correct
26 Correct 40 ms 7064 KB Output is correct
27 Correct 38 ms 7100 KB Output is correct
28 Correct 37 ms 7228 KB Output is correct
29 Correct 8 ms 4428 KB Output is correct
30 Correct 13 ms 4796 KB Output is correct
31 Correct 8 ms 4468 KB Output is correct
32 Correct 10 ms 4716 KB Output is correct
33 Correct 9 ms 4684 KB Output is correct
34 Correct 7 ms 4684 KB Output is correct
35 Correct 1 ms 300 KB Output is correct
36 Correct 42 ms 6672 KB Output is correct
37 Correct 44 ms 7080 KB Output is correct
38 Correct 50 ms 7092 KB Output is correct
39 Correct 43 ms 7384 KB Output is correct
40 Correct 43 ms 7344 KB Output is correct
41 Correct 6 ms 4684 KB Output is correct
42 Correct 39 ms 7080 KB Output is correct
43 Correct 40 ms 7412 KB Output is correct
44 Correct 40 ms 7308 KB Output is correct
45 Correct 38 ms 7124 KB Output is correct
46 Correct 37 ms 7340 KB Output is correct
47 Correct 50 ms 7320 KB Output is correct