Submission #488134

# Submission time Handle Problem Language Result Execution time Memory
488134 2021-11-18T02:32:56 Z 8e7 Mutating DNA (IOI21_dna) C++17
100 / 100
60 ms 6800 KB
//Challenge: Accepted
#include "dna.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#define ll long long
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
struct BIT{
	int bit[maxn];
	void modify(int ind, int val) {
		ind++;
		for (;ind < maxn;ind += ind & (-ind)) bit[ind] += val;
	}
	int query(int ind) {
		ind++;
		int ret = 0;
		for (;ind > 0;ind -= ind & (-ind)) ret += bit[ind];
		return ret;
	}
} b[9];
int s[maxn], t[maxn];
void init(string a, string bb){
	int n = a.size();
	for (int i = 0;i < n;i++) {
		s[i] = (a[i] == 'A' ? 0 : (a[i] == 'T' ? 1 : 2));
		t[i] = (bb[i] == 'A' ? 0 : (bb[i] == 'T' ? 1 : 2));
		b[s[i]*3 + t[i]].modify(i, 1);
	}
}
int get_distance(int l, int r) {
	int type[9];
	for (int i = 0;i < 9;i++) {
		type[i] = b[i].query(r) - b[i].query(l-1);
	}	
	if (type[1] + type[2] != type[3] + type[6] || type[3] + type[5] != type[1] + type[7]) {
		return -1;
	}
	type[0] = type[4] = type[8] = 0;	
	int p[3][2] = {{1, 3}, {2, 6}, {5, 7}};	
	int ans = 0, rem = 0;
	for (int i = 0;i < 3;i++) {
		int val = min(type[p[i][0]], type[p[i][1]]);
		type[p[i][0]] -= val;
		type[p[i][1]] -= val;
		ans += val;
		rem = max(type[p[i][0]], type[p[i][1]]);
	}
	return ans + rem * 2;
}
/*
6 3
ATACAT
ACTATA
1 3
4 5
3 5
*/
# Verdict Execution time Memory Grader output
1 Correct 46 ms 4448 KB Output is correct
2 Correct 47 ms 4460 KB Output is correct
3 Correct 46 ms 6120 KB Output is correct
4 Correct 51 ms 6396 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 6 ms 3224 KB Output is correct
5 Correct 6 ms 3148 KB Output is correct
6 Correct 6 ms 3148 KB Output is correct
7 Correct 7 ms 3020 KB Output is correct
8 Correct 6 ms 3148 KB Output is correct
9 Correct 4 ms 3148 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 6 ms 3224 KB Output is correct
5 Correct 6 ms 3148 KB Output is correct
6 Correct 6 ms 3148 KB Output is correct
7 Correct 7 ms 3020 KB Output is correct
8 Correct 6 ms 3148 KB Output is correct
9 Correct 4 ms 3148 KB Output is correct
10 Correct 46 ms 4468 KB Output is correct
11 Correct 48 ms 4472 KB Output is correct
12 Correct 48 ms 4700 KB Output is correct
13 Correct 48 ms 4776 KB Output is correct
14 Correct 48 ms 4892 KB Output is correct
15 Correct 51 ms 4796 KB Output is correct
16 Correct 44 ms 4692 KB Output is correct
17 Correct 44 ms 4784 KB Output is correct
18 Correct 48 ms 4848 KB Output is correct
19 Correct 42 ms 3948 KB Output is correct
20 Correct 44 ms 4088 KB Output is correct
21 Correct 46 ms 4064 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 6 ms 3224 KB Output is correct
5 Correct 6 ms 3148 KB Output is correct
6 Correct 6 ms 3148 KB Output is correct
7 Correct 7 ms 3020 KB Output is correct
8 Correct 6 ms 3148 KB Output is correct
9 Correct 4 ms 3148 KB Output is correct
10 Correct 6 ms 4812 KB Output is correct
11 Correct 6 ms 5068 KB Output is correct
12 Correct 6 ms 4940 KB Output is correct
13 Correct 7 ms 5196 KB Output is correct
14 Correct 6 ms 5148 KB Output is correct
15 Correct 5 ms 5068 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 46 ms 4448 KB Output is correct
2 Correct 47 ms 4460 KB Output is correct
3 Correct 46 ms 6120 KB Output is correct
4 Correct 51 ms 6396 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 6 ms 3224 KB Output is correct
12 Correct 6 ms 3148 KB Output is correct
13 Correct 6 ms 3148 KB Output is correct
14 Correct 7 ms 3020 KB Output is correct
15 Correct 6 ms 3148 KB Output is correct
16 Correct 4 ms 3148 KB Output is correct
17 Correct 46 ms 4468 KB Output is correct
18 Correct 48 ms 4472 KB Output is correct
19 Correct 48 ms 4700 KB Output is correct
20 Correct 48 ms 4776 KB Output is correct
21 Correct 48 ms 4892 KB Output is correct
22 Correct 51 ms 4796 KB Output is correct
23 Correct 44 ms 4692 KB Output is correct
24 Correct 44 ms 4784 KB Output is correct
25 Correct 48 ms 4848 KB Output is correct
26 Correct 42 ms 3948 KB Output is correct
27 Correct 44 ms 4088 KB Output is correct
28 Correct 46 ms 4064 KB Output is correct
29 Correct 6 ms 4812 KB Output is correct
30 Correct 6 ms 5068 KB Output is correct
31 Correct 6 ms 4940 KB Output is correct
32 Correct 7 ms 5196 KB Output is correct
33 Correct 6 ms 5148 KB Output is correct
34 Correct 5 ms 5068 KB Output is correct
35 Correct 0 ms 460 KB Output is correct
36 Correct 48 ms 6164 KB Output is correct
37 Correct 51 ms 6400 KB Output is correct
38 Correct 60 ms 6608 KB Output is correct
39 Correct 58 ms 6780 KB Output is correct
40 Correct 51 ms 6800 KB Output is correct
41 Correct 5 ms 5144 KB Output is correct
42 Correct 45 ms 6600 KB Output is correct
43 Correct 46 ms 6796 KB Output is correct
44 Correct 48 ms 6800 KB Output is correct
45 Correct 42 ms 4360 KB Output is correct
46 Correct 44 ms 4476 KB Output is correct
47 Correct 47 ms 4476 KB Output is correct