oj.uz

Submission #888865

# Submission time Handle Problem Language Result Execution time Memory
888865 2023-12-18T09:54:16 Z allin27x Mutating DNA (IOI21_dna) C++17
100 / 100
 28 ms 6456 KB 
#include <bits/stdc++.h>
using namespace std;

//CTA
const int N = 1e5+7;

int TC[N], AC[N], AT[N];
int CT[N], CA[N], TA[N];


void init(string A, string B){
	int n = A.size();
	for (int i=0; i<n; i++){
		TC[i+1] = TC[i] + (A[i] == 'T' && B[i] == 'C');
		AC[i+1] = AC[i] + (A[i] == 'A' && B[i] == 'C');
		AT[i+1] = AT[i] + (A[i] == 'A' && B[i] == 'T') ;
		CT[i+1] = CT[i] + (A[i] == 'C' && B[i] == 'T') ;
		CA[i+1] = CA[i] + (A[i] == 'C' && B[i] == 'A');
		TA[i+1] = TA[i] + (A[i] == 'T' && B[i] == 'A');
	}
}

int get_distance(int x, int y){
	int tc = TC[y+1] - TC[x];
	int ac = AC[y+1] - AC[x];
	int at = AT[y+1] - AT[x];
	int ct = CT[y+1] - CT[x];
	int ca = CA[y+1] - CA[x];
	int ta = TA[y+1] - TA[x];
	// cout<<tc<<' '<<ac<<' '<<at<<' '<<ct<<' '<<ca<<' '<<ta<<'\n';
	int r1 = min(tc,ct); tc-=r1, ct-=r1;
	int r2 = min(ac,ca); ca-=r2, ac-=r2;
	int r3 = min(at,ta); at-=r3, ta-=r3;

	int res = r1+r2+r3;
	if ((tc+ta != at+ct) || (ac+at != ta+ca) || (tc+ac != ca+ct)) return -1;
	res += 2*(tc+ac+at+ct+ca+ta)/3;
	return res;
}


// int main(){
// 	init("ATACAT", "ACTATA");

// 	cout<<get_distance(1,3)<<'\n';
// 	cout<<get_distance(4,5)<<'\n';
// 	cout<<get_distance(3,5)<<'\n';
// }

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5916 KB Output is correct
2 Correct 25 ms 5900 KB Output is correct
3 Correct 26 ms 5588 KB Output is correct
4 Correct 25 ms 5908 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 504 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 3416 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 3 ms 3420 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 3 ms 3416 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 3416 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 3 ms 3420 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 3 ms 3416 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct
10 Correct 25 ms 5916 KB Output is correct
11 Correct 24 ms 5912 KB Output is correct
12 Correct 26 ms 5956 KB Output is correct
13 Correct 27 ms 6172 KB Output is correct
14 Correct 27 ms 6116 KB Output is correct
15 Correct 25 ms 6156 KB Output is correct
16 Correct 28 ms 5916 KB Output is correct
17 Correct 25 ms 6112 KB Output is correct
18 Correct 25 ms 6160 KB Output is correct
19 Correct 24 ms 5924 KB Output is correct
20 Correct 25 ms 6180 KB Output is correct
21 Correct 25 ms 6128 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 3416 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 3 ms 3420 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 3 ms 3416 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct
10 Correct 3 ms 3160 KB Output is correct
11 Correct 3 ms 3420 KB Output is correct
12 Correct 3 ms 3164 KB Output is correct
13 Correct 3 ms 3420 KB Output is correct
14 Correct 4 ms 3932 KB Output is correct
15 Correct 2 ms 3564 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5916 KB Output is correct
2 Correct 25 ms 5900 KB Output is correct
3 Correct 26 ms 5588 KB Output is correct
4 Correct 25 ms 5908 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 504 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 3416 KB Output is correct
12 Correct 3 ms 3420 KB Output is correct
13 Correct 3 ms 3420 KB Output is correct
14 Correct 2 ms 3160 KB Output is correct
15 Correct 3 ms 3416 KB Output is correct
16 Correct 2 ms 3420 KB Output is correct
17 Correct 25 ms 5916 KB Output is correct
18 Correct 24 ms 5912 KB Output is correct
19 Correct 26 ms 5956 KB Output is correct
20 Correct 27 ms 6172 KB Output is correct
21 Correct 27 ms 6116 KB Output is correct
22 Correct 25 ms 6156 KB Output is correct
23 Correct 28 ms 5916 KB Output is correct
24 Correct 25 ms 6112 KB Output is correct
25 Correct 25 ms 6160 KB Output is correct
26 Correct 24 ms 5924 KB Output is correct
27 Correct 25 ms 6180 KB Output is correct
28 Correct 25 ms 6128 KB Output is correct
29 Correct 3 ms 3160 KB Output is correct
30 Correct 3 ms 3420 KB Output is correct
31 Correct 3 ms 3164 KB Output is correct
32 Correct 3 ms 3420 KB Output is correct
33 Correct 4 ms 3932 KB Output is correct
34 Correct 2 ms 3564 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 24 ms 5676 KB Output is correct
37 Correct 25 ms 5972 KB Output is correct
38 Correct 26 ms 6456 KB Output is correct
39 Correct 26 ms 6164 KB Output is correct
40 Correct 26 ms 6168 KB Output is correct
41 Correct 2 ms 3416 KB Output is correct
42 Correct 25 ms 5916 KB Output is correct
43 Correct 26 ms 6280 KB Output is correct
44 Correct 27 ms 6276 KB Output is correct
45 Correct 26 ms 6100 KB Output is correct
46 Correct 27 ms 6424 KB Output is correct
47 Correct 25 ms 6168 KB Output is correct