oj.uz

Submission #530325

# Submission time Handle Problem Language Result Execution time Memory
530325 2022-02-25T04:57:27 Z gg123_pe Mutating DNA (IOI21_dna) C++17
100 / 100
 43 ms 6468 KB 
#include <bits/stdc++.h>
#include "dna.h"
using namespace std; 

#define f(i,a,b) for(int i = a; i < b; i++)
const int N = 1e5 + 5; 

int n, su[N][6]; 
string s, t; 

void init(string a, string b){
    s = a, t = b, n = a.size();
    f(i,1,n+1){
        f(j,0,6) su[i][j] = su[i-1][j];
        if(s[i-1] == 'A' and t[i-1] == 'C') su[i][0]++; 
        if(s[i-1] == 'A' and t[i-1] == 'T') su[i][1]++; 
        if(s[i-1] == 'C' and t[i-1] == 'A') su[i][2]++; 
        if(s[i-1] == 'C' and t[i-1] == 'T') su[i][3]++; 
        if(s[i-1] == 'T' and t[i-1] == 'A') su[i][4]++;
        if(s[i-1] == 'T' and t[i-1] == 'C') su[i][5]++; 
    }
}
int get_distance(int x, int y){
    x++, y++; 
    int ac, at, ca, ct, ta, tc; 
    ac =su[y][0]-su[x-1][0]; at =su[y][1]-su[x-1][1]; ca =su[y][2]-su[x-1][2];
    ct =su[y][3]-su[x-1][3]; ta =su[y][4]-su[x-1][4]; tc =su[y][5]-su[x-1][5];

    if(ac + at != ca + ta or ct + ca != ac + tc or ta + tc != ct + at) return -1; 
    int add = max(ac, ca) - min(ac, ca), ans;
    ans = min(ac, ca) + min(at, ta) + min(ct, tc); 
    return ans + add*2; 
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 6084 KB Output is correct
2 Correct 31 ms 6060 KB Output is correct
3 Correct 30 ms 5764 KB Output is correct
4 Correct 43 ms 6080 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 3532 KB Output is correct
5 Correct 4 ms 3496 KB Output is correct
6 Correct 4 ms 3512 KB Output is correct
7 Correct 4 ms 3328 KB Output is correct
8 Correct 4 ms 3492 KB Output is correct
9 Correct 3 ms 3516 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 3532 KB Output is correct
5 Correct 4 ms 3496 KB Output is correct
6 Correct 4 ms 3512 KB Output is correct
7 Correct 4 ms 3328 KB Output is correct
8 Correct 4 ms 3492 KB Output is correct
9 Correct 3 ms 3516 KB Output is correct
10 Correct 31 ms 6064 KB Output is correct
11 Correct 30 ms 6028 KB Output is correct
12 Correct 29 ms 6168 KB Output is correct
13 Correct 40 ms 6340 KB Output is correct
14 Correct 35 ms 6456 KB Output is correct
15 Correct 28 ms 6328 KB Output is correct
16 Correct 34 ms 6148 KB Output is correct
17 Correct 27 ms 6216 KB Output is correct
18 Correct 27 ms 6340 KB Output is correct
19 Correct 27 ms 6156 KB Output is correct
20 Correct 33 ms 6212 KB Output is correct
21 Correct 26 ms 6316 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 3532 KB Output is correct
5 Correct 4 ms 3496 KB Output is correct
6 Correct 4 ms 3512 KB Output is correct
7 Correct 4 ms 3328 KB Output is correct
8 Correct 4 ms 3492 KB Output is correct
9 Correct 3 ms 3516 KB Output is correct
10 Correct 4 ms 3200 KB Output is correct
11 Correct 5 ms 3532 KB Output is correct
12 Correct 4 ms 3360 KB Output is correct
13 Correct 5 ms 3512 KB Output is correct
14 Correct 4 ms 3640 KB Output is correct
15 Correct 4 ms 3532 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 6084 KB Output is correct
2 Correct 31 ms 6060 KB Output is correct
3 Correct 30 ms 5764 KB Output is correct
4 Correct 43 ms 6080 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 4 ms 3532 KB Output is correct
12 Correct 4 ms 3496 KB Output is correct
13 Correct 4 ms 3512 KB Output is correct
14 Correct 4 ms 3328 KB Output is correct
15 Correct 4 ms 3492 KB Output is correct
16 Correct 3 ms 3516 KB Output is correct
17 Correct 31 ms 6064 KB Output is correct
18 Correct 30 ms 6028 KB Output is correct
19 Correct 29 ms 6168 KB Output is correct
20 Correct 40 ms 6340 KB Output is correct
21 Correct 35 ms 6456 KB Output is correct
22 Correct 28 ms 6328 KB Output is correct
23 Correct 34 ms 6148 KB Output is correct
24 Correct 27 ms 6216 KB Output is correct
25 Correct 27 ms 6340 KB Output is correct
26 Correct 27 ms 6156 KB Output is correct
27 Correct 33 ms 6212 KB Output is correct
28 Correct 26 ms 6316 KB Output is correct
29 Correct 4 ms 3200 KB Output is correct
30 Correct 5 ms 3532 KB Output is correct
31 Correct 4 ms 3360 KB Output is correct
32 Correct 5 ms 3512 KB Output is correct
33 Correct 4 ms 3640 KB Output is correct
34 Correct 4 ms 3532 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 32 ms 5884 KB Output is correct
37 Correct 38 ms 6056 KB Output is correct
38 Correct 31 ms 6288 KB Output is correct
39 Correct 38 ms 6468 KB Output is correct
40 Correct 32 ms 6468 KB Output is correct
41 Correct 3 ms 3548 KB Output is correct
42 Correct 30 ms 6212 KB Output is correct
43 Correct 30 ms 6312 KB Output is correct
44 Correct 29 ms 6404 KB Output is correct
45 Correct 27 ms 6160 KB Output is correct
46 Correct 28 ms 6328 KB Output is correct
47 Correct 28 ms 6304 KB Output is correct