#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
string q,b;
int get_distance(int x, int y) {
int cnt=0, a=0,t=0,c=0;
for(int i = x ; i <= y ; i++) {
if(q[i] != b[i]) cnt++;
if(q[i]=='A') a++;
else if(q[i] == 'T') t++;
else c++;
if(b[i]=='A') a--;
else if(b[i]=='T') t--;
else c--;
}
return (!a&&!t&&!c?(cnt+1)/2:-1);
}
void init(string aa, string bb) {
q=aa,b=bb;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
53 ms |
2424 KB |
Output is correct |
2 |
Correct |
58 ms |
2364 KB |
Output is correct |
3 |
Correct |
49 ms |
2320 KB |
Output is correct |
4 |
Correct |
36 ms |
2368 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
2 ms |
992 KB |
Output is correct |
5 |
Correct |
2 ms |
972 KB |
Output is correct |
6 |
Correct |
2 ms |
972 KB |
Output is correct |
7 |
Correct |
6 ms |
972 KB |
Output is correct |
8 |
Correct |
7 ms |
972 KB |
Output is correct |
9 |
Correct |
3 ms |
972 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
2 ms |
992 KB |
Output is correct |
5 |
Correct |
2 ms |
972 KB |
Output is correct |
6 |
Correct |
2 ms |
972 KB |
Output is correct |
7 |
Correct |
6 ms |
972 KB |
Output is correct |
8 |
Correct |
7 ms |
972 KB |
Output is correct |
9 |
Correct |
3 ms |
972 KB |
Output is correct |
10 |
Correct |
40 ms |
2356 KB |
Output is correct |
11 |
Correct |
55 ms |
2364 KB |
Output is correct |
12 |
Execution timed out |
1596 ms |
2084 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
2 ms |
992 KB |
Output is correct |
5 |
Correct |
2 ms |
972 KB |
Output is correct |
6 |
Correct |
2 ms |
972 KB |
Output is correct |
7 |
Correct |
6 ms |
972 KB |
Output is correct |
8 |
Correct |
7 ms |
972 KB |
Output is correct |
9 |
Correct |
3 ms |
972 KB |
Output is correct |
10 |
Correct |
2 ms |
972 KB |
Output is correct |
11 |
Correct |
3 ms |
972 KB |
Output is correct |
12 |
Incorrect |
3 ms |
972 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
53 ms |
2424 KB |
Output is correct |
2 |
Correct |
58 ms |
2364 KB |
Output is correct |
3 |
Correct |
49 ms |
2320 KB |
Output is correct |
4 |
Correct |
36 ms |
2368 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
2 ms |
992 KB |
Output is correct |
12 |
Correct |
2 ms |
972 KB |
Output is correct |
13 |
Correct |
2 ms |
972 KB |
Output is correct |
14 |
Correct |
6 ms |
972 KB |
Output is correct |
15 |
Correct |
7 ms |
972 KB |
Output is correct |
16 |
Correct |
3 ms |
972 KB |
Output is correct |
17 |
Correct |
40 ms |
2356 KB |
Output is correct |
18 |
Correct |
55 ms |
2364 KB |
Output is correct |
19 |
Execution timed out |
1596 ms |
2084 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |