oj.uz

Submission #437438

# Submission time Handle Problem Language Result Execution time Memory
437438 2021-06-26T10:16:59 Z AdamGS Mutating DNA (IOI21_dna) C++17
100 / 100
 60 ms 6788 KB 
#include "dna.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define pb push_back
#define st first
#define nd second
#define all(a) a.begin(), a.end()
#define lg(a) (31-__builtin_clz(a))
const int LIM=1e5+7;
int A[LIM], B[LIM], sum[LIM][3][3];
int n;
void init(string a, string b) {
	n=a.size();
	rep(i, n) {
		if(a[i]=='T') A[i]=1;
		else if(a[i]=='C') A[i]=2;
		if(b[i]=='T') B[i]=1;
		else if(b[i]=='C') B[i]=2;
		if(i) {
			rep(j, 3) rep(k, 3) sum[i][j][k]=sum[i-1][j][k];
		}
		++sum[i][A[i]][B[i]];
	}
}
int licz(int x, int y, int a, int b) {
	if(!x) return sum[y][a][b];
	return sum[y][a][b]-sum[x-1][a][b];
}
int get_distance(int x, int y) {
	rep(i, 3) {
		int a=0, b=0;
		rep(j, 3) {
			a+=licz(x, y, i, j);
			b+=licz(x, y, j, i);
		}
		if(a!=b) return -1;
	}
	int ile[3][3], ans=0, ma=0;
	rep(i, 3) rep(j, 3) ile[i][j]=licz(x, y, i, j);
	rep(i, 3) rep(j, i) {
		int p=min(ile[i][j], ile[j][i]);
		ans+=p;
		ile[i][j]-=p;
		ile[j][i]-=p;
		ma=max(ma, max(ile[i][j], ile[j][i]));
	}
	ans+=2*ma;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 6364 KB Output is correct
2 Correct 46 ms 6388 KB Output is correct
3 Correct 43 ms 5988 KB Output is correct
4 Correct 47 ms 6408 KB Output is correct
5 Correct 1 ms 204 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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 5068 KB Output is correct
5 Correct 6 ms 5068 KB Output is correct
6 Correct 6 ms 5068 KB Output is correct
7 Correct 7 ms 4812 KB Output is correct
8 Correct 6 ms 5068 KB Output is correct
9 Correct 5 ms 5068 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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 5068 KB Output is correct
5 Correct 6 ms 5068 KB Output is correct
6 Correct 6 ms 5068 KB Output is correct
7 Correct 7 ms 4812 KB Output is correct
8 Correct 6 ms 5068 KB Output is correct
9 Correct 5 ms 5068 KB Output is correct
10 Correct 46 ms 6396 KB Output is correct
11 Correct 45 ms 6400 KB Output is correct
12 Correct 45 ms 6472 KB Output is correct
13 Correct 43 ms 6600 KB Output is correct
14 Correct 55 ms 6780 KB Output is correct
15 Correct 43 ms 6784 KB Output is correct
16 Correct 42 ms 6416 KB Output is correct
17 Correct 52 ms 6620 KB Output is correct
18 Correct 57 ms 6784 KB Output is correct
19 Correct 42 ms 6504 KB Output is correct
20 Correct 42 ms 6652 KB Output is correct
21 Correct 40 ms 6788 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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 5068 KB Output is correct
5 Correct 6 ms 5068 KB Output is correct
6 Correct 6 ms 5068 KB Output is correct
7 Correct 7 ms 4812 KB Output is correct
8 Correct 6 ms 5068 KB Output is correct
9 Correct 5 ms 5068 KB Output is correct
10 Correct 6 ms 4684 KB Output is correct
11 Correct 6 ms 5076 KB Output is correct
12 Correct 7 ms 4812 KB Output is correct
13 Correct 7 ms 5068 KB Output is correct
14 Correct 7 ms 5128 KB Output is correct
15 Correct 5 ms 5068 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 6364 KB Output is correct
2 Correct 46 ms 6388 KB Output is correct
3 Correct 43 ms 5988 KB Output is correct
4 Correct 47 ms 6408 KB Output is correct
5 Correct 1 ms 204 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 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 6 ms 5068 KB Output is correct
12 Correct 6 ms 5068 KB Output is correct
13 Correct 6 ms 5068 KB Output is correct
14 Correct 7 ms 4812 KB Output is correct
15 Correct 6 ms 5068 KB Output is correct
16 Correct 5 ms 5068 KB Output is correct
17 Correct 46 ms 6396 KB Output is correct
18 Correct 45 ms 6400 KB Output is correct
19 Correct 45 ms 6472 KB Output is correct
20 Correct 43 ms 6600 KB Output is correct
21 Correct 55 ms 6780 KB Output is correct
22 Correct 43 ms 6784 KB Output is correct
23 Correct 42 ms 6416 KB Output is correct
24 Correct 52 ms 6620 KB Output is correct
25 Correct 57 ms 6784 KB Output is correct
26 Correct 42 ms 6504 KB Output is correct
27 Correct 42 ms 6652 KB Output is correct
28 Correct 40 ms 6788 KB Output is correct
29 Correct 6 ms 4684 KB Output is correct
30 Correct 6 ms 5076 KB Output is correct
31 Correct 7 ms 4812 KB Output is correct
32 Correct 7 ms 5068 KB Output is correct
33 Correct 7 ms 5128 KB Output is correct
34 Correct 5 ms 5068 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 60 ms 6036 KB Output is correct
37 Correct 52 ms 6400 KB Output is correct
38 Correct 50 ms 6520 KB Output is correct
39 Correct 49 ms 6784 KB Output is correct
40 Correct 45 ms 6724 KB Output is correct
41 Correct 5 ms 5112 KB Output is correct
42 Correct 59 ms 6540 KB Output is correct
43 Correct 44 ms 6784 KB Output is correct
44 Correct 45 ms 6784 KB Output is correct
45 Correct 47 ms 6652 KB Output is correct
46 Correct 42 ms 6784 KB Output is correct
47 Correct 41 ms 6784 KB Output is correct