oj.uz

Submission #567440

# Submission time Handle Problem Language Result Execution time Memory
567440 2022-05-23T13:03:24 Z losmi247 Mutating DNA (IOI21_dna) C++17
100 / 100
 66 ms 10888 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+23;

int n;
int a[N],b[N];
int pref[N][4][4];

void init(string s,string t){
    n = s.size();
    for(int i = 1; i <= n; i++){
        if(s[i-1] == 'A') a[i] = 1;
        else if(s[i-1] == 'C') a[i] = 2;
        else a[i] = 3;
        if(t[i-1] == 'A') b[i] = 1;
        else if(t[i-1] == 'C') b[i] = 2;
        else b[i] = 3;
    }

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

int sta[4][4];
int get_distance(int x,int y){
    x++;
    y++;
    for(int i = 1; i <= 3; i++){
        for(int j = 1; j <= 3; j++){
            sta[i][j] = pref[y][i][j]-pref[x-1][i][j];
        }
    }

    for(int i = 1; i <= 3; i++){
        int s1 = 0;
        for(int j = 1; j <= 3; j++) s1 += sta[i][j];
        int s2 = 0;
        for(int j = 1; j <= 3; j++) s2 += sta[j][i];
        if(s1 != s2){
            return -1;
        }
    }

    int v1 = min(sta[1][2],sta[2][1]);
    int v2 = min(sta[2][3],sta[3][2]);
    int v3 = min(sta[1][3],sta[3][1]);
    int dod = 2*abs(sta[1][2]-sta[2][1]);

    return v1+v2+v3+dod;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 10392 KB Output is correct
2 Correct 48 ms 10516 KB Output is correct
3 Correct 43 ms 9804 KB Output is correct
4 Correct 66 ms 10548 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 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 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 8004 KB Output is correct
5 Correct 7 ms 8020 KB Output is correct
6 Correct 9 ms 8020 KB Output is correct
7 Correct 7 ms 7508 KB Output is correct
8 Correct 8 ms 8124 KB Output is correct
9 Correct 7 ms 8124 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 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 8004 KB Output is correct
5 Correct 7 ms 8020 KB Output is correct
6 Correct 9 ms 8020 KB Output is correct
7 Correct 7 ms 7508 KB Output is correct
8 Correct 8 ms 8124 KB Output is correct
9 Correct 7 ms 8124 KB Output is correct
10 Correct 59 ms 10404 KB Output is correct
11 Correct 45 ms 10508 KB Output is correct
12 Correct 64 ms 10344 KB Output is correct
13 Correct 57 ms 10588 KB Output is correct
14 Correct 49 ms 10888 KB Output is correct
15 Correct 45 ms 10764 KB Output is correct
16 Correct 44 ms 10264 KB Output is correct
17 Correct 47 ms 10448 KB Output is correct
18 Correct 41 ms 10784 KB Output is correct
19 Correct 55 ms 10340 KB Output is correct
20 Correct 41 ms 10424 KB Output is correct
21 Correct 52 ms 10872 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 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 8004 KB Output is correct
5 Correct 7 ms 8020 KB Output is correct
6 Correct 9 ms 8020 KB Output is correct
7 Correct 7 ms 7508 KB Output is correct
8 Correct 8 ms 8124 KB Output is correct
9 Correct 7 ms 8124 KB Output is correct
10 Correct 8 ms 7380 KB Output is correct
11 Correct 8 ms 8020 KB Output is correct
12 Correct 9 ms 7508 KB Output is correct
13 Correct 11 ms 7992 KB Output is correct
14 Correct 8 ms 8032 KB Output is correct
15 Correct 9 ms 8252 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 10392 KB Output is correct
2 Correct 48 ms 10516 KB Output is correct
3 Correct 43 ms 9804 KB Output is correct
4 Correct 66 ms 10548 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 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 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 7 ms 8004 KB Output is correct
12 Correct 7 ms 8020 KB Output is correct
13 Correct 9 ms 8020 KB Output is correct
14 Correct 7 ms 7508 KB Output is correct
15 Correct 8 ms 8124 KB Output is correct
16 Correct 7 ms 8124 KB Output is correct
17 Correct 59 ms 10404 KB Output is correct
18 Correct 45 ms 10508 KB Output is correct
19 Correct 64 ms 10344 KB Output is correct
20 Correct 57 ms 10588 KB Output is correct
21 Correct 49 ms 10888 KB Output is correct
22 Correct 45 ms 10764 KB Output is correct
23 Correct 44 ms 10264 KB Output is correct
24 Correct 47 ms 10448 KB Output is correct
25 Correct 41 ms 10784 KB Output is correct
26 Correct 55 ms 10340 KB Output is correct
27 Correct 41 ms 10424 KB Output is correct
28 Correct 52 ms 10872 KB Output is correct
29 Correct 8 ms 7380 KB Output is correct
30 Correct 8 ms 8020 KB Output is correct
31 Correct 9 ms 7508 KB Output is correct
32 Correct 11 ms 7992 KB Output is correct
33 Correct 8 ms 8032 KB Output is correct
34 Correct 9 ms 8252 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 51 ms 9792 KB Output is correct
37 Correct 43 ms 10532 KB Output is correct
38 Correct 48 ms 10468 KB Output is correct
39 Correct 47 ms 10856 KB Output is correct
40 Correct 44 ms 10860 KB Output is correct
41 Correct 6 ms 8132 KB Output is correct
42 Correct 49 ms 10348 KB Output is correct
43 Correct 42 ms 10760 KB Output is correct
44 Correct 59 ms 10808 KB Output is correct
45 Correct 39 ms 10388 KB Output is correct
46 Correct 40 ms 10760 KB Output is correct
47 Correct 47 ms 10776 KB Output is correct