# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
969058 |
2024-04-24T12:43:24 Z |
andro |
Mutating DNA (IOI21_dna) |
C++17 |
|
1500 ms |
3228 KB |
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
string A, B;
void init(std::string a, std::string b) {
A = a;
B = b;
}
int get_distance(int x, int y) {
int ans = 0;
map<int,int> M, M1;
for(int i = x; i <= y; i++) {
if(A[i] != B[i]) {
ans += 1;
}
M[A[i]] += 1;
M1[B[i]] += 1;
}
if(M['A'] != M1['A'] || M['T'] != M1['T']) {
return - 1;
}
else {
return ans / 2;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
2640 KB |
Output is correct |
2 |
Correct |
34 ms |
3148 KB |
Output is correct |
3 |
Incorrect |
36 ms |
3100 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
1232 KB |
Output is correct |
5 |
Correct |
1 ms |
1116 KB |
Output is correct |
6 |
Correct |
1 ms |
1216 KB |
Output is correct |
7 |
Correct |
6 ms |
1116 KB |
Output is correct |
8 |
Correct |
6 ms |
1212 KB |
Output is correct |
9 |
Correct |
5 ms |
1112 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
1232 KB |
Output is correct |
5 |
Correct |
1 ms |
1116 KB |
Output is correct |
6 |
Correct |
1 ms |
1216 KB |
Output is correct |
7 |
Correct |
6 ms |
1116 KB |
Output is correct |
8 |
Correct |
6 ms |
1212 KB |
Output is correct |
9 |
Correct |
5 ms |
1112 KB |
Output is correct |
10 |
Correct |
34 ms |
3228 KB |
Output is correct |
11 |
Correct |
34 ms |
3164 KB |
Output is correct |
12 |
Execution timed out |
1530 ms |
3160 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
1232 KB |
Output is correct |
5 |
Correct |
1 ms |
1116 KB |
Output is correct |
6 |
Correct |
1 ms |
1216 KB |
Output is correct |
7 |
Correct |
6 ms |
1116 KB |
Output is correct |
8 |
Correct |
6 ms |
1212 KB |
Output is correct |
9 |
Correct |
5 ms |
1112 KB |
Output is correct |
10 |
Incorrect |
1 ms |
1116 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
2640 KB |
Output is correct |
2 |
Correct |
34 ms |
3148 KB |
Output is correct |
3 |
Incorrect |
36 ms |
3100 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |