oj.uz

Submission #569058

# Submission time Handle Problem Language Result Execution time Memory
569058 2022-05-26T14:34:47 Z MEGalodon Mutating DNA (IOI21_dna) C++17
100 / 100
 44 ms 10888 KB 
#include "dna.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(std::string s, std::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 36 ms 10380 KB Output is correct
2 Correct 37 ms 10504 KB Output is correct
3 Correct 39 ms 9816 KB Output is correct
4 Correct 39 ms 10496 KB Output is correct
5 Correct 0 ms 300 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 7968 KB Output is correct
5 Correct 7 ms 8120 KB Output is correct
6 Correct 8 ms 8020 KB Output is correct
7 Correct 8 ms 7508 KB Output is correct
8 Correct 7 ms 8120 KB Output is correct
9 Correct 5 ms 8020 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 7968 KB Output is correct
5 Correct 7 ms 8120 KB Output is correct
6 Correct 8 ms 8020 KB Output is correct
7 Correct 8 ms 7508 KB Output is correct
8 Correct 7 ms 8120 KB Output is correct
9 Correct 5 ms 8020 KB Output is correct
10 Correct 44 ms 10444 KB Output is correct
11 Correct 38 ms 10516 KB Output is correct
12 Correct 36 ms 10320 KB Output is correct
13 Correct 36 ms 10516 KB Output is correct
14 Correct 40 ms 10872 KB Output is correct
15 Correct 37 ms 10836 KB Output is correct
16 Correct 33 ms 10260 KB Output is correct
17 Correct 38 ms 10452 KB Output is correct
18 Correct 34 ms 10732 KB Output is correct
19 Correct 33 ms 10188 KB Output is correct
20 Correct 31 ms 10476 KB Output is correct
21 Correct 33 ms 10848 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 7968 KB Output is correct
5 Correct 7 ms 8120 KB Output is correct
6 Correct 8 ms 8020 KB Output is correct
7 Correct 8 ms 7508 KB Output is correct
8 Correct 7 ms 8120 KB Output is correct
9 Correct 5 ms 8020 KB Output is correct
10 Correct 8 ms 7380 KB Output is correct
11 Correct 8 ms 8024 KB Output is correct
12 Correct 7 ms 7600 KB Output is correct
13 Correct 7 ms 8020 KB Output is correct
14 Correct 8 ms 8020 KB Output is correct
15 Correct 7 ms 8048 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 10380 KB Output is correct
2 Correct 37 ms 10504 KB Output is correct
3 Correct 39 ms 9816 KB Output is correct
4 Correct 39 ms 10496 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 6 ms 7968 KB Output is correct
12 Correct 7 ms 8120 KB Output is correct
13 Correct 8 ms 8020 KB Output is correct
14 Correct 8 ms 7508 KB Output is correct
15 Correct 7 ms 8120 KB Output is correct
16 Correct 5 ms 8020 KB Output is correct
17 Correct 44 ms 10444 KB Output is correct
18 Correct 38 ms 10516 KB Output is correct
19 Correct 36 ms 10320 KB Output is correct
20 Correct 36 ms 10516 KB Output is correct
21 Correct 40 ms 10872 KB Output is correct
22 Correct 37 ms 10836 KB Output is correct
23 Correct 33 ms 10260 KB Output is correct
24 Correct 38 ms 10452 KB Output is correct
25 Correct 34 ms 10732 KB Output is correct
26 Correct 33 ms 10188 KB Output is correct
27 Correct 31 ms 10476 KB Output is correct
28 Correct 33 ms 10848 KB Output is correct
29 Correct 8 ms 7380 KB Output is correct
30 Correct 8 ms 8024 KB Output is correct
31 Correct 7 ms 7600 KB Output is correct
32 Correct 7 ms 8020 KB Output is correct
33 Correct 8 ms 8020 KB Output is correct
34 Correct 7 ms 8048 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 36 ms 9804 KB Output is correct
37 Correct 36 ms 10484 KB Output is correct
38 Correct 43 ms 10404 KB Output is correct
39 Correct 37 ms 10888 KB Output is correct
40 Correct 38 ms 10808 KB Output is correct
41 Correct 6 ms 8020 KB Output is correct
42 Correct 35 ms 10340 KB Output is correct
43 Correct 35 ms 10844 KB Output is correct
44 Correct 33 ms 10760 KB Output is correct
45 Correct 32 ms 10336 KB Output is correct
46 Correct 33 ms 10824 KB Output is correct
47 Correct 32 ms 10760 KB Output is correct