#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
string a,b;
int get_distance(int x, int y) {
string c=a.substr(x,y-x+1),d=b.substr(x,y-x+1);
sort(c.begin(),c.end());
sort(d.begin(),d.end());
if(c!=d) return -1;
int cnt=0;
for(int i = x ; i <= y ; i++) {
if(a[i] != b[i]) cnt++;
}
return (cnt+1)/2;
}
void init(string aa, string bb) {
a=aa,b=bb;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
40 ms |
2368 KB |
Output is correct |
2 |
Correct |
50 ms |
2348 KB |
Output is correct |
3 |
Correct |
42 ms |
2284 KB |
Output is correct |
4 |
Correct |
58 ms |
2356 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 |
972 KB |
Output is correct |
5 |
Correct |
2 ms |
972 KB |
Output is correct |
6 |
Correct |
2 ms |
972 KB |
Output is correct |
7 |
Correct |
15 ms |
1024 KB |
Output is correct |
8 |
Correct |
15 ms |
1080 KB |
Output is correct |
9 |
Correct |
13 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 |
972 KB |
Output is correct |
5 |
Correct |
2 ms |
972 KB |
Output is correct |
6 |
Correct |
2 ms |
972 KB |
Output is correct |
7 |
Correct |
15 ms |
1024 KB |
Output is correct |
8 |
Correct |
15 ms |
1080 KB |
Output is correct |
9 |
Correct |
13 ms |
972 KB |
Output is correct |
10 |
Correct |
40 ms |
2376 KB |
Output is correct |
11 |
Correct |
40 ms |
2372 KB |
Output is correct |
12 |
Execution timed out |
1568 ms |
2116 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 |
972 KB |
Output is correct |
5 |
Correct |
2 ms |
972 KB |
Output is correct |
6 |
Correct |
2 ms |
972 KB |
Output is correct |
7 |
Correct |
15 ms |
1024 KB |
Output is correct |
8 |
Correct |
15 ms |
1080 KB |
Output is correct |
9 |
Correct |
13 ms |
972 KB |
Output is correct |
10 |
Correct |
2 ms |
972 KB |
Output is correct |
11 |
Correct |
2 ms |
972 KB |
Output is correct |
12 |
Incorrect |
2 ms |
972 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
40 ms |
2368 KB |
Output is correct |
2 |
Correct |
50 ms |
2348 KB |
Output is correct |
3 |
Correct |
42 ms |
2284 KB |
Output is correct |
4 |
Correct |
58 ms |
2356 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 |
972 KB |
Output is correct |
12 |
Correct |
2 ms |
972 KB |
Output is correct |
13 |
Correct |
2 ms |
972 KB |
Output is correct |
14 |
Correct |
15 ms |
1024 KB |
Output is correct |
15 |
Correct |
15 ms |
1080 KB |
Output is correct |
16 |
Correct |
13 ms |
972 KB |
Output is correct |
17 |
Correct |
40 ms |
2376 KB |
Output is correct |
18 |
Correct |
40 ms |
2372 KB |
Output is correct |
19 |
Execution timed out |
1568 ms |
2116 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |