oj.uz

Submission #599224

# Submission time Handle Problem Language Result Execution time Memory
599224 2022-07-19T11:45:26 Z definitelynotmee Mutating DNA (IOI21_dna) C++17
100 / 100
 47 ms 9748 KB 
#include "dna.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
using matrix= vector<vector<T>>;


array<vector<array<int,3>>,2> ct;
vector<array<array<int,3>,3>> fix;

map<char,int> dic = {{'A',0},{'C',1},{'T',2}};

void init(std::string a, std::string b) {
	int n = a.size();
	for(int i = 0; i < 2; i++){
		ct[i] = vector<array<int,3>>(n+1);
	}
	fix = vector<array<array<int,3>,3>>(n+1);

	for(int i = 1; i <= n; i++){
		ct[0][i] = ct[0][i-1];
		ct[0][i][dic[a[i-1]]]++;
	}
	for(int i = 1; i <= n; i++){
		ct[1][i] = ct[1][i-1];
		ct[1][i][dic[b[i-1]]]++;
		fix[i] = fix[i-1];
		fix[i][dic[a[i-1]]][dic[b[i-1]]]++;
	}
}

int get_distance(int x, int y) {
	array<int,3> c1 = ct[0][y+1], c2 = ct[1][y+1];
	for(int i = 0; i < 3; i++)
		c1[i]-=ct[0][x][i], c2[i] -=ct[1][x][i];
	if(c1!=c2)
		return -1;
	int resp = 0;
	array<array<int,3>,3> totfix = fix[y+1];
	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 3; j++){
			totfix[i][j]-=fix[x][i][j];
		}
	}
	int tricicle = 0;

	for(int i = 0; i < 3; i++){
		for(int j = i+1; j < 3; j++){
			int can = min(totfix[i][j],totfix[j][i]);
			resp+=can;
			totfix[i][j]-=can;
			totfix[j][i]-=can;
			tricicle+=totfix[i][j]+totfix[j][i];

		}
	}
	resp+=tricicle/3*2;
	return resp;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 7892 KB Output is correct
2 Correct 40 ms 9312 KB Output is correct
3 Correct 44 ms 8824 KB Output is correct
4 Correct 44 ms 9356 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 296 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 8 ms 6868 KB Output is correct
5 Correct 8 ms 6868 KB Output is correct
6 Correct 8 ms 6868 KB Output is correct
7 Correct 7 ms 6484 KB Output is correct
8 Correct 8 ms 6872 KB Output is correct
9 Correct 9 ms 6872 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 8 ms 6868 KB Output is correct
5 Correct 8 ms 6868 KB Output is correct
6 Correct 8 ms 6868 KB Output is correct
7 Correct 7 ms 6484 KB Output is correct
8 Correct 8 ms 6872 KB Output is correct
9 Correct 9 ms 6872 KB Output is correct
10 Correct 39 ms 9252 KB Output is correct
11 Correct 37 ms 9352 KB Output is correct
12 Correct 38 ms 9212 KB Output is correct
13 Correct 42 ms 9360 KB Output is correct
14 Correct 43 ms 9708 KB Output is correct
15 Correct 36 ms 9608 KB Output is correct
16 Correct 38 ms 9080 KB Output is correct
17 Correct 35 ms 9324 KB Output is correct
18 Correct 35 ms 9580 KB Output is correct
19 Correct 34 ms 9184 KB Output is correct
20 Correct 36 ms 9400 KB Output is correct
21 Correct 33 ms 9608 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 8 ms 6868 KB Output is correct
5 Correct 8 ms 6868 KB Output is correct
6 Correct 8 ms 6868 KB Output is correct
7 Correct 7 ms 6484 KB Output is correct
8 Correct 8 ms 6872 KB Output is correct
9 Correct 9 ms 6872 KB Output is correct
10 Correct 9 ms 6356 KB Output is correct
11 Correct 8 ms 6976 KB Output is correct
12 Correct 7 ms 6484 KB Output is correct
13 Correct 9 ms 6928 KB Output is correct
14 Correct 8 ms 6976 KB Output is correct
15 Correct 7 ms 6920 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 7892 KB Output is correct
2 Correct 40 ms 9312 KB Output is correct
3 Correct 44 ms 8824 KB Output is correct
4 Correct 44 ms 9356 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 8 ms 6868 KB Output is correct
12 Correct 8 ms 6868 KB Output is correct
13 Correct 8 ms 6868 KB Output is correct
14 Correct 7 ms 6484 KB Output is correct
15 Correct 8 ms 6872 KB Output is correct
16 Correct 9 ms 6872 KB Output is correct
17 Correct 39 ms 9252 KB Output is correct
18 Correct 37 ms 9352 KB Output is correct
19 Correct 38 ms 9212 KB Output is correct
20 Correct 42 ms 9360 KB Output is correct
21 Correct 43 ms 9708 KB Output is correct
22 Correct 36 ms 9608 KB Output is correct
23 Correct 38 ms 9080 KB Output is correct
24 Correct 35 ms 9324 KB Output is correct
25 Correct 35 ms 9580 KB Output is correct
26 Correct 34 ms 9184 KB Output is correct
27 Correct 36 ms 9400 KB Output is correct
28 Correct 33 ms 9608 KB Output is correct
29 Correct 9 ms 6356 KB Output is correct
30 Correct 8 ms 6976 KB Output is correct
31 Correct 7 ms 6484 KB Output is correct
32 Correct 9 ms 6928 KB Output is correct
33 Correct 8 ms 6976 KB Output is correct
34 Correct 7 ms 6920 KB Output is correct
35 Correct 1 ms 300 KB Output is correct
36 Correct 39 ms 8796 KB Output is correct
37 Correct 47 ms 9336 KB Output is correct
38 Correct 41 ms 9296 KB Output is correct
39 Correct 46 ms 9748 KB Output is correct
40 Correct 42 ms 9736 KB Output is correct
41 Correct 7 ms 6876 KB Output is correct
42 Correct 37 ms 9188 KB Output is correct
43 Correct 38 ms 9608 KB Output is correct
44 Correct 36 ms 9608 KB Output is correct
45 Correct 35 ms 9312 KB Output is correct
46 Correct 34 ms 9620 KB Output is correct
47 Correct 33 ms 9612 KB Output is correct