Submission #716562

# Submission time Handle Problem Language Result Execution time Memory
716562 2023-03-30T10:38:45 Z kidlin Mutating DNA (IOI21_dna) C++17
100 / 100
50 ms 6168 KB
#include<bits/stdc++.h>
using namespace std;
const int val = 1e5+5;
string s,t;
int AT[val], AC[val], TC[val], TA[val],CA[val], CT[val];
int n;
void init(string a,string b){
   n = a.size();
	 for(int32_t i = 0; i <  (n+1); i++) {
		AT[i] = AC[i] = TC[i] = TA[i] = CA[i] = CT[i] = 0;
	}
	for(int32_t i = 0; i <  (n); i++) {
		if (a[i] == 'A' && b[i] == 'T') AT[i+1]++;
		if (a[i] == 'A' && b[i] == 'C') AC[i+1]++;
		if (a[i] == 'T' && b[i] == 'C') TC[i+1]++;
		if (a[i] == 'T' && b[i] == 'A') TA[i+1]++;
		if (a[i] == 'C' && b[i] == 'A') CA[i+1]++;
		if (a[i] == 'C' && b[i] == 'T') CT[i+1]++;
	}
	for(int32_t i = 1; i <= (n); i++) {
		AT[i] += AT[i-1];
		AC[i] += AC[i-1];
		TC[i] += TC[i-1];
		TA[i] += TA[i-1];
		CA[i] += CA[i-1];
		CT[i] += CT[i-1];
	}
}
int get_distance(int x, int y)
{
        x ++, y ++;
        
	int at = AT[y] - AT[x-1];
	int ac = AC[y] - AC[x-1];
	int tc = TC[y] - TC[x-1];
	int ta = TA[y] - TA[x-1];
	int ca = CA[y] - CA[x-1];
	int ct = CT[y] - CT[x-1];
 
	int ans = 0;
 
	int min1 = min(at, ta);
	int min2 = min(ac, ca);
	int min3 = min(tc, ct);
 
	ans += min1 + min2 + min3;
	at -= min1; ta -= min1;
	ac -= min2; ca -= min2;
	tc -= min3; ct -= min3;
 
	if( (at == tc && tc == ca) && (ta == ac && ac == ct) ) 
    {
		ans += at + ta + ac + ca;
		return ans;
	}
	return -1;
}
# Verdict Execution time Memory Grader output
1 Correct 34 ms 5872 KB Output is correct
2 Correct 33 ms 5880 KB Output is correct
3 Correct 31 ms 5508 KB Output is correct
4 Correct 33 ms 5880 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 4 ms 3392 KB Output is correct
5 Correct 5 ms 3396 KB Output is correct
6 Correct 4 ms 3412 KB Output is correct
7 Correct 4 ms 3156 KB Output is correct
8 Correct 4 ms 3388 KB Output is correct
9 Correct 3 ms 3428 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 4 ms 3392 KB Output is correct
5 Correct 5 ms 3396 KB Output is correct
6 Correct 4 ms 3412 KB Output is correct
7 Correct 4 ms 3156 KB Output is correct
8 Correct 4 ms 3388 KB Output is correct
9 Correct 3 ms 3428 KB Output is correct
10 Correct 41 ms 5784 KB Output is correct
11 Correct 50 ms 5876 KB Output is correct
12 Correct 35 ms 5916 KB Output is correct
13 Correct 32 ms 6004 KB Output is correct
14 Correct 39 ms 6152 KB Output is correct
15 Correct 33 ms 6080 KB Output is correct
16 Correct 33 ms 5856 KB Output is correct
17 Correct 43 ms 6012 KB Output is correct
18 Correct 29 ms 6152 KB Output is correct
19 Correct 33 ms 5888 KB Output is correct
20 Correct 29 ms 6004 KB Output is correct
21 Correct 30 ms 6096 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 4 ms 3392 KB Output is correct
5 Correct 5 ms 3396 KB Output is correct
6 Correct 4 ms 3412 KB Output is correct
7 Correct 4 ms 3156 KB Output is correct
8 Correct 4 ms 3388 KB Output is correct
9 Correct 3 ms 3428 KB Output is correct
10 Correct 4 ms 3136 KB Output is correct
11 Correct 5 ms 3392 KB Output is correct
12 Correct 5 ms 3284 KB Output is correct
13 Correct 5 ms 3412 KB Output is correct
14 Correct 5 ms 3396 KB Output is correct
15 Correct 3 ms 3412 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 34 ms 5872 KB Output is correct
2 Correct 33 ms 5880 KB Output is correct
3 Correct 31 ms 5508 KB Output is correct
4 Correct 33 ms 5880 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 4 ms 3392 KB Output is correct
12 Correct 5 ms 3396 KB Output is correct
13 Correct 4 ms 3412 KB Output is correct
14 Correct 4 ms 3156 KB Output is correct
15 Correct 4 ms 3388 KB Output is correct
16 Correct 3 ms 3428 KB Output is correct
17 Correct 41 ms 5784 KB Output is correct
18 Correct 50 ms 5876 KB Output is correct
19 Correct 35 ms 5916 KB Output is correct
20 Correct 32 ms 6004 KB Output is correct
21 Correct 39 ms 6152 KB Output is correct
22 Correct 33 ms 6080 KB Output is correct
23 Correct 33 ms 5856 KB Output is correct
24 Correct 43 ms 6012 KB Output is correct
25 Correct 29 ms 6152 KB Output is correct
26 Correct 33 ms 5888 KB Output is correct
27 Correct 29 ms 6004 KB Output is correct
28 Correct 30 ms 6096 KB Output is correct
29 Correct 4 ms 3136 KB Output is correct
30 Correct 5 ms 3392 KB Output is correct
31 Correct 5 ms 3284 KB Output is correct
32 Correct 5 ms 3412 KB Output is correct
33 Correct 5 ms 3396 KB Output is correct
34 Correct 3 ms 3412 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 32 ms 5604 KB Output is correct
37 Correct 32 ms 5768 KB Output is correct
38 Correct 36 ms 5996 KB Output is correct
39 Correct 33 ms 6140 KB Output is correct
40 Correct 43 ms 6152 KB Output is correct
41 Correct 3 ms 3392 KB Output is correct
42 Correct 32 ms 5888 KB Output is correct
43 Correct 31 ms 6164 KB Output is correct
44 Correct 37 ms 6152 KB Output is correct
45 Correct 43 ms 5944 KB Output is correct
46 Correct 28 ms 6168 KB Output is correct
47 Correct 30 ms 6152 KB Output is correct