oj.uz

Submission #524912

# Submission time Handle Problem Language Result Execution time Memory
524912 2022-02-10T09:32:37 Z Leonardo_Paes Mutating DNA (IOI21_dna) C++17
100 / 100
 60 ms 9148 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
typedef pair<int,int> pii;
#define f first
#define s second

string s, t;
int n, k, qtd[maxn][10], aux[maxn][3];

void init(string a, string b){
	s = ' ' + a, t = ' ' + b;
	n = (int)s.size();
	k = 9;
	for(int i=1; i<n; i++){
		if(t[i] == 'A') --aux[i][0];
		if(t[i] == 'C') --aux[i][1];
		if(t[i] == 'T') --aux[i][2];
		if(s[i] == 'A'){
			++aux[i][0];
			if(t[i] == 'A') ++qtd[i][0];
			else if(t[i] == 'C') ++qtd[i][1];
			else ++qtd[i][2];
		}
		else if(s[i] == 'C'){
			++aux[i][1];
			if(t[i] == 'A') ++qtd[i][3];
			else if(t[i] == 'C') ++qtd[i][4];
			else ++qtd[i][5];
		}
		else{
			++aux[i][2];
			if(t[i] == 'A') ++qtd[i][6];
			else if(t[i] == 'C') ++qtd[i][7];
			else ++qtd[i][8];
		}
		for(int j=0; j<k; j++) qtd[i][j] += qtd[i-1][j];
		for(int j=0; j<3; j++) aux[i][j] += aux[i-1][j];
	}
}

int get_distance(int x, int y){
	++x, ++y;
	for(int i=0; i<3; i++) if(aux[y][i] - aux[x-1][i] != 0) return -1;
	int ans = 0;
	int wtf = 0;
	vector<pii> kras = {{1, 3}, {2, 6}, {5, 7}};
	for(pii a : kras){
		int u = a.f, v = a.s;
		int mx = max(qtd[y][u] - qtd[x-1][u], qtd[y][v] - qtd[x-1][v]);
		int mn = min(qtd[y][u] - qtd[x-1][u], qtd[y][v] - qtd[x-1][v]);
		ans += mn;
		wtf += mx - mn;
	}
	return ans + (wtf/3*2);
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 7352 KB Output is correct
2 Correct 36 ms 8828 KB Output is correct
3 Correct 40 ms 8320 KB Output is correct
4 Correct 45 ms 8872 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 6212 KB Output is correct
5 Correct 6 ms 6312 KB Output is correct
6 Correct 6 ms 6220 KB Output is correct
7 Correct 6 ms 5836 KB Output is correct
8 Correct 7 ms 6348 KB Output is correct
9 Correct 5 ms 6324 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 6212 KB Output is correct
5 Correct 6 ms 6312 KB Output is correct
6 Correct 6 ms 6220 KB Output is correct
7 Correct 6 ms 5836 KB Output is correct
8 Correct 7 ms 6348 KB Output is correct
9 Correct 5 ms 6324 KB Output is correct
10 Correct 46 ms 8688 KB Output is correct
11 Correct 60 ms 8868 KB Output is correct
12 Correct 54 ms 8752 KB Output is correct
13 Correct 35 ms 8864 KB Output is correct
14 Correct 40 ms 9120 KB Output is correct
15 Correct 43 ms 9124 KB Output is correct
16 Correct 42 ms 8708 KB Output is correct
17 Correct 33 ms 8852 KB Output is correct
18 Correct 35 ms 9140 KB Output is correct
19 Correct 37 ms 8712 KB Output is correct
20 Correct 37 ms 8912 KB Output is correct
21 Correct 38 ms 9128 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 6212 KB Output is correct
5 Correct 6 ms 6312 KB Output is correct
6 Correct 6 ms 6220 KB Output is correct
7 Correct 6 ms 5836 KB Output is correct
8 Correct 7 ms 6348 KB Output is correct
9 Correct 5 ms 6324 KB Output is correct
10 Correct 7 ms 5808 KB Output is correct
11 Correct 8 ms 6264 KB Output is correct
12 Correct 8 ms 5964 KB Output is correct
13 Correct 6 ms 6248 KB Output is correct
14 Correct 8 ms 6368 KB Output is correct
15 Correct 7 ms 6348 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 7352 KB Output is correct
2 Correct 36 ms 8828 KB Output is correct
3 Correct 40 ms 8320 KB Output is correct
4 Correct 45 ms 8872 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 5 ms 6212 KB Output is correct
12 Correct 6 ms 6312 KB Output is correct
13 Correct 6 ms 6220 KB Output is correct
14 Correct 6 ms 5836 KB Output is correct
15 Correct 7 ms 6348 KB Output is correct
16 Correct 5 ms 6324 KB Output is correct
17 Correct 46 ms 8688 KB Output is correct
18 Correct 60 ms 8868 KB Output is correct
19 Correct 54 ms 8752 KB Output is correct
20 Correct 35 ms 8864 KB Output is correct
21 Correct 40 ms 9120 KB Output is correct
22 Correct 43 ms 9124 KB Output is correct
23 Correct 42 ms 8708 KB Output is correct
24 Correct 33 ms 8852 KB Output is correct
25 Correct 35 ms 9140 KB Output is correct
26 Correct 37 ms 8712 KB Output is correct
27 Correct 37 ms 8912 KB Output is correct
28 Correct 38 ms 9128 KB Output is correct
29 Correct 7 ms 5808 KB Output is correct
30 Correct 8 ms 6264 KB Output is correct
31 Correct 8 ms 5964 KB Output is correct
32 Correct 6 ms 6248 KB Output is correct
33 Correct 8 ms 6368 KB Output is correct
34 Correct 7 ms 6348 KB Output is correct
35 Correct 1 ms 300 KB Output is correct
36 Correct 38 ms 8248 KB Output is correct
37 Correct 39 ms 8768 KB Output is correct
38 Correct 41 ms 8844 KB Output is correct
39 Correct 44 ms 9132 KB Output is correct
40 Correct 38 ms 9128 KB Output is correct
41 Correct 5 ms 6312 KB Output is correct
42 Correct 33 ms 8772 KB Output is correct
43 Correct 34 ms 9140 KB Output is correct
44 Correct 43 ms 9128 KB Output is correct
45 Correct 31 ms 8736 KB Output is correct
46 Correct 32 ms 9104 KB Output is correct
47 Correct 31 ms 9148 KB Output is correct