oj.uz

Submission #437104

# Submission time Handle Problem Language Result Execution time Memory
437104 2021-06-25T19:35:44 Z whaleee Mutating DNA (IOI21_dna) C++17
100 / 100
 56 ms 7660 KB 
#include <bits/stdc++.h>
#include "dna.h"
 
int n;
int prefix_cnt_a[100000+1][3];
int prefix_cnt_b[100000+1][3];
int pairs_cnt[100000+1][7];
// int pairs_cnt_b[100000+1][3];
char lst[6][2] = {{'T', 'C'}, {'C', 'T'}, {'A', 'T'}, {'T', 'A'}, {'A', 'C'}, {'C', 'A'}};
 
using namespace std;
 
void init(std::string a, std::string b) {
	n = a.size();
	for(int i=0; i<3; i++) {
		prefix_cnt_a[0][i]=0; 
		prefix_cnt_b[0][i]=0;
		// pairs_cnt_b[0][i]=0;
	}
	for(int i=0; i<6; i++) {
		pairs_cnt[0][i] = 0;
	}
	int bonus;
	int dc,da,dt;
	// int tc,ct,at,ta,ac,ca;
	for(int i=0; i<n;i++) {
		dc=0;da=0;dt=0;
		if (a[i] == 'C') dc=1;
		if (a[i] == 'A') da=1;
		if (a[i] == 'T') dt=1;
		prefix_cnt_a[i+1][0] = prefix_cnt_a[i][0]+dc;
		prefix_cnt_a[i+1][1] = prefix_cnt_a[i][1]+da;
		prefix_cnt_a[i+1][2] = prefix_cnt_a[i][2]+dt;
		dc=0;da=0;dt=0;
		if (b[i] == 'C') dc=1;
		if (b[i] == 'A') da=1;
		if (b[i] == 'T') dt=1;
		prefix_cnt_b[i+1][0] = prefix_cnt_b[i][0]+dc;
		prefix_cnt_b[i+1][1] = prefix_cnt_b[i][1]+da;
		prefix_cnt_b[i+1][2] = prefix_cnt_b[i][2]+dt;
 
		dc=0;da=0;dt=0;
		for (int j=0; j <6; j++) {
			bonus = 0;
			if (a[i] == lst[j][0] && b[i] == lst[j][1]) bonus=1;
			pairs_cnt[i+1][j] = pairs_cnt[i][j] + bonus;
		}
		bonus =0;
		if (a[i] == b[i]) bonus=1;
		pairs_cnt[i+1][6] = pairs_cnt[i][6] + bonus;
		// if (a[i] == 'T' && b[i])
 
	}	
}
 
int get_distance(int x, int y) {
	// cerr << "START\n";
	// cerr << a[x];
	for (int i=0; i<3; i++) {
		// cerr << prefix_cnt_a[y+1][i] << ',' << prefix_cnt_a[x][i] << "," << prefix_cnt_b[y+1][i] << "," <<  prefix_cnt_b[x][i] << '\n';
		if (prefix_cnt_a[y+1][i]-prefix_cnt_a[x][i] != prefix_cnt_b[y+1][i] - prefix_cnt_b[x][i]) {
			return -1;
		}
	}
	// cerr << "HERE\n";
	int tc = pairs_cnt[y+1][0] - pairs_cnt[x][0];
	int ct = pairs_cnt[y+1][1] - pairs_cnt[x][1];
	int at = pairs_cnt[y+1][2] - pairs_cnt[x][2];
	int ta = pairs_cnt[y+1][3] - pairs_cnt[x][3];
	int ac = pairs_cnt[y+1][4] - pairs_cnt[x][4];
	int ca = pairs_cnt[y+1][5] - pairs_cnt[x][5];
	int correct = pairs_cnt[y+1][6] - pairs_cnt[x][6];
 
	int l = y-x + 1;
	int ans = min(tc,ct) + min(at,ta) + min(ac,ca);
	// cerr <<  min(tc,ct)  << "," << min(at,ta) << "," << min(ac,ca) << '\n';
	int rest = l - 2*ans - correct;
	// cerr << "length: " << l  << " and " << rest << "bonus +  " <<(rest+2)/3 <<  '\n';
	ans += 2*(rest/3);
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 7164 KB Output is correct
2 Correct 45 ms 7200 KB Output is correct
3 Correct 42 ms 6772 KB Output is correct
4 Correct 56 ms 7164 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 5836 KB Output is correct
5 Correct 7 ms 5964 KB Output is correct
6 Correct 6 ms 5836 KB Output is correct
7 Correct 6 ms 5580 KB Output is correct
8 Correct 6 ms 5964 KB Output is correct
9 Correct 6 ms 5964 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 5836 KB Output is correct
5 Correct 7 ms 5964 KB Output is correct
6 Correct 6 ms 5836 KB Output is correct
7 Correct 6 ms 5580 KB Output is correct
8 Correct 6 ms 5964 KB Output is correct
9 Correct 6 ms 5964 KB Output is correct
10 Correct 44 ms 7176 KB Output is correct
11 Correct 50 ms 7168 KB Output is correct
12 Correct 44 ms 7160 KB Output is correct
13 Correct 44 ms 7296 KB Output is correct
14 Correct 45 ms 7604 KB Output is correct
15 Correct 44 ms 7528 KB Output is correct
16 Correct 48 ms 7200 KB Output is correct
17 Correct 40 ms 7324 KB Output is correct
18 Correct 40 ms 7528 KB Output is correct
19 Correct 37 ms 7184 KB Output is correct
20 Correct 38 ms 7444 KB Output is correct
21 Correct 40 ms 7608 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 5836 KB Output is correct
5 Correct 7 ms 5964 KB Output is correct
6 Correct 6 ms 5836 KB Output is correct
7 Correct 6 ms 5580 KB Output is correct
8 Correct 6 ms 5964 KB Output is correct
9 Correct 6 ms 5964 KB Output is correct
10 Correct 6 ms 5452 KB Output is correct
11 Correct 7 ms 5896 KB Output is correct
12 Correct 6 ms 5580 KB Output is correct
13 Correct 7 ms 5836 KB Output is correct
14 Correct 7 ms 5964 KB Output is correct
15 Correct 6 ms 5964 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 7164 KB Output is correct
2 Correct 45 ms 7200 KB Output is correct
3 Correct 42 ms 6772 KB Output is correct
4 Correct 56 ms 7164 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 6 ms 5836 KB Output is correct
12 Correct 7 ms 5964 KB Output is correct
13 Correct 6 ms 5836 KB Output is correct
14 Correct 6 ms 5580 KB Output is correct
15 Correct 6 ms 5964 KB Output is correct
16 Correct 6 ms 5964 KB Output is correct
17 Correct 44 ms 7176 KB Output is correct
18 Correct 50 ms 7168 KB Output is correct
19 Correct 44 ms 7160 KB Output is correct
20 Correct 44 ms 7296 KB Output is correct
21 Correct 45 ms 7604 KB Output is correct
22 Correct 44 ms 7528 KB Output is correct
23 Correct 48 ms 7200 KB Output is correct
24 Correct 40 ms 7324 KB Output is correct
25 Correct 40 ms 7528 KB Output is correct
26 Correct 37 ms 7184 KB Output is correct
27 Correct 38 ms 7444 KB Output is correct
28 Correct 40 ms 7608 KB Output is correct
29 Correct 6 ms 5452 KB Output is correct
30 Correct 7 ms 5896 KB Output is correct
31 Correct 6 ms 5580 KB Output is correct
32 Correct 7 ms 5836 KB Output is correct
33 Correct 7 ms 5964 KB Output is correct
34 Correct 6 ms 5964 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 41 ms 6764 KB Output is correct
37 Correct 50 ms 7172 KB Output is correct
38 Correct 46 ms 7308 KB Output is correct
39 Correct 44 ms 7548 KB Output is correct
40 Correct 44 ms 7560 KB Output is correct
41 Correct 6 ms 5964 KB Output is correct
42 Correct 45 ms 7308 KB Output is correct
43 Correct 41 ms 7556 KB Output is correct
44 Correct 41 ms 7580 KB Output is correct
45 Correct 39 ms 7284 KB Output is correct
46 Correct 41 ms 7552 KB Output is correct
47 Correct 40 ms 7660 KB Output is correct