oj.uz

Submission #839303

# Submission time Handle Problem Language Result Execution time Memory
839303 2023-08-29T15:47:57 Z mihaibun Mutating DNA (IOI21_dna) C++17
100 / 100
 29 ms 7380 KB 
using namespace std;

#include "dna.h"
int n,C[4][4][100003];

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

int get_distance(int x, int y) {
    int sol = 0,xa,ya,z,u,v,t;
    xa = C[1][1][y+1]+C[1][2][y+1]+C[1][3][y+1]-C[1][1][x]-C[1][2][x]-C[1][3][x];
    ya = C[2][1][y+1]+C[2][2][y+1]+C[2][3][y+1]-C[2][1][x]-C[2][2][x]-C[2][3][x];
    z = C[3][1][y+1]+C[3][2][y+1]+C[3][3][y+1]-C[3][1][x]-C[3][2][x]-C[3][3][x];
    u = C[1][1][y+1]+C[2][1][y+1]+C[3][1][y+1]-C[1][1][x]-C[2][1][x]-C[3][1][x];
    v = C[2][2][y+1]+C[3][2][y+1]+C[1][2][y+1]-C[2][2][x]-C[3][2][x]-C[1][2][x];
    t = C[1][3][y+1]+C[2][3][y+1]+C[3][3][y+1]-C[1][3][x]-C[2][3][x]-C[3][3][x];
    if((xa==u)and(ya==v)and(z==t)){
        sol = min(C[1][2][y+1]-C[1][2][x],C[2][1][y+1]-C[2][1][x]);
        sol += min(C[1][3][y+1]-C[1][3][x],C[3][1][y+1]-C[3][1][x]);
        sol += min(C[3][2][y+1]-C[3][2][x],C[2][3][y+1]-C[2][3][x]);
        sol += 2*(max(C[1][2][y+1]-C[1][2][x],C[2][1][y+1]-C[2][1][x])-min(C[1][2][y+1]-C[1][2][x],C[2][1][y+1]-C[2][1][x]));
    }
    else sol = -1;
    return sol;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 5652 KB Output is correct
2 Correct 25 ms 5964 KB Output is correct
3 Correct 24 ms 5576 KB Output is correct
4 Correct 25 ms 5964 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 296 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 4564 KB Output is correct
5 Correct 4 ms 4572 KB Output is correct
6 Correct 3 ms 4564 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 3 ms 4564 KB Output is correct
9 Correct 3 ms 4564 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 4564 KB Output is correct
5 Correct 4 ms 4572 KB Output is correct
6 Correct 3 ms 4564 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 3 ms 4564 KB Output is correct
9 Correct 3 ms 4564 KB Output is correct
10 Correct 25 ms 5928 KB Output is correct
11 Correct 24 ms 5928 KB Output is correct
12 Correct 27 ms 6132 KB Output is correct
13 Correct 26 ms 7136 KB Output is correct
14 Correct 26 ms 7380 KB Output is correct
15 Correct 25 ms 7248 KB Output is correct
16 Correct 26 ms 6940 KB Output is correct
17 Correct 25 ms 7144 KB Output is correct
18 Correct 25 ms 7336 KB Output is correct
19 Correct 25 ms 7084 KB Output is correct
20 Correct 24 ms 7120 KB Output is correct
21 Correct 24 ms 7252 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 4564 KB Output is correct
5 Correct 4 ms 4572 KB Output is correct
6 Correct 3 ms 4564 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 3 ms 4564 KB Output is correct
9 Correct 3 ms 4564 KB Output is correct
10 Correct 5 ms 4180 KB Output is correct
11 Correct 4 ms 4568 KB Output is correct
12 Correct 4 ms 4308 KB Output is correct
13 Correct 4 ms 4532 KB Output is correct
14 Correct 4 ms 4564 KB Output is correct
15 Correct 3 ms 4564 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 5652 KB Output is correct
2 Correct 25 ms 5964 KB Output is correct
3 Correct 24 ms 5576 KB Output is correct
4 Correct 25 ms 5964 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 296 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 4564 KB Output is correct
12 Correct 4 ms 4572 KB Output is correct
13 Correct 3 ms 4564 KB Output is correct
14 Correct 3 ms 4308 KB Output is correct
15 Correct 3 ms 4564 KB Output is correct
16 Correct 3 ms 4564 KB Output is correct
17 Correct 25 ms 5928 KB Output is correct
18 Correct 24 ms 5928 KB Output is correct
19 Correct 27 ms 6132 KB Output is correct
20 Correct 26 ms 7136 KB Output is correct
21 Correct 26 ms 7380 KB Output is correct
22 Correct 25 ms 7248 KB Output is correct
23 Correct 26 ms 6940 KB Output is correct
24 Correct 25 ms 7144 KB Output is correct
25 Correct 25 ms 7336 KB Output is correct
26 Correct 25 ms 7084 KB Output is correct
27 Correct 24 ms 7120 KB Output is correct
28 Correct 24 ms 7252 KB Output is correct
29 Correct 5 ms 4180 KB Output is correct
30 Correct 4 ms 4568 KB Output is correct
31 Correct 4 ms 4308 KB Output is correct
32 Correct 4 ms 4532 KB Output is correct
33 Correct 4 ms 4564 KB Output is correct
34 Correct 3 ms 4564 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 25 ms 6616 KB Output is correct
37 Correct 25 ms 7020 KB Output is correct
38 Correct 29 ms 7160 KB Output is correct
39 Correct 27 ms 7348 KB Output is correct
40 Correct 27 ms 7380 KB Output is correct
41 Correct 3 ms 4604 KB Output is correct
42 Correct 26 ms 7060 KB Output is correct
43 Correct 26 ms 7272 KB Output is correct
44 Correct 27 ms 7292 KB Output is correct
45 Correct 26 ms 7188 KB Output is correct
46 Correct 28 ms 7260 KB Output is correct
47 Correct 25 ms 7320 KB Output is correct