Submission #841568

# Submission time Handle Problem Language Result Execution time Memory
841568 2023-09-01T17:10:13 Z tigran Mutating DNA (IOI21_dna) C++17
100 / 100
252 ms 5988 KB
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
 
const int N = 1e5 + 5;
 
int same[N];
int n;
vector<int> wa[3], wb[3];
map<string, vector<int>> mp;
 
int get_range(const vector<int>& vec, int l, int r){
	return upper_bound(vec.begin(), vec.end(), r) - lower_bound(vec.begin(), vec.end(), l);
}
 
void init(std::string a, std::string b) {
	n = a.size();
	for (int i = 0; i < n; i++) same[i] = (a[i] == b[i]);
	for (int i = 0; i < n; i++) same[i] += same[i-1];
 
	for (int i = 0; i < n; i++){
		if (a[i] == 'A') wa[0].push_back(i);
		else if (a[i] == 'C') wa[1].push_back(i);
		else wa[2].push_back(i);
	}
 
	for (int i = 0; i < n; i++){
		if (b[i] == 'A') wb[0].push_back(i);
		else if (b[i] == 'C') wb[1].push_back(i);
		else wb[2].push_back(i);
	}
 
	for (int i = 0; i < n; i++){
		string s; s.append(1, a[i]); s.append(1, b[i]);
		mp[s].push_back(i);
	}
}
 
int get_distance(int x, int y) {
	bool ok = true;
	for (int i = 0; i < 3; i++){
		int c1 = get_range(wa[i], x, y);
		int c2 = get_range(wb[i], x, y);
 
		if (c1 != c2) {ok = false; break;}
	}
 
	if (!ok) return -1;
	int len = y-x+1, ans = 0, res;
 
	res = min(get_range(mp["AC"], x, y), get_range(mp["CA"], x, y)); ans += res; len -= 2 * res;
	res = min(get_range(mp["AT"], x, y), get_range(mp["TA"], x, y)); ans += res; len -= 2 * res;
	res = min(get_range(mp["CT"], x, y), get_range(mp["TC"], x, y)); ans += res; len -= 2 * res;
 
	int s = (same[y] - ((x-1 < 0)? 0: same[x-1]));
	len -= s;
	return ans + len/3*2;
 
 
 
}
# Verdict Execution time Memory Grader output
1 Correct 151 ms 5380 KB Output is correct
2 Correct 165 ms 5372 KB Output is correct
3 Correct 244 ms 5180 KB Output is correct
4 Correct 250 ms 5492 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 3076 KB Output is correct
5 Correct 7 ms 2928 KB Output is correct
6 Correct 7 ms 3024 KB Output is correct
7 Correct 7 ms 2744 KB Output is correct
8 Correct 8 ms 2920 KB Output is correct
9 Correct 6 ms 3220 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 3076 KB Output is correct
5 Correct 7 ms 2928 KB Output is correct
6 Correct 7 ms 3024 KB Output is correct
7 Correct 7 ms 2744 KB Output is correct
8 Correct 8 ms 2920 KB Output is correct
9 Correct 6 ms 3220 KB Output is correct
10 Correct 154 ms 5380 KB Output is correct
11 Correct 153 ms 5516 KB Output is correct
12 Correct 155 ms 5624 KB Output is correct
13 Correct 157 ms 5772 KB Output is correct
14 Correct 151 ms 5852 KB Output is correct
15 Correct 154 ms 5568 KB Output is correct
16 Correct 138 ms 5476 KB Output is correct
17 Correct 139 ms 5660 KB Output is correct
18 Correct 139 ms 5860 KB Output is correct
19 Correct 111 ms 5784 KB Output is correct
20 Correct 111 ms 5856 KB Output is correct
21 Correct 112 ms 5656 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 3076 KB Output is correct
5 Correct 7 ms 2928 KB Output is correct
6 Correct 7 ms 3024 KB Output is correct
7 Correct 7 ms 2744 KB Output is correct
8 Correct 8 ms 2920 KB Output is correct
9 Correct 6 ms 3220 KB Output is correct
10 Correct 8 ms 2760 KB Output is correct
11 Correct 9 ms 3096 KB Output is correct
12 Correct 9 ms 3012 KB Output is correct
13 Correct 9 ms 3088 KB Output is correct
14 Correct 8 ms 3132 KB Output is correct
15 Correct 7 ms 3028 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 151 ms 5380 KB Output is correct
2 Correct 165 ms 5372 KB Output is correct
3 Correct 244 ms 5180 KB Output is correct
4 Correct 250 ms 5492 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 7 ms 3076 KB Output is correct
12 Correct 7 ms 2928 KB Output is correct
13 Correct 7 ms 3024 KB Output is correct
14 Correct 7 ms 2744 KB Output is correct
15 Correct 8 ms 2920 KB Output is correct
16 Correct 6 ms 3220 KB Output is correct
17 Correct 154 ms 5380 KB Output is correct
18 Correct 153 ms 5516 KB Output is correct
19 Correct 155 ms 5624 KB Output is correct
20 Correct 157 ms 5772 KB Output is correct
21 Correct 151 ms 5852 KB Output is correct
22 Correct 154 ms 5568 KB Output is correct
23 Correct 138 ms 5476 KB Output is correct
24 Correct 139 ms 5660 KB Output is correct
25 Correct 139 ms 5860 KB Output is correct
26 Correct 111 ms 5784 KB Output is correct
27 Correct 111 ms 5856 KB Output is correct
28 Correct 112 ms 5656 KB Output is correct
29 Correct 8 ms 2760 KB Output is correct
30 Correct 9 ms 3096 KB Output is correct
31 Correct 9 ms 3012 KB Output is correct
32 Correct 9 ms 3088 KB Output is correct
33 Correct 8 ms 3132 KB Output is correct
34 Correct 7 ms 3028 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 234 ms 5168 KB Output is correct
37 Correct 252 ms 5496 KB Output is correct
38 Correct 222 ms 5752 KB Output is correct
39 Correct 238 ms 5988 KB Output is correct
40 Correct 232 ms 5828 KB Output is correct
41 Correct 6 ms 3456 KB Output is correct
42 Correct 213 ms 5668 KB Output is correct
43 Correct 207 ms 5900 KB Output is correct
44 Correct 209 ms 5740 KB Output is correct
45 Correct 147 ms 5936 KB Output is correct
46 Correct 156 ms 5504 KB Output is correct
47 Correct 139 ms 5976 KB Output is correct