oj.uz

Submission #717876

# Submission time Handle Problem Language Result Execution time Memory
717876 2023-04-02T17:32:58 Z duchuy297 Mutating DNA (IOI21_dna) C++17
100 / 100
 39 ms 9768 KB 
#include "dna.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int cnt[2][N][3];
int dif[N][3][3];
int dak[500];
void init(string a, string b) {
	int n = a.size();
	a = "?" + a;
	b = "?" + b;
	dak['A'] = 0;
	dak['T'] = 1;
	dak['C'] = 2;
	for (int i=1; i<=n; i++) {
		for (int j=0; j<3; j++) {
			cnt[0][i][j] = cnt[0][i-1][j];
			cnt[1][i][j] = cnt[1][i-1][j];
		}
		cnt[0][i][dak[a[i]]]++;
		cnt[1][i][dak[b[i]]]++;
		for (int j=0; j<3; j++) {
			for (int k=0; k<3; k++) {
				dif[i][j][k] = dif[i-1][j][k] + (dak[a[i]] == j && dak[b[i]] == k);
			}
		}
	}
}
int get (int id, int l, int r, int u) {
	return cnt[id][r][u] - cnt[id][l-1][u];
}
int get_dif (int l, int r, int u, int v) {
	return dif[r][u][v] - dif[l-1][u][v];
}
int get_distance(int l, int r) {
	l++; r++;
	for (int i=0; i<3; i++) if (get(0,l,r,i) != get (1,l,r,i)) return -1;
	int cnt = r -l + 1;
	int res = 0;
	for (int i=0; i<3; i++) {
		cnt -= get_dif (l,r,i,i);
		for (int j=0; j<i; j++) {
			int val = min (get_dif(l,r,i,j), get_dif(l,r,j,i));
			res += val;
			cnt -= val*2;
		}
	}
	assert(cnt%3==0);
//	cout << cnt << " ??\n";
	res += cnt/3*2;
	return res;
}
/*int main() {
	string a,b; cin >> a >> b;
	init(a,b);
	int q; cin >> q;
	while (q--) {
		int l,r; cin >> l >> r;
		cout << get_distance(l,r) << '\n'; 
	}
}*/

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:20:21: warning: array subscript has type 'char' [-Wchar-subscripts]
   20 |   cnt[0][i][dak[a[i]]]++;
      |                     ^
dna.cpp:21:21: warning: array subscript has type 'char' [-Wchar-subscripts]
   21 |   cnt[1][i][dak[b[i]]]++;
      |                     ^
dna.cpp:24:46: warning: array subscript has type 'char' [-Wchar-subscripts]
   24 |     dif[i][j][k] = dif[i-1][j][k] + (dak[a[i]] == j && dak[b[i]] == k);
      |                                              ^
dna.cpp:24:64: warning: array subscript has type 'char' [-Wchar-subscripts]
   24 |     dif[i][j][k] = dif[i-1][j][k] + (dak[a[i]] == j && dak[b[i]] == k);
      |                                                                ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 7972 KB Output is correct
2 Correct 37 ms 8020 KB Output is correct
3 Correct 35 ms 7472 KB Output is correct
4 Correct 35 ms 8020 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 6 ms 6740 KB Output is correct
5 Correct 9 ms 6740 KB Output is correct
6 Correct 6 ms 6740 KB Output is correct
7 Correct 6 ms 6356 KB Output is correct
8 Correct 7 ms 7056 KB Output is correct
9 Correct 6 ms 6984 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 6 ms 6740 KB Output is correct
5 Correct 9 ms 6740 KB Output is correct
6 Correct 6 ms 6740 KB Output is correct
7 Correct 6 ms 6356 KB Output is correct
8 Correct 7 ms 7056 KB Output is correct
9 Correct 6 ms 6984 KB Output is correct
10 Correct 38 ms 9276 KB Output is correct
11 Correct 38 ms 9452 KB Output is correct
12 Correct 36 ms 9232 KB Output is correct
13 Correct 35 ms 9356 KB Output is correct
14 Correct 38 ms 9748 KB Output is correct
15 Correct 36 ms 9656 KB Output is correct
16 Correct 33 ms 9216 KB Output is correct
17 Correct 34 ms 9320 KB Output is correct
18 Correct 34 ms 9636 KB Output is correct
19 Correct 32 ms 9232 KB Output is correct
20 Correct 33 ms 9400 KB Output is correct
21 Correct 32 ms 9624 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 6 ms 6740 KB Output is correct
5 Correct 9 ms 6740 KB Output is correct
6 Correct 6 ms 6740 KB Output is correct
7 Correct 6 ms 6356 KB Output is correct
8 Correct 7 ms 7056 KB Output is correct
9 Correct 6 ms 6984 KB Output is correct
10 Correct 7 ms 6356 KB Output is correct
11 Correct 7 ms 6980 KB Output is correct
12 Correct 6 ms 6612 KB Output is correct
13 Correct 8 ms 6988 KB Output is correct
14 Correct 6 ms 6996 KB Output is correct
15 Correct 7 ms 6996 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 7972 KB Output is correct
2 Correct 37 ms 8020 KB Output is correct
3 Correct 35 ms 7472 KB Output is correct
4 Correct 35 ms 8020 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 6 ms 6740 KB Output is correct
12 Correct 9 ms 6740 KB Output is correct
13 Correct 6 ms 6740 KB Output is correct
14 Correct 6 ms 6356 KB Output is correct
15 Correct 7 ms 7056 KB Output is correct
16 Correct 6 ms 6984 KB Output is correct
17 Correct 38 ms 9276 KB Output is correct
18 Correct 38 ms 9452 KB Output is correct
19 Correct 36 ms 9232 KB Output is correct
20 Correct 35 ms 9356 KB Output is correct
21 Correct 38 ms 9748 KB Output is correct
22 Correct 36 ms 9656 KB Output is correct
23 Correct 33 ms 9216 KB Output is correct
24 Correct 34 ms 9320 KB Output is correct
25 Correct 34 ms 9636 KB Output is correct
26 Correct 32 ms 9232 KB Output is correct
27 Correct 33 ms 9400 KB Output is correct
28 Correct 32 ms 9624 KB Output is correct
29 Correct 7 ms 6356 KB Output is correct
30 Correct 7 ms 6980 KB Output is correct
31 Correct 6 ms 6612 KB Output is correct
32 Correct 8 ms 6988 KB Output is correct
33 Correct 6 ms 6996 KB Output is correct
34 Correct 7 ms 6996 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 38 ms 8728 KB Output is correct
37 Correct 37 ms 9384 KB Output is correct
38 Correct 35 ms 9344 KB Output is correct
39 Correct 39 ms 9736 KB Output is correct
40 Correct 35 ms 9768 KB Output is correct
41 Correct 6 ms 6996 KB Output is correct
42 Correct 38 ms 9364 KB Output is correct
43 Correct 35 ms 9572 KB Output is correct
44 Correct 34 ms 9628 KB Output is correct
45 Correct 34 ms 9364 KB Output is correct
46 Correct 32 ms 9620 KB Output is correct
47 Correct 36 ms 9760 KB Output is correct