oj.uz

Submission #809227

# Submission time Handle Problem Language Result Execution time Memory
809227 2023-08-05T22:26:57 Z OAleksa Mutating DNA (IOI21_dna) C++17
100 / 100
 38 ms 8560 KB 
#include <bits/stdc++.h>
#include "dna.h"
 
#define f first
#define s second
using namespace std; 

const int maxn = 1e5 + 69;
vector<int> pa1(maxn), pc1(maxn), pt1(maxn);
vector<int> pa2(maxn), pc2(maxn), pt2(maxn);
vector<int> at(maxn), ac(maxn), ca(maxn), ct(maxn);
vector<int> ta(maxn), tc(maxn);
void init(string a, string b) {
	int n = a.size();
	pa1[0] = (a[0] == 'A');
	pc1[0] = (a[0] == 'C');
	pt1[0] = (a[0] == 'T');
	pa2[0] = (b[0] == 'A');
	pc2[0] = (b[0] == 'C');
	pt2[0] = (b[0] == 'T');
	at[0] = (a[0] == 'A' && b[0] == 'T');
	ac[0] = (a[0] == 'A' && b[0] == 'C');
	ca[0] = (a[0] == 'C' && b[0] == 'A');
	ct[0] = (a[0] == 'C' && b[0] == 'T');
	ta[0] = (a[0] == 'T' && b[0] == 'A');
	tc[0] = (a[0] == 'T' && b[0] == 'C');
	for(int i = 1;i < n;i++) {
		pa1[i] = pa1[i - 1] + (a[i] == 'A');
		pc1[i] = pc1[i - 1] + (a[i] == 'C');
		pt1[i] = pt1[i - 1] + (a[i] == 'T');
		pa2[i] = pa2[i - 1] + (b[i] == 'A');
		pc2[i] = pc2[i - 1] + (b[i] == 'C');
		pt2[i] = pt2[i - 1] + (b[i] == 'T');
		at[i] = at[i - 1] + (a[i] == 'A' && b[i] == 'T');
		ac[i] = ac[i - 1] + (a[i] == 'A' && b[i] == 'C');
		ca[i] = ca[i - 1] + (a[i] == 'C' && b[i] == 'A');
		ct[i] = ct[i - 1] + (a[i] == 'C' && b[i] == 'T');
		ta[i] = ta[i - 1] + (a[i] == 'T' && b[i] == 'A');
		tc[i] = tc[i - 1] + (a[i] == 'T' && b[i] == 'C');
	}
}

int get_distance(int x, int y) {
	int ans = 0;
	int x1 = pa1[y] - (x == 0 ? 0 : pa1[x - 1]);
	int x2 = pc1[y] - (x == 0 ? 0 : pc1[x - 1]);
	int x3 = pt1[y] - (x == 0 ? 0 : pt1[x - 1]);
	int x4 = pa2[y] - (x == 0 ? 0 : pa2[x - 1]);
	int x5 = pc2[y] - (x == 0 ? 0 : pc2[x - 1]);
	int x6 = pt2[y] - (x == 0 ? 0 : pt2[x - 1]);
	if(x1 != x4 || x2 != x5 || x3 != x6)
		ans = -1;
	else {
		int ac1, at1, ca1, ct1, ta1, tc1;
		ac1 = ac[y] - (x == 0 ? 0 : ac[x - 1]);
		at1 = at[y] - (x == 0 ? 0 : at[x - 1]);
		ca1 = ca[y] - (x == 0 ? 0 : ca[x - 1]);
		ct1 = ct[y] - (x == 0 ? 0 : ct[x - 1]);
		ta1 = ta[y] - (x == 0 ? 0 : ta[x - 1]);
		tc1 = tc[y] - (x == 0 ? 0 : tc[x - 1]);
		if(ac1 < ca1)
			swap(ac1, ca1);
		if(at1 < ta1)
			swap(ta1, at1);
		if(ct1 < tc1)
			swap(ct1, tc1);
		ans += ca1 + ta1 + tc1;
		ac1 -= ca1;
		at1 -= ta1;
		ct1 -= tc1;
		ca1 = ta1 = tc1 = 0;
		int a = ac1 + ca1 + ta1 + at1;
		int c = ca1 + ct1 + ac1 + tc1;
		int t = ta1 + tc1 + at1 + ct1;
		ans += max({a, c, t});
	}
	return ans;
}

//  
// int main()
// {
	  // ios_base::sync_with_stdio(false);
	  // cin.tie(0);
	  // cout.tie(0);
	  // int tt = 1;
		// //cin >> tt;
	  // while(tt--) {
			// int n, q;
			// cin >> n >> q;
			// string a, b;
			// cin >> a >> b;
			// init(a, b);
			// for(int i = 0;i < q;i++) {
				// int l, r;
				// cin >> l >> r;
				// cout << get_distance(l, r) << endl;
			// }
		// }
    // return 0;
// }

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 8172 KB Output is correct
2 Correct 35 ms 8160 KB Output is correct
3 Correct 34 ms 8092 KB Output is correct
4 Correct 35 ms 8156 KB Output is correct
5 Correct 3 ms 5028 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 5024 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5024 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 11 ms 5800 KB Output is correct
5 Correct 11 ms 5716 KB Output is correct
6 Correct 11 ms 5716 KB Output is correct
7 Correct 11 ms 5700 KB Output is correct
8 Correct 11 ms 5716 KB Output is correct
9 Correct 11 ms 5716 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5024 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 11 ms 5800 KB Output is correct
5 Correct 11 ms 5716 KB Output is correct
6 Correct 11 ms 5716 KB Output is correct
7 Correct 11 ms 5700 KB Output is correct
8 Correct 11 ms 5716 KB Output is correct
9 Correct 11 ms 5716 KB Output is correct
10 Correct 35 ms 8200 KB Output is correct
11 Correct 36 ms 8156 KB Output is correct
12 Correct 36 ms 8428 KB Output is correct
13 Correct 36 ms 8536 KB Output is correct
14 Correct 37 ms 8560 KB Output is correct
15 Correct 37 ms 8456 KB Output is correct
16 Correct 35 ms 8392 KB Output is correct
17 Correct 35 ms 8388 KB Output is correct
18 Correct 36 ms 8456 KB Output is correct
19 Correct 35 ms 8392 KB Output is correct
20 Correct 36 ms 8452 KB Output is correct
21 Correct 37 ms 8532 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5024 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 11 ms 5800 KB Output is correct
5 Correct 11 ms 5716 KB Output is correct
6 Correct 11 ms 5716 KB Output is correct
7 Correct 11 ms 5700 KB Output is correct
8 Correct 11 ms 5716 KB Output is correct
9 Correct 11 ms 5716 KB Output is correct
10 Correct 10 ms 5716 KB Output is correct
11 Correct 11 ms 5752 KB Output is correct
12 Correct 10 ms 5648 KB Output is correct
13 Correct 11 ms 5804 KB Output is correct
14 Correct 11 ms 5716 KB Output is correct
15 Correct 11 ms 5804 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 8172 KB Output is correct
2 Correct 35 ms 8160 KB Output is correct
3 Correct 34 ms 8092 KB Output is correct
4 Correct 35 ms 8156 KB Output is correct
5 Correct 3 ms 5028 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 5024 KB Output is correct
8 Correct 3 ms 5024 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 11 ms 5800 KB Output is correct
12 Correct 11 ms 5716 KB Output is correct
13 Correct 11 ms 5716 KB Output is correct
14 Correct 11 ms 5700 KB Output is correct
15 Correct 11 ms 5716 KB Output is correct
16 Correct 11 ms 5716 KB Output is correct
17 Correct 35 ms 8200 KB Output is correct
18 Correct 36 ms 8156 KB Output is correct
19 Correct 36 ms 8428 KB Output is correct
20 Correct 36 ms 8536 KB Output is correct
21 Correct 37 ms 8560 KB Output is correct
22 Correct 37 ms 8456 KB Output is correct
23 Correct 35 ms 8392 KB Output is correct
24 Correct 35 ms 8388 KB Output is correct
25 Correct 36 ms 8456 KB Output is correct
26 Correct 35 ms 8392 KB Output is correct
27 Correct 36 ms 8452 KB Output is correct
28 Correct 37 ms 8532 KB Output is correct
29 Correct 10 ms 5716 KB Output is correct
30 Correct 11 ms 5752 KB Output is correct
31 Correct 10 ms 5648 KB Output is correct
32 Correct 11 ms 5804 KB Output is correct
33 Correct 11 ms 5716 KB Output is correct
34 Correct 11 ms 5804 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 34 ms 8096 KB Output is correct
37 Correct 38 ms 8184 KB Output is correct
38 Correct 37 ms 8468 KB Output is correct
39 Correct 38 ms 8552 KB Output is correct
40 Correct 37 ms 8552 KB Output is correct
41 Correct 11 ms 5804 KB Output is correct
42 Correct 36 ms 8376 KB Output is correct
43 Correct 36 ms 8524 KB Output is correct
44 Correct 37 ms 8424 KB Output is correct
45 Correct 38 ms 8392 KB Output is correct
46 Correct 35 ms 8548 KB Output is correct
47 Correct 35 ms 8456 KB Output is correct