Submission #791194

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
791194	2023-07-23T14:41:21 Z	shoryu386	Mutating DNA (IOI21_dna)	C++17	100 / 100	42 ms	8580 KB

#include <bits/stdc++.h>
using namespace std;
#define MAX 100001
int apsum[MAX][2], tpsum[MAX][2], cpsum[MAX][2];
tuple<int, int, int, int, int, int> meow[MAX];
//AT, TA, AC, CA, TC, CT
void init(string a, string b){
	int acarry1=0, tcarry1=0, ccarry1=0, acarry2=0, tcarry2=0, ccarry2=0;
	int at=0, ta=0, ac=0, ca=0, tc=0, ct=0;
	for (int x = 0; x < (int)a.size(); x++){
		if (a[x] == 'A') acarry1++;
		else if (a[x] == 'T') tcarry1++;
		else if (a[x] == 'C') ccarry1++;
		
		if (b[x] == 'A') acarry2++;
		else if (b[x] == 'T') tcarry2++;
		else if (b[x] == 'C') ccarry2++;
		
		apsum[x][0] = acarry1;
		tpsum[x][0] = tcarry1;
		cpsum[x][0] = ccarry1;
		
		apsum[x][1] = acarry2;
		tpsum[x][1] = tcarry2;
		cpsum[x][1] = ccarry2;
		
		if (a[x] == 'A' && b[x] == 'T') at++;
		else if (a[x] == 'T' && b[x] == 'A') ta++;
		else if (a[x] == 'A' && b[x] == 'C') ac++;
		else if (a[x] == 'C' && b[x] == 'A') ca++;
		else if (a[x] == 'T' && b[x] == 'C') tc++;
		else if (a[x] == 'C' && b[x] == 'T') ct++;
		
		meow[x] = make_tuple(at, ta, ac, ca, tc, ct);
	}
}

int get_distance(int x, int y){
	int at=0, ta=0, ac=0, ca=0, tc=0, ct=0;
	if (x != 0){
		if (apsum[y][0]-apsum[x-1][0] != apsum[y][1]-apsum[x-1][1] ||
		tpsum[y][0]-tpsum[x-1][0] != tpsum[y][1]-tpsum[x-1][1] ||
		cpsum[y][0]-cpsum[x-1][0] != cpsum[y][1]-cpsum[x-1][1]
		){
			return -1;
		}
		at = get<0>(meow[y])-get<0>(meow[x-1]);
		ta = get<1>(meow[y])-get<1>(meow[x-1]);
		ac = get<2>(meow[y])-get<2>(meow[x-1]);
		ca = get<3>(meow[y])-get<3>(meow[x-1]);
		tc = get<4>(meow[y])-get<4>(meow[x-1]);
		ct = get<5>(meow[y])-get<5>(meow[x-1]);
	}
	else{
		if (apsum[y][0] != apsum[y][1] ||
		tpsum[y][0] != tpsum[y][1] ||
		cpsum[y][0] != cpsum[y][1]
		){
			return -1;
		}
		
		at = get<0>(meow[y]);
		ta = get<1>(meow[y]);
		ac = get<2>(meow[y]);
		ca = get<3>(meow[y]);
		tc = get<4>(meow[y]);
		ct = get<5>(meow[y]);
	}
	
	//now it is guaranteed that we are able to somehow rearrange it
	
	//we would always prefer to fix 2-cycles before hand? with one swap
	//leaving only 3-cycles that can be fixed with 2 swaps?
	
	int ans = 0;
	int sweep = min(at, ta);
	ans += sweep; at -= sweep; ta -= sweep;
	sweep = min(ac, ca);
	ans += sweep; ac -= sweep; ca -= sweep;
	sweep = min(tc, ct);
	ans += sweep; tc -= sweep; ct -= sweep;
	
	int sum = at + ta + ac + ca + tc + ct;
	ans += (sum/3)*2;
	
	return ans;
}

Subtask #1
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	8132 KB	Output is correct
2	Correct	28 ms	8176 KB	Output is correct
3	Correct	35 ms	7700 KB	Output is correct
4	Correct	33 ms	8160 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct

Subtask #2
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	4 ms	5732 KB	Output is correct
5	Correct	4 ms	5728 KB	Output is correct
6	Correct	4 ms	5680 KB	Output is correct
7	Correct	5 ms	5332 KB	Output is correct
8	Correct	5 ms	5728 KB	Output is correct
9	Correct	5 ms	5716 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	4 ms	5732 KB	Output is correct
5	Correct	4 ms	5728 KB	Output is correct
6	Correct	4 ms	5680 KB	Output is correct
7	Correct	5 ms	5332 KB	Output is correct
8	Correct	5 ms	5728 KB	Output is correct
9	Correct	5 ms	5716 KB	Output is correct
10	Correct	28 ms	7320 KB	Output is correct
11	Correct	41 ms	7384 KB	Output is correct
12	Correct	29 ms	7296 KB	Output is correct
13	Correct	31 ms	7428 KB	Output is correct
14	Correct	29 ms	7724 KB	Output is correct
15	Correct	39 ms	7676 KB	Output is correct
16	Correct	27 ms	7300 KB	Output is correct
17	Correct	32 ms	7460 KB	Output is correct
18	Correct	31 ms	7664 KB	Output is correct
19	Correct	28 ms	7336 KB	Output is correct
20	Correct	27 ms	7468 KB	Output is correct
21	Correct	42 ms	7708 KB	Output is correct

Subtask #4
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	4 ms	5732 KB	Output is correct
5	Correct	4 ms	5728 KB	Output is correct
6	Correct	4 ms	5680 KB	Output is correct
7	Correct	5 ms	5332 KB	Output is correct
8	Correct	5 ms	5728 KB	Output is correct
9	Correct	5 ms	5716 KB	Output is correct
10	Correct	4 ms	5204 KB	Output is correct
11	Correct	4 ms	5752 KB	Output is correct
12	Correct	5 ms	5332 KB	Output is correct
13	Correct	4 ms	5728 KB	Output is correct
14	Correct	4 ms	5716 KB	Output is correct
15	Correct	5 ms	5696 KB	Output is correct

Subtask #5
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	8132 KB	Output is correct
2	Correct	28 ms	8176 KB	Output is correct
3	Correct	35 ms	7700 KB	Output is correct
4	Correct	33 ms	8160 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	4 ms	5732 KB	Output is correct
12	Correct	4 ms	5728 KB	Output is correct
13	Correct	4 ms	5680 KB	Output is correct
14	Correct	5 ms	5332 KB	Output is correct
15	Correct	5 ms	5728 KB	Output is correct
16	Correct	5 ms	5716 KB	Output is correct
17	Correct	28 ms	7320 KB	Output is correct
18	Correct	41 ms	7384 KB	Output is correct
19	Correct	29 ms	7296 KB	Output is correct
20	Correct	31 ms	7428 KB	Output is correct
21	Correct	29 ms	7724 KB	Output is correct
22	Correct	39 ms	7676 KB	Output is correct
23	Correct	27 ms	7300 KB	Output is correct
24	Correct	32 ms	7460 KB	Output is correct
25	Correct	31 ms	7664 KB	Output is correct
26	Correct	28 ms	7336 KB	Output is correct
27	Correct	27 ms	7468 KB	Output is correct
28	Correct	42 ms	7708 KB	Output is correct
29	Correct	4 ms	5204 KB	Output is correct
30	Correct	4 ms	5752 KB	Output is correct
31	Correct	5 ms	5332 KB	Output is correct
32	Correct	4 ms	5728 KB	Output is correct
33	Correct	4 ms	5716 KB	Output is correct
34	Correct	5 ms	5696 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	26 ms	7756 KB	Output is correct
37	Correct	27 ms	8188 KB	Output is correct
38	Correct	28 ms	8236 KB	Output is correct
39	Correct	28 ms	8524 KB	Output is correct
40	Correct	28 ms	8580 KB	Output is correct
41	Correct	3 ms	5716 KB	Output is correct
42	Correct	27 ms	8184 KB	Output is correct
43	Correct	27 ms	8444 KB	Output is correct
44	Correct	27 ms	8444 KB	Output is correct
45	Correct	30 ms	8132 KB	Output is correct
46	Correct	26 ms	8456 KB	Output is correct
47	Correct	26 ms	8456 KB	Output is correct

Submission #791194

Compilation message

Subtask #1 21.0 / 21.0

Subtask #2 22.0 / 22.0

Subtask #3 13.0 / 13.0

Subtask #4 28.0 / 28.0

Subtask #5 16.0 / 16.0

Subtask #1
21.0 / 21.0

Subtask #2
22.0 / 22.0

Subtask #3
13.0 / 13.0

Subtask #4
28.0 / 28.0

Subtask #5
16.0 / 16.0