Submission #850018

# Submission time Handle Problem Language Result Execution time Memory
850018 2023-09-15T15:50:13 Z AliHasanli Mutating DNA (IOI21_dna) C++17
100 / 100
31 ms 8892 KB
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
typedef long long ll;
const ll N=(1e5)+10;
ll n;
vector<ll> AT(N, 0);
vector<ll> TA(N, 0);
vector<ll> CA(N, 0);
vector<ll> AC(N, 0);
vector<ll> TC(N, 0);
vector<ll> CT(N, 0);
void init(string a, string b) {
	n=a.length();
	a="."+a;
	b="."+b;
	for(ll i=1; i<=n; i++){
		AT[i]=AT[i-1];
		TA[i]=TA[i-1];
		AC[i]=AC[i-1];
		CA[i]=CA[i-1];
		CT[i]=CT[i-1];
		TC[i]=TC[i-1];
		if(a[i]=='T' && b[i]=='A') TA[i]++;
		else if(a[i]=='A' && b[i]=='T') AT[i]++;
		else if(a[i]=='A' && b[i]=='C') AC[i]++;
		else if(a[i]=='C' && b[i]=='A') CA[i]++;
		else if(a[i]=='C' && b[i]=='T') CT[i]++;
		else if(a[i]=='T' && b[i]=='C') TC[i]++;
	}
}
int get_distance(int x, int y) {
	x++, y++;
	ll ac=AC[y]-AC[x-1];
	ll ca=CA[y]-CA[x-1];
	ll at=AT[y]-AT[x-1];
	ll ta=TA[y]-TA[x-1];
	ll tc=TC[y]-TC[x-1];
	ll ct=CT[y]-CT[x-1];
	ll k=0;
	if(ca+ta!=ac+at) return -1;
	if(ct+at!=tc+ta) return -1;
	if(ac+tc!=ca+ct) return -1;
	if(ca<ac){
		swap(ca, ac);
		swap(at, ta);
		swap(tc, ct);
	}
	k+=ac+ta+ct;
	k+=2*(ca-ac);
	return k;
}
# Verdict Execution time Memory Grader output
1 Correct 26 ms 8364 KB Output is correct
2 Correct 26 ms 8364 KB Output is correct
3 Correct 26 ms 8136 KB Output is correct
4 Correct 25 ms 8364 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 3 ms 5208 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 5 ms 5976 KB Output is correct
5 Correct 4 ms 5976 KB Output is correct
6 Correct 4 ms 5976 KB Output is correct
7 Correct 4 ms 5976 KB Output is correct
8 Correct 4 ms 5976 KB Output is correct
9 Correct 4 ms 5976 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 3 ms 5208 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 5 ms 5976 KB Output is correct
5 Correct 4 ms 5976 KB Output is correct
6 Correct 4 ms 5976 KB Output is correct
7 Correct 4 ms 5976 KB Output is correct
8 Correct 4 ms 5976 KB Output is correct
9 Correct 4 ms 5976 KB Output is correct
10 Correct 27 ms 8364 KB Output is correct
11 Correct 28 ms 8364 KB Output is correct
12 Correct 26 ms 8432 KB Output is correct
13 Correct 27 ms 8632 KB Output is correct
14 Correct 28 ms 8620 KB Output is correct
15 Correct 26 ms 8656 KB Output is correct
16 Correct 27 ms 8596 KB Output is correct
17 Correct 26 ms 8376 KB Output is correct
18 Correct 31 ms 8568 KB Output is correct
19 Correct 24 ms 8384 KB Output is correct
20 Correct 24 ms 8572 KB Output is correct
21 Correct 25 ms 8624 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 3 ms 5208 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 5 ms 5976 KB Output is correct
5 Correct 4 ms 5976 KB Output is correct
6 Correct 4 ms 5976 KB Output is correct
7 Correct 4 ms 5976 KB Output is correct
8 Correct 4 ms 5976 KB Output is correct
9 Correct 4 ms 5976 KB Output is correct
10 Correct 4 ms 5720 KB Output is correct
11 Correct 4 ms 5980 KB Output is correct
12 Correct 5 ms 6020 KB Output is correct
13 Correct 5 ms 5976 KB Output is correct
14 Correct 4 ms 5976 KB Output is correct
15 Correct 4 ms 5980 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 26 ms 8364 KB Output is correct
2 Correct 26 ms 8364 KB Output is correct
3 Correct 26 ms 8136 KB Output is correct
4 Correct 25 ms 8364 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 3 ms 5208 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 5 ms 5976 KB Output is correct
12 Correct 4 ms 5976 KB Output is correct
13 Correct 4 ms 5976 KB Output is correct
14 Correct 4 ms 5976 KB Output is correct
15 Correct 4 ms 5976 KB Output is correct
16 Correct 4 ms 5976 KB Output is correct
17 Correct 27 ms 8364 KB Output is correct
18 Correct 28 ms 8364 KB Output is correct
19 Correct 26 ms 8432 KB Output is correct
20 Correct 27 ms 8632 KB Output is correct
21 Correct 28 ms 8620 KB Output is correct
22 Correct 26 ms 8656 KB Output is correct
23 Correct 27 ms 8596 KB Output is correct
24 Correct 26 ms 8376 KB Output is correct
25 Correct 31 ms 8568 KB Output is correct
26 Correct 24 ms 8384 KB Output is correct
27 Correct 24 ms 8572 KB Output is correct
28 Correct 25 ms 8624 KB Output is correct
29 Correct 4 ms 5720 KB Output is correct
30 Correct 4 ms 5980 KB Output is correct
31 Correct 5 ms 6020 KB Output is correct
32 Correct 5 ms 5976 KB Output is correct
33 Correct 4 ms 5976 KB Output is correct
34 Correct 4 ms 5980 KB Output is correct
35 Correct 2 ms 4952 KB Output is correct
36 Correct 25 ms 8136 KB Output is correct
37 Correct 25 ms 8368 KB Output is correct
38 Correct 26 ms 8892 KB Output is correct
39 Correct 27 ms 8620 KB Output is correct
40 Correct 27 ms 8536 KB Output is correct
41 Correct 4 ms 5976 KB Output is correct
42 Correct 26 ms 8384 KB Output is correct
43 Correct 26 ms 8448 KB Output is correct
44 Correct 30 ms 8448 KB Output is correct
45 Correct 24 ms 8636 KB Output is correct
46 Correct 30 ms 8620 KB Output is correct
47 Correct 25 ms 8620 KB Output is correct