Submission #975698

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
975698	2024-05-05T18:06:01 Z	hariaakas646	Mutating DNA (IOI21_dna)	C++17	100 / 100	41 ms	8600 KB

#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

vi cnta1, cntc1, cntt1;
vi cnta2, cntc2, cntt2;
vi ac, at, ca, ct, ta, tc;

void init(std::string a, std::string b) {
	int n = a.size();
	cnta1 = cntc1 = cntt1 = vi(n+1);
	cnta2 = cntc2 = cntt2 = vi(n+1);
	ac = at = ca = ct = ta = tc = vi(n+1);
	forr(i, 1, n+1) {
		cnta1[i] = (a[i-1] == 'A') + cnta1[i-1];
		cntc1[i] = (a[i-1] == 'C') + cntc1[i-1];
		cntt1[i] = (a[i-1] == 'T') + cntt1[i-1];

		cnta2[i] = (b[i-1] == 'A') + cnta2[i-1];
		cntc2[i] = (b[i-1] == 'C') + cntc2[i-1];
		cntt2[i] = (b[i-1] == 'T') + cntt2[i-1];
		ac[i] = ac[i-1];
		at[i] = at[i-1];
		ca[i] = ca[i-1];
		ct[i] = ct[i-1];
		tc[i] = tc[i-1];
		ta[i] = ta[i-1];
		if(a[i-1] == 'A' && b[i-1] == 'C') ac[i]++;
		if(a[i-1] == 'A' && b[i-1] == 'T') at[i]++;
		if(a[i-1] == 'C' && b[i-1] == 'A') ca[i]++;
		if(a[i-1] == 'C' && b[i-1] == 'T') ct[i]++;
		if(a[i-1] == 'T' && b[i-1] == 'C') tc[i]++;
		if(a[i-1] == 'T' && b[i-1] == 'A') ta[i]++;

	}
}

int get_distance(int x, int y) {
	x++;
	y++;
	// printf("%d %d\n", cnta1[y] - cnta1[x-1], cnta2[y] - cnta2[x-1]);
	if(cnta1[y] - cnta1[x-1] != cnta2[y] - cnta2[x-1]) return -1;
	if(cntc1[y] - cntc1[x-1] != cntc2[y] - cntc2[x-1]) return -1;
	if(cntt1[y] - cntt1[x-1] != cntt2[y] - cntt2[x-1]) return -1;
	int out = 0;
	int acv = ac[y] - ac[x-1];
	int atv = at[y] - at[x-1];
	int cav = ca[y] - ca[x-1];
	int ctv = ct[y] - ct[x-1];
	int tcv = tc[y] - tc[x-1];
	int tav = ta[y] - ta[x-1];
	int v = min(acv, cav);

	out += v;
	acv -= v;
	cav -= v;

	v = min(atv, tav);
	out += v;
	atv -= v;
	tav -= v;

	v = min(tcv, ctv);
	out += v;
	tcv -= v;
	ctv -= v; 

	out += 2*(ctv + tcv);

	return out;
}

Subtask #1
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	6940 KB	Output is correct
2	Correct	34 ms	6936 KB	Output is correct
3	Correct	32 ms	6444 KB	Output is correct
4	Correct	33 ms	6936 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct

Subtask #2
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	11 ms	5468 KB	Output is correct
5	Correct	11 ms	5720 KB	Output is correct
6	Correct	11 ms	5468 KB	Output is correct
7	Correct	10 ms	5468 KB	Output is correct
8	Correct	11 ms	5864 KB	Output is correct
9	Correct	11 ms	5720 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	11 ms	5468 KB	Output is correct
5	Correct	11 ms	5720 KB	Output is correct
6	Correct	11 ms	5468 KB	Output is correct
7	Correct	10 ms	5468 KB	Output is correct
8	Correct	11 ms	5864 KB	Output is correct
9	Correct	11 ms	5720 KB	Output is correct
10	Correct	35 ms	7696 KB	Output is correct
11	Correct	34 ms	7864 KB	Output is correct
12	Correct	35 ms	7720 KB	Output is correct
13	Correct	36 ms	7844 KB	Output is correct
14	Correct	36 ms	8208 KB	Output is correct
15	Correct	36 ms	7224 KB	Output is correct
16	Correct	34 ms	7712 KB	Output is correct
17	Correct	37 ms	7504 KB	Output is correct
18	Correct	37 ms	8208 KB	Output is correct
19	Correct	34 ms	7968 KB	Output is correct
20	Correct	35 ms	7704 KB	Output is correct
21	Correct	34 ms	8044 KB	Output is correct

Subtask #4
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	11 ms	5468 KB	Output is correct
5	Correct	11 ms	5720 KB	Output is correct
6	Correct	11 ms	5468 KB	Output is correct
7	Correct	10 ms	5468 KB	Output is correct
8	Correct	11 ms	5864 KB	Output is correct
9	Correct	11 ms	5720 KB	Output is correct
10	Correct	11 ms	5212 KB	Output is correct
11	Correct	12 ms	5724 KB	Output is correct
12	Correct	10 ms	5468 KB	Output is correct
13	Correct	11 ms	5724 KB	Output is correct
14	Correct	12 ms	5836 KB	Output is correct
15	Correct	12 ms	5916 KB	Output is correct

Subtask #5
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	6940 KB	Output is correct
2	Correct	34 ms	6936 KB	Output is correct
3	Correct	32 ms	6444 KB	Output is correct
4	Correct	33 ms	6936 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	11 ms	5468 KB	Output is correct
12	Correct	11 ms	5720 KB	Output is correct
13	Correct	11 ms	5468 KB	Output is correct
14	Correct	10 ms	5468 KB	Output is correct
15	Correct	11 ms	5864 KB	Output is correct
16	Correct	11 ms	5720 KB	Output is correct
17	Correct	35 ms	7696 KB	Output is correct
18	Correct	34 ms	7864 KB	Output is correct
19	Correct	35 ms	7720 KB	Output is correct
20	Correct	36 ms	7844 KB	Output is correct
21	Correct	36 ms	8208 KB	Output is correct
22	Correct	36 ms	7224 KB	Output is correct
23	Correct	34 ms	7712 KB	Output is correct
24	Correct	37 ms	7504 KB	Output is correct
25	Correct	37 ms	8208 KB	Output is correct
26	Correct	34 ms	7968 KB	Output is correct
27	Correct	35 ms	7704 KB	Output is correct
28	Correct	34 ms	8044 KB	Output is correct
29	Correct	11 ms	5212 KB	Output is correct
30	Correct	12 ms	5724 KB	Output is correct
31	Correct	10 ms	5468 KB	Output is correct
32	Correct	11 ms	5724 KB	Output is correct
33	Correct	12 ms	5836 KB	Output is correct
34	Correct	12 ms	5916 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	32 ms	7452 KB	Output is correct
37	Correct	34 ms	7968 KB	Output is correct
38	Correct	35 ms	7664 KB	Output is correct
39	Correct	37 ms	7968 KB	Output is correct
40	Correct	40 ms	8300 KB	Output is correct
41	Correct	12 ms	5716 KB	Output is correct
42	Correct	34 ms	7904 KB	Output is correct
43	Correct	41 ms	8220 KB	Output is correct
44	Correct	38 ms	8600 KB	Output is correct
45	Correct	34 ms	7960 KB	Output is correct
46	Correct	34 ms	8472 KB	Output is correct
47	Correct	35 ms	7952 KB	Output is correct

Submission #975698

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