#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
using ll = long long;
string A, B;
ll C1[100005][5], C2[100005][5];
ll S[100005][5][5];
ll f(char v){
if(v == 'A') return 1;
if(v == 'T') return 2;
if(v == 'C') return 3;
}
void init(std::string a, std::string b){
A = a, B = b;
A = ' ' + A, B = ' ' + B;
for(int i = 1; i <= A.size(); i++){
for(int j = 1; j <= 3; j++){
C1[i][j] = C1[i - 1][j];
}
C1[i][f(A[i])]++;
}
for(int i = 1; i <= B.size(); i++){
for(int j = 1; j <= 3; j++){
C2[i][j] = C2[i - 1][j];
}
C2[i][f(B[i])]++;
}
for(int i = 1; i <= A.size(); i++){
for(int j = 1; j <= 3; j++){
for(int k = 1; k <= 3; k++){
S[i][j][k] = S[i - 1][j][k];
}
}
S[i][f(A[i])][f(B[i])]++;
}
}
bool Check(ll L, ll R){
for(int i = 1; i <= 3; i++){
if(C1[R][i] - C1[L - 1][i] != C2[R][i] - C2[L - 1][i]){
return 0;
}
}
return 1;
}
int get_distance(int x, int y){
x++, y++;
if(!Check(x, y)) return -1;
vector<vector<ll>> T(5, vector<ll>(5));
for(int i = 1; i <= 3; i++){
for(int j = 1; j <= 3; j++){
T[i][j] = S[y][i][j] - S[x - 1][i][j];
}
}
ll ans = 0;
for(int i = 1; i <= 3; i++){
ll p = i, q = (i == 3 ? 1 : p + 1);
ll K = min(T[p][q], T[q][p]);
ans += K;
T[p][q] -= K;
T[q][p] -= K;
}
ans += max(T[1][2], T[2][1]) * 2;
return ans;
}
Compilation message
dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:17:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
17 | for(int i = 1; i <= A.size(); i++){
| ~~^~~~~~~~~~~
dna.cpp:23:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
23 | for(int i = 1; i <= B.size(); i++){
| ~~^~~~~~~~~~~
dna.cpp:29:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
29 | for(int i = 1; i <= A.size(); i++){
| ~~^~~~~~~~~~~
dna.cpp: In function 'll f(char)':
dna.cpp:13:1: warning: control reaches end of non-void function [-Wreturn-type]
13 | }
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
70 ms |
29636 KB |
Output is correct |
2 |
Correct |
72 ms |
29980 KB |
Output is correct |
3 |
Correct |
68 ms |
27480 KB |
Output is correct |
4 |
Correct |
73 ms |
30016 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
14 ms |
28264 KB |
Output is correct |
5 |
Correct |
17 ms |
28636 KB |
Output is correct |
6 |
Correct |
15 ms |
28464 KB |
Output is correct |
7 |
Correct |
14 ms |
26700 KB |
Output is correct |
8 |
Correct |
14 ms |
28620 KB |
Output is correct |
9 |
Correct |
12 ms |
28620 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
14 ms |
28264 KB |
Output is correct |
5 |
Correct |
17 ms |
28636 KB |
Output is correct |
6 |
Correct |
15 ms |
28464 KB |
Output is correct |
7 |
Correct |
14 ms |
26700 KB |
Output is correct |
8 |
Correct |
14 ms |
28620 KB |
Output is correct |
9 |
Correct |
12 ms |
28620 KB |
Output is correct |
10 |
Correct |
70 ms |
29624 KB |
Output is correct |
11 |
Correct |
73 ms |
30020 KB |
Output is correct |
12 |
Correct |
73 ms |
28404 KB |
Output is correct |
13 |
Correct |
74 ms |
29104 KB |
Output is correct |
14 |
Correct |
75 ms |
30264 KB |
Output is correct |
15 |
Correct |
73 ms |
30276 KB |
Output is correct |
16 |
Correct |
67 ms |
28428 KB |
Output is correct |
17 |
Correct |
68 ms |
29124 KB |
Output is correct |
18 |
Correct |
70 ms |
30352 KB |
Output is correct |
19 |
Correct |
52 ms |
28380 KB |
Output is correct |
20 |
Correct |
52 ms |
29140 KB |
Output is correct |
21 |
Correct |
55 ms |
30336 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
14 ms |
28264 KB |
Output is correct |
5 |
Correct |
17 ms |
28636 KB |
Output is correct |
6 |
Correct |
15 ms |
28464 KB |
Output is correct |
7 |
Correct |
14 ms |
26700 KB |
Output is correct |
8 |
Correct |
14 ms |
28620 KB |
Output is correct |
9 |
Correct |
12 ms |
28620 KB |
Output is correct |
10 |
Correct |
13 ms |
26188 KB |
Output is correct |
11 |
Correct |
14 ms |
28564 KB |
Output is correct |
12 |
Correct |
13 ms |
26700 KB |
Output is correct |
13 |
Correct |
14 ms |
28492 KB |
Output is correct |
14 |
Correct |
15 ms |
28624 KB |
Output is correct |
15 |
Correct |
14 ms |
28616 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
70 ms |
29636 KB |
Output is correct |
2 |
Correct |
72 ms |
29980 KB |
Output is correct |
3 |
Correct |
68 ms |
27480 KB |
Output is correct |
4 |
Correct |
73 ms |
30016 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
14 ms |
28264 KB |
Output is correct |
12 |
Correct |
17 ms |
28636 KB |
Output is correct |
13 |
Correct |
15 ms |
28464 KB |
Output is correct |
14 |
Correct |
14 ms |
26700 KB |
Output is correct |
15 |
Correct |
14 ms |
28620 KB |
Output is correct |
16 |
Correct |
12 ms |
28620 KB |
Output is correct |
17 |
Correct |
70 ms |
29624 KB |
Output is correct |
18 |
Correct |
73 ms |
30020 KB |
Output is correct |
19 |
Correct |
73 ms |
28404 KB |
Output is correct |
20 |
Correct |
74 ms |
29104 KB |
Output is correct |
21 |
Correct |
75 ms |
30264 KB |
Output is correct |
22 |
Correct |
73 ms |
30276 KB |
Output is correct |
23 |
Correct |
67 ms |
28428 KB |
Output is correct |
24 |
Correct |
68 ms |
29124 KB |
Output is correct |
25 |
Correct |
70 ms |
30352 KB |
Output is correct |
26 |
Correct |
52 ms |
28380 KB |
Output is correct |
27 |
Correct |
52 ms |
29140 KB |
Output is correct |
28 |
Correct |
55 ms |
30336 KB |
Output is correct |
29 |
Correct |
13 ms |
26188 KB |
Output is correct |
30 |
Correct |
14 ms |
28564 KB |
Output is correct |
31 |
Correct |
13 ms |
26700 KB |
Output is correct |
32 |
Correct |
14 ms |
28492 KB |
Output is correct |
33 |
Correct |
15 ms |
28624 KB |
Output is correct |
34 |
Correct |
14 ms |
28616 KB |
Output is correct |
35 |
Correct |
0 ms |
204 KB |
Output is correct |
36 |
Correct |
68 ms |
27488 KB |
Output is correct |
37 |
Correct |
79 ms |
30032 KB |
Output is correct |
38 |
Correct |
74 ms |
28664 KB |
Output is correct |
39 |
Correct |
74 ms |
30352 KB |
Output is correct |
40 |
Correct |
74 ms |
30348 KB |
Output is correct |
41 |
Correct |
12 ms |
28544 KB |
Output is correct |
42 |
Correct |
67 ms |
28592 KB |
Output is correct |
43 |
Correct |
68 ms |
30408 KB |
Output is correct |
44 |
Correct |
68 ms |
30348 KB |
Output is correct |
45 |
Correct |
51 ms |
28724 KB |
Output is correct |
46 |
Correct |
53 ms |
30356 KB |
Output is correct |
47 |
Correct |
53 ms |
30404 KB |
Output is correct |