# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
548795 |
2022-04-14T12:09:56 Z |
esomer |
Mutating DNA (IOI21_dna) |
C++17 |
|
71 ms |
11820 KB |
#include<bits/stdc++.h>
#include "dna.h"
using namespace std;
vector<tuple<int, int, int>> prefix1;
vector<tuple<int, int, int>> prefix2;
vector<vector<int>> prefix;
int n;
void init(string a, string b) {
n = a.size();
prefix.assign(n, vector<int> (6, 0));
prefix1.resize(n);
prefix2.resize(n);
for(int i = 0; i < n; i++){
if(i == 0){
prefix1[i] = {0, 0, 0};
prefix2[i] = {0, 0, 0};
if(a[i] == 'A'){
get<0> (prefix1[i])++;
}else if(a[i] == 'T'){
get<1>(prefix1[i])++;
}else get<2> (prefix1[i])++;
if(b[i] == 'A'){
get<0> (prefix2[i])++;
}else if(b[i] == 'T'){
get<1>(prefix2[i])++;
}else get<2> (prefix2[i])++;
}else{
prefix1[i] = prefix1[i - 1];
prefix2[i] = prefix2[i - 1];
if(a[i] == 'A'){
get<0> (prefix1[i])++;
}else if(a[i] == 'T'){
get<1>(prefix1[i])++;
}else get<2> (prefix1[i])++;
if(b[i] == 'A'){
get<0> (prefix2[i])++;
}else if(b[i] == 'T'){
get<1>(prefix2[i])++;
}else get<2> (prefix2[i])++;
}
if(i == 0){
if(a[i] != b[i]){
if(a[i] == 'A'){
if(b[i] == 'T') prefix[i][0]++;
else prefix[i][1]++;
}else if(a[i] == 'T'){
if(b[i] == 'A') prefix[i][2]++;
else prefix[i][3]++;
}else{
if(b[i] == 'A') prefix[i][4]++;
else prefix[i][5]++;
}
}
}else{
prefix[i] = prefix[i-1];
if(a[i] != b[i]){
if(a[i] == 'A'){
if(b[i] == 'T') prefix[i][0]++;
else prefix[i][1]++;
}else if(a[i] == 'T'){
if(b[i] == 'A') prefix[i][2]++;
else prefix[i][3]++;
}else{
if(b[i] == 'A') prefix[i][4]++;
else prefix[i][5]++;
}
}
}
}
}
int get_distance(int x, int y) {
int da, db;
if(x > 0) da = get<0> (prefix1[y]) - get<0> (prefix1[x-1]);
else da = get<0> (prefix1[y]);
if(x > 0) db = get<0> (prefix2[y]) - get<0> (prefix2[x-1]);
else db = get<0> (prefix2[y]);
if(da != db) return -1;
if(x > 0) da = get<1> (prefix1[y]) - get<1> (prefix1[x-1]);
else da = get<1> (prefix1[y]);
if(x > 0) db = get<1> (prefix2[y]) - get<1> (prefix2[x-1]);
else db = get<1> (prefix2[y]);
if(da != db) return -1;
if(x > 0) da = get<2> (prefix1[y]) - get<2> (prefix1[x-1]);
else da = get<2> (prefix1[y]);
if(x > 0) db = get<2> (prefix2[y]) - get<2> (prefix2[x-1]);
else db = get<2> (prefix2[y]);
if(da != db) return -1;
vector<int> v(6);
for(int i = 0; i < 6; i++){
if(x > 0) v[i] = prefix[y][i] - prefix[x-1][i];
else v[i] = prefix[y][i];
}
int ans = 0;
ans += min(v[1], v[4]);
int twos = max(v[1], v[4]) - min(v[1], v[4]);
ans += 2 * twos;
ans += min(v[0], v[2]);
ans += min(v[3], v[5]);
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
47 ms |
11304 KB |
Output is correct |
2 |
Correct |
48 ms |
11320 KB |
Output is correct |
3 |
Correct |
50 ms |
10636 KB |
Output is correct |
4 |
Correct |
47 ms |
11352 KB |
Output is correct |
5 |
Correct |
1 ms |
296 KB |
Output is correct |
6 |
Correct |
1 ms |
296 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
304 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
10 ms |
8756 KB |
Output is correct |
5 |
Correct |
11 ms |
8916 KB |
Output is correct |
6 |
Correct |
12 ms |
8788 KB |
Output is correct |
7 |
Correct |
11 ms |
8264 KB |
Output is correct |
8 |
Correct |
11 ms |
8892 KB |
Output is correct |
9 |
Correct |
10 ms |
8924 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
304 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
10 ms |
8756 KB |
Output is correct |
5 |
Correct |
11 ms |
8916 KB |
Output is correct |
6 |
Correct |
12 ms |
8788 KB |
Output is correct |
7 |
Correct |
11 ms |
8264 KB |
Output is correct |
8 |
Correct |
11 ms |
8892 KB |
Output is correct |
9 |
Correct |
10 ms |
8924 KB |
Output is correct |
10 |
Correct |
49 ms |
11304 KB |
Output is correct |
11 |
Correct |
52 ms |
11408 KB |
Output is correct |
12 |
Correct |
53 ms |
11128 KB |
Output is correct |
13 |
Correct |
50 ms |
11292 KB |
Output is correct |
14 |
Correct |
71 ms |
11704 KB |
Output is correct |
15 |
Correct |
68 ms |
11696 KB |
Output is correct |
16 |
Correct |
44 ms |
11036 KB |
Output is correct |
17 |
Correct |
43 ms |
11276 KB |
Output is correct |
18 |
Correct |
44 ms |
11600 KB |
Output is correct |
19 |
Correct |
40 ms |
11104 KB |
Output is correct |
20 |
Correct |
44 ms |
11236 KB |
Output is correct |
21 |
Correct |
43 ms |
11704 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
304 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
10 ms |
8756 KB |
Output is correct |
5 |
Correct |
11 ms |
8916 KB |
Output is correct |
6 |
Correct |
12 ms |
8788 KB |
Output is correct |
7 |
Correct |
11 ms |
8264 KB |
Output is correct |
8 |
Correct |
11 ms |
8892 KB |
Output is correct |
9 |
Correct |
10 ms |
8924 KB |
Output is correct |
10 |
Correct |
10 ms |
8148 KB |
Output is correct |
11 |
Correct |
11 ms |
8916 KB |
Output is correct |
12 |
Correct |
11 ms |
8252 KB |
Output is correct |
13 |
Correct |
12 ms |
8740 KB |
Output is correct |
14 |
Correct |
14 ms |
8920 KB |
Output is correct |
15 |
Correct |
11 ms |
8780 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
47 ms |
11304 KB |
Output is correct |
2 |
Correct |
48 ms |
11320 KB |
Output is correct |
3 |
Correct |
50 ms |
10636 KB |
Output is correct |
4 |
Correct |
47 ms |
11352 KB |
Output is correct |
5 |
Correct |
1 ms |
296 KB |
Output is correct |
6 |
Correct |
1 ms |
296 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
304 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
336 KB |
Output is correct |
11 |
Correct |
10 ms |
8756 KB |
Output is correct |
12 |
Correct |
11 ms |
8916 KB |
Output is correct |
13 |
Correct |
12 ms |
8788 KB |
Output is correct |
14 |
Correct |
11 ms |
8264 KB |
Output is correct |
15 |
Correct |
11 ms |
8892 KB |
Output is correct |
16 |
Correct |
10 ms |
8924 KB |
Output is correct |
17 |
Correct |
49 ms |
11304 KB |
Output is correct |
18 |
Correct |
52 ms |
11408 KB |
Output is correct |
19 |
Correct |
53 ms |
11128 KB |
Output is correct |
20 |
Correct |
50 ms |
11292 KB |
Output is correct |
21 |
Correct |
71 ms |
11704 KB |
Output is correct |
22 |
Correct |
68 ms |
11696 KB |
Output is correct |
23 |
Correct |
44 ms |
11036 KB |
Output is correct |
24 |
Correct |
43 ms |
11276 KB |
Output is correct |
25 |
Correct |
44 ms |
11600 KB |
Output is correct |
26 |
Correct |
40 ms |
11104 KB |
Output is correct |
27 |
Correct |
44 ms |
11236 KB |
Output is correct |
28 |
Correct |
43 ms |
11704 KB |
Output is correct |
29 |
Correct |
10 ms |
8148 KB |
Output is correct |
30 |
Correct |
11 ms |
8916 KB |
Output is correct |
31 |
Correct |
11 ms |
8252 KB |
Output is correct |
32 |
Correct |
12 ms |
8740 KB |
Output is correct |
33 |
Correct |
14 ms |
8920 KB |
Output is correct |
34 |
Correct |
11 ms |
8780 KB |
Output is correct |
35 |
Correct |
1 ms |
212 KB |
Output is correct |
36 |
Correct |
51 ms |
10564 KB |
Output is correct |
37 |
Correct |
50 ms |
11352 KB |
Output is correct |
38 |
Correct |
59 ms |
11164 KB |
Output is correct |
39 |
Correct |
61 ms |
11680 KB |
Output is correct |
40 |
Correct |
65 ms |
11820 KB |
Output is correct |
41 |
Correct |
10 ms |
8916 KB |
Output is correct |
42 |
Correct |
43 ms |
11172 KB |
Output is correct |
43 |
Correct |
51 ms |
11680 KB |
Output is correct |
44 |
Correct |
49 ms |
11596 KB |
Output is correct |
45 |
Correct |
39 ms |
11084 KB |
Output is correct |
46 |
Correct |
42 ms |
11700 KB |
Output is correct |
47 |
Correct |
44 ms |
11648 KB |
Output is correct |