oj.uz

Submission #708049

# Submission time Handle Problem Language Result Execution time Memory
708049 2023-03-10T23:25:39 Z HaroldVemeno Mutating DNA (IOI21_dna) C++17
100 / 100
 60 ms 9740 KB 
#include <bits/stdc++.h>

#ifdef GUDEB
    #define D(x) cerr << #x << ": " << (x) << '\n';
    #define ifdeb if(true)
#else
    #define D(x) ;
    #define ifdeb if(false)
#endif

#define all(x) begin(x), end(x)

using namespace std;
using ull = unsigned long long;
using ll = long long;
// #define int ll;


int dedna(char c) {
    switch(c) {
        break;case 'A':
            return 0;
        break;case 'C':
            return 1;
        break;case 'T':
            return 2;
        break;default:
            return -1;

    }
}

int n;
vector<int> psa[3];
vector<int> psb[3];
vector<int> pss[3][3];

void init(std::string a, std::string b) {
    n = a.size();
    for(auto& ps : psa) {
        ps.resize(n+1);
        ps[0] = 0;
    }
    for(auto& ps : psb) {
        ps.resize(n+1);
        ps[0] = 0;
    }
    for(auto& ps : pss) {
        for(auto& p : ps) {
            p.resize(n+1);
            p[0] = 0;
        }
    }

    for(int j = 0; j < 3; ++j) {
        for(int i = 0; i < n; ++i) {
            psa[j][i+1] = psa[j][i] + (dedna(a[i]) == j);
        }
    }
    for(int j = 0; j < 3; ++j) {
        for(int i = 0; i < n; ++i) {
            psb[j][i+1] = psb[j][i] + (dedna(b[i]) == j);
        }
    }
    for(int j = 0; j < 3; ++j) {
        for(int k = 0; k < 3; ++k) {
            for(int i = 0; i < n; ++i) {
                pss[j][k][i+1] = pss[j][k][i] + (dedna(a[i]) == j && dedna(b[i]) == k);
            }
        }
    }
}
int get_distance(int x, int y) {
    int ca[3];
    for(int i = 0; i < 3; ++i)
        ca[i] = psa[i][y+1] - psa[i][x];
    int cb[3];
    for(int i = 0; i < 3; ++i)
        cb[i] = psb[i][y+1] - psb[i][x];
    for(int i = 0; i < 3; ++i)
        if(ca[i] != cb[i]) return -1;

    int cs[3][3];
    for(int i = 0; i < 3; ++i)
        for(int j = 0; j < 3; ++j) {
            cs[i][j] = pss[i][j][y+1] - pss[i][j][x];
        }

    int lf[3];
    int d = 0;
    for(int i = 0; i < 3; ++i) {
        int o = (i+1)%3;
        int m = min(cs[i][o], cs[o][i]);
        d += m;
        lf[i] = max(cs[i][o], cs[o][i]) - m;
    }
    d += 2*lf[0];
    return d;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 9284 KB Output is correct
2 Correct 46 ms 9360 KB Output is correct
3 Correct 49 ms 8796 KB Output is correct
4 Correct 48 ms 9328 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 9 ms 6928 KB Output is correct
5 Correct 10 ms 6968 KB Output is correct
6 Correct 9 ms 6812 KB Output is correct
7 Correct 9 ms 6440 KB Output is correct
8 Correct 11 ms 6876 KB Output is correct
9 Correct 7 ms 6928 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 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 9 ms 6928 KB Output is correct
5 Correct 10 ms 6968 KB Output is correct
6 Correct 9 ms 6812 KB Output is correct
7 Correct 9 ms 6440 KB Output is correct
8 Correct 11 ms 6876 KB Output is correct
9 Correct 7 ms 6928 KB Output is correct
10 Correct 45 ms 9320 KB Output is correct
11 Correct 46 ms 9312 KB Output is correct
12 Correct 43 ms 9252 KB Output is correct
13 Correct 60 ms 9460 KB Output is correct
14 Correct 45 ms 9704 KB Output is correct
15 Correct 45 ms 9616 KB Output is correct
16 Correct 40 ms 9180 KB Output is correct
17 Correct 41 ms 9388 KB Output is correct
18 Correct 43 ms 9664 KB Output is correct
19 Correct 37 ms 9180 KB Output is correct
20 Correct 42 ms 9444 KB Output is correct
21 Correct 41 ms 9672 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 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 9 ms 6928 KB Output is correct
5 Correct 10 ms 6968 KB Output is correct
6 Correct 9 ms 6812 KB Output is correct
7 Correct 9 ms 6440 KB Output is correct
8 Correct 11 ms 6876 KB Output is correct
9 Correct 7 ms 6928 KB Output is correct
10 Correct 9 ms 6356 KB Output is correct
11 Correct 10 ms 6964 KB Output is correct
12 Correct 9 ms 6528 KB Output is correct
13 Correct 9 ms 6968 KB Output is correct
14 Correct 9 ms 6872 KB Output is correct
15 Correct 11 ms 6968 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 9284 KB Output is correct
2 Correct 46 ms 9360 KB Output is correct
3 Correct 49 ms 8796 KB Output is correct
4 Correct 48 ms 9328 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 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 9 ms 6928 KB Output is correct
12 Correct 10 ms 6968 KB Output is correct
13 Correct 9 ms 6812 KB Output is correct
14 Correct 9 ms 6440 KB Output is correct
15 Correct 11 ms 6876 KB Output is correct
16 Correct 7 ms 6928 KB Output is correct
17 Correct 45 ms 9320 KB Output is correct
18 Correct 46 ms 9312 KB Output is correct
19 Correct 43 ms 9252 KB Output is correct
20 Correct 60 ms 9460 KB Output is correct
21 Correct 45 ms 9704 KB Output is correct
22 Correct 45 ms 9616 KB Output is correct
23 Correct 40 ms 9180 KB Output is correct
24 Correct 41 ms 9388 KB Output is correct
25 Correct 43 ms 9664 KB Output is correct
26 Correct 37 ms 9180 KB Output is correct
27 Correct 42 ms 9444 KB Output is correct
28 Correct 41 ms 9672 KB Output is correct
29 Correct 9 ms 6356 KB Output is correct
30 Correct 10 ms 6964 KB Output is correct
31 Correct 9 ms 6528 KB Output is correct
32 Correct 9 ms 6968 KB Output is correct
33 Correct 9 ms 6872 KB Output is correct
34 Correct 11 ms 6968 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 53 ms 8800 KB Output is correct
37 Correct 51 ms 9360 KB Output is correct
38 Correct 46 ms 9312 KB Output is correct
39 Correct 45 ms 9736 KB Output is correct
40 Correct 48 ms 9740 KB Output is correct
41 Correct 7 ms 6868 KB Output is correct
42 Correct 45 ms 9236 KB Output is correct
43 Correct 52 ms 9608 KB Output is correct
44 Correct 42 ms 9708 KB Output is correct
45 Correct 37 ms 9236 KB Output is correct
46 Correct 38 ms 9712 KB Output is correct
47 Correct 39 ms 9632 KB Output is correct