oj.uz

Submission #503273

# Submission time Handle Problem Language Result Execution time Memory
503273 2022-01-07T15:25:16 Z ignaciocanta Mutating DNA (IOI21_dna) C++17
100 / 100
 38 ms 8576 KB 
#include <bits/stdc++.h>
#include <cstdio>
#include <cassert>
#include <string>
#include <vector>

using namespace std;

const int MX = 1e5+5;

int contA1[MX], contC1[MX], contT1[MX];
int contA2[MX], contC2[MX], contT2[MX];
int AC[MX], AT[MX], CA[MX], CT[MX], TA[MX], TC[MX];

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define F0R(i, b) FOR(i, 0, b)
#define sz(v) (int)(v).size()

void init(std::string a, std::string b) {
	FOR(i, 1, sz(a)+1){
		contA1[i] = contA1[i-1] + (a[i-1] == 'A');
		contC1[i] = contC1[i-1] + (a[i-1] == 'C');
		contT1[i] = contT1[i-1] + (a[i-1] == 'T');
	}
	FOR(i, 1, sz(b)+1){
		contA2[i] = contA2[i-1] + (b[i-1] == 'A');
		contC2[i] = contC2[i-1] + (b[i-1] == 'C');
		contT2[i] = contT2[i-1] + (b[i-1] == 'T');
	}
	FOR(i, 1, sz(a)+1){
		AC[i] = AC[i-1] + (a[i-1] == 'A' && b[i-1] == 'C');
		AT[i] = AT[i-1] + (a[i-1] == 'A' && b[i-1] == 'T');
		CA[i] = CA[i-1] + (a[i-1] == 'C' && b[i-1] == 'A');
		CT[i] = CT[i-1] + (a[i-1] == 'C' && b[i-1] == 'T');
		TA[i] = TA[i-1] + (a[i-1] == 'T' && b[i-1] == 'A');
		TC[i] = TC[i-1] + (a[i-1] == 'T' && b[i-1] == 'C');
	}
}

int get_distance(int x, int y) {
	if(contA1[y+1] - contA1[x] != contA2[y+1] - contA2[x]) return -1;
	if(contC1[y+1] - contC1[x] != contC2[y+1] - contC2[x]) return -1;
	if(contT1[y+1] - contT1[x] != contT2[y+1] - contT2[x]) return -1;
	int ret = 0;
	int ac = AC[y+1] - AC[x], at = AT[y+1] - AT[x], ca = CA[y+1] - CA[x];
	int ct = CT[y+1] - CT[x], ta = TA[y+1] - TA[x], tc = TC[y+1] - TC[x];
	// cycles of size two
	if(min(ac, ca) > 0){
		ret += 2 * min(ac, ca) - min(ac, ca);
		int xx = min(ac, ca);
		ac -= xx;
		ca -= xx;
	}
	if(min(at, ta) > 0){
		ret += 2 * min(at, ta) - min(at, ta);
		int xx = min(at, ta);
		at -= xx;
		ta -= xx;
	}
	if(min(ct, tc) > 0){
		ret += 2 * min(ct, tc) - min(ct, tc);
		int xx = min(ct, tc);
		ct -= xx;
		tc -= xx;
	} 
	// cycles of size three
	if(min({ac, ct, ta}) > 0){
		ret += 3 * min({ac, ct, ta}) - min({ac, ct, ta});
	}
	if(min({at, tc, ca}) > 0){
		ret += 3 * min({at, tc, ca}) - min({at, tc, ca});
	}
	return ret;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 7896 KB Output is correct
2 Correct 38 ms 7860 KB Output is correct
3 Correct 33 ms 7472 KB Output is correct
4 Correct 34 ms 7844 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 5 ms 5668 KB Output is correct
5 Correct 5 ms 5708 KB Output is correct
6 Correct 5 ms 5692 KB Output is correct
7 Correct 5 ms 5328 KB Output is correct
8 Correct 5 ms 5708 KB Output is correct
9 Correct 5 ms 5684 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 5 ms 5668 KB Output is correct
5 Correct 5 ms 5708 KB Output is correct
6 Correct 5 ms 5692 KB Output is correct
7 Correct 5 ms 5328 KB Output is correct
8 Correct 5 ms 5708 KB Output is correct
9 Correct 5 ms 5684 KB Output is correct
10 Correct 34 ms 7868 KB Output is correct
11 Correct 35 ms 7916 KB Output is correct
12 Correct 37 ms 8008 KB Output is correct
13 Correct 35 ms 8076 KB Output is correct
14 Correct 35 ms 8320 KB Output is correct
15 Correct 32 ms 8236 KB Output is correct
16 Correct 30 ms 8004 KB Output is correct
17 Correct 31 ms 8180 KB Output is correct
18 Correct 33 ms 8320 KB Output is correct
19 Correct 30 ms 7980 KB Output is correct
20 Correct 30 ms 8268 KB Output is correct
21 Correct 30 ms 8320 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 5 ms 5668 KB Output is correct
5 Correct 5 ms 5708 KB Output is correct
6 Correct 5 ms 5692 KB Output is correct
7 Correct 5 ms 5328 KB Output is correct
8 Correct 5 ms 5708 KB Output is correct
9 Correct 5 ms 5684 KB Output is correct
10 Correct 4 ms 5296 KB Output is correct
11 Correct 5 ms 5720 KB Output is correct
12 Correct 4 ms 5400 KB Output is correct
13 Correct 5 ms 5708 KB Output is correct
14 Correct 5 ms 5708 KB Output is correct
15 Correct 4 ms 5708 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 7896 KB Output is correct
2 Correct 38 ms 7860 KB Output is correct
3 Correct 33 ms 7472 KB Output is correct
4 Correct 34 ms 7844 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 5 ms 5668 KB Output is correct
12 Correct 5 ms 5708 KB Output is correct
13 Correct 5 ms 5692 KB Output is correct
14 Correct 5 ms 5328 KB Output is correct
15 Correct 5 ms 5708 KB Output is correct
16 Correct 5 ms 5684 KB Output is correct
17 Correct 34 ms 7868 KB Output is correct
18 Correct 35 ms 7916 KB Output is correct
19 Correct 37 ms 8008 KB Output is correct
20 Correct 35 ms 8076 KB Output is correct
21 Correct 35 ms 8320 KB Output is correct
22 Correct 32 ms 8236 KB Output is correct
23 Correct 30 ms 8004 KB Output is correct
24 Correct 31 ms 8180 KB Output is correct
25 Correct 33 ms 8320 KB Output is correct
26 Correct 30 ms 7980 KB Output is correct
27 Correct 30 ms 8268 KB Output is correct
28 Correct 30 ms 8320 KB Output is correct
29 Correct 4 ms 5296 KB Output is correct
30 Correct 5 ms 5720 KB Output is correct
31 Correct 4 ms 5400 KB Output is correct
32 Correct 5 ms 5708 KB Output is correct
33 Correct 5 ms 5708 KB Output is correct
34 Correct 4 ms 5708 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 33 ms 7776 KB Output is correct
37 Correct 34 ms 8168 KB Output is correct
38 Correct 33 ms 8192 KB Output is correct
39 Correct 34 ms 8576 KB Output is correct
40 Correct 33 ms 8544 KB Output is correct
41 Correct 5 ms 5716 KB Output is correct
42 Correct 32 ms 8152 KB Output is correct
43 Correct 31 ms 8448 KB Output is correct
44 Correct 32 ms 8420 KB Output is correct
45 Correct 29 ms 8184 KB Output is correct
46 Correct 29 ms 8464 KB Output is correct
47 Correct 30 ms 8432 KB Output is correct