oj.uz

Submission #817862

# Submission time Handle Problem Language Result Execution time Memory
817862 2023-08-09T18:11:51 Z Username4132 Mutating DNA (IOI21_dna) C++17
100 / 100
 28 ms 8208 KB 
#include "dna.h"
#include<iostream>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)

const int MAXN = 100010;
int assi[255];
int n, arr[MAXN], brr[MAXN];
int tr[MAXN][3][3], aux[3][3], cha[3];

void init(std::string a, std::string b) {
	n = (int)a.size();
	assi['A']=0, assi['C']=1, assi['T']=2;
	forn(i, n){
		arr[i]=assi[a[i]], brr[i]=assi[b[i]];
		tr[i+1][arr[i]][brr[i]]=1;
	}
	forn(i, n) forn(j, 3) forn(k, 3) tr[i+1][j][k]+=tr[i][j][k];
}

int get_distance(int x, int y) {
	forn(i, 3) forn(j, 3) aux[i][j] = tr[y+1][i][j] - tr[x][i][j];
	forn(i, 3) cha[i]=0;
	forn(i, 3) forn(j, 3) cha[i]+=aux[i][j]-aux[j][i];
	if(cha[0] || cha[1] || cha[2]) return -1;
	int ret=0;
	forn(i, 3) ret+=min(aux[i][(i+1)%3], aux[(i+1)%3][i]);
	ret+=2*abs(aux[0][1]-aux[1][0]);
	return ret;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:15:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   15 |   arr[i]=assi[a[i]], brr[i]=assi[b[i]];
      |                   ^
dna.cpp:15:38: warning: array subscript has type 'char' [-Wchar-subscripts]
   15 |   arr[i]=assi[a[i]], brr[i]=assi[b[i]];
      |                                      ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 7700 KB Output is correct
2 Correct 25 ms 7796 KB Output is correct
3 Correct 25 ms 7340 KB Output is correct
4 Correct 25 ms 7804 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 5268 KB Output is correct
5 Correct 3 ms 5332 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 3 ms 4968 KB Output is correct
8 Correct 3 ms 5320 KB Output is correct
9 Correct 5 ms 5436 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 5268 KB Output is correct
5 Correct 3 ms 5332 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 3 ms 4968 KB Output is correct
8 Correct 3 ms 5320 KB Output is correct
9 Correct 5 ms 5436 KB Output is correct
10 Correct 25 ms 7780 KB Output is correct
11 Correct 25 ms 7792 KB Output is correct
12 Correct 26 ms 7820 KB Output is correct
13 Correct 26 ms 7868 KB Output is correct
14 Correct 27 ms 8120 KB Output is correct
15 Correct 26 ms 8056 KB Output is correct
16 Correct 25 ms 7688 KB Output is correct
17 Correct 26 ms 7900 KB Output is correct
18 Correct 26 ms 8056 KB Output is correct
19 Correct 24 ms 7720 KB Output is correct
20 Correct 24 ms 7828 KB Output is correct
21 Correct 28 ms 8072 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 5268 KB Output is correct
5 Correct 3 ms 5332 KB Output is correct
6 Correct 3 ms 5332 KB Output is correct
7 Correct 3 ms 4968 KB Output is correct
8 Correct 3 ms 5320 KB Output is correct
9 Correct 5 ms 5436 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 5332 KB Output is correct
12 Correct 3 ms 5060 KB Output is correct
13 Correct 4 ms 5352 KB Output is correct
14 Correct 3 ms 5332 KB Output is correct
15 Correct 3 ms 5332 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 7700 KB Output is correct
2 Correct 25 ms 7796 KB Output is correct
3 Correct 25 ms 7340 KB Output is correct
4 Correct 25 ms 7804 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 3 ms 5268 KB Output is correct
12 Correct 3 ms 5332 KB Output is correct
13 Correct 3 ms 5332 KB Output is correct
14 Correct 3 ms 4968 KB Output is correct
15 Correct 3 ms 5320 KB Output is correct
16 Correct 5 ms 5436 KB Output is correct
17 Correct 25 ms 7780 KB Output is correct
18 Correct 25 ms 7792 KB Output is correct
19 Correct 26 ms 7820 KB Output is correct
20 Correct 26 ms 7868 KB Output is correct
21 Correct 27 ms 8120 KB Output is correct
22 Correct 26 ms 8056 KB Output is correct
23 Correct 25 ms 7688 KB Output is correct
24 Correct 26 ms 7900 KB Output is correct
25 Correct 26 ms 8056 KB Output is correct
26 Correct 24 ms 7720 KB Output is correct
27 Correct 24 ms 7828 KB Output is correct
28 Correct 28 ms 8072 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 3 ms 5332 KB Output is correct
31 Correct 3 ms 5060 KB Output is correct
32 Correct 4 ms 5352 KB Output is correct
33 Correct 3 ms 5332 KB Output is correct
34 Correct 3 ms 5332 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 25 ms 7384 KB Output is correct
37 Correct 26 ms 7760 KB Output is correct
38 Correct 26 ms 7932 KB Output is correct
39 Correct 26 ms 8208 KB Output is correct
40 Correct 26 ms 8140 KB Output is correct
41 Correct 4 ms 5316 KB Output is correct
42 Correct 28 ms 7760 KB Output is correct
43 Correct 26 ms 8060 KB Output is correct
44 Correct 26 ms 8072 KB Output is correct
45 Correct 24 ms 7836 KB Output is correct
46 Correct 25 ms 8060 KB Output is correct
47 Correct 25 ms 8100 KB Output is correct