oj.uz

Submission #825303

# Submission time Handle Problem Language Result Execution time Memory
825303 2023-08-14T17:07:20 Z arnold518 Mutating DNA (IOI21_dna) C++17
100 / 100
 29 ms 6064 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

int N, P[MAXN+10][3][3];

int f(char x)
{
	if(x=='A') return 0;
	if(x=='C') return 1;
	if(x=='T') return 2;
}

void init(string a, string b)
{
	N=a.size();
	for(int i=1; i<=N; i++)
	{
		for(int p=0; p<3; p++) for(int q=0; q<3; q++) P[i][p][q]=P[i-1][p][q];
		P[i][f(a[i-1])][f(b[i-1])]++;
	}
}

int get_distance(int l, int r) {
	l++; r++;
	int A[3][3]={{0}};
	for(int p=0; p<3; p++) for(int q=0; q<3; q++) A[p][q]=P[r][p][q]-P[l-1][p][q];
	for(int p=0; p<3; p++)
	{
		int t=0;
		for(int q=0; q<3; q++) t+=A[p][q]-A[q][p];
		if(t) return -1;
	}

	int ans=0, a;
	ans+=min(A[0][1], A[1][0]); a=abs(A[0][1]-A[1][0]);
	ans+=min(A[0][2], A[2][0]);
	ans+=min(A[2][1], A[1][2]);
	ans+=a*2;
	return ans;
}

Compilation message

dna.cpp: In function 'int f(char)':
dna.cpp:18:1: warning: control reaches end of non-void function [-Wreturn-type]
   18 | }
      | ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5652 KB Output is correct
2 Correct 25 ms 5648 KB Output is correct
3 Correct 24 ms 5368 KB Output is correct
4 Correct 25 ms 5700 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 4 ms 4308 KB Output is correct
9 Correct 3 ms 4308 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 4 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 26 ms 5684 KB Output is correct
11 Correct 25 ms 5652 KB Output is correct
12 Correct 26 ms 5760 KB Output is correct
13 Correct 29 ms 5864 KB Output is correct
14 Correct 27 ms 6024 KB Output is correct
15 Correct 29 ms 6028 KB Output is correct
16 Correct 26 ms 5756 KB Output is correct
17 Correct 25 ms 5916 KB Output is correct
18 Correct 26 ms 6036 KB Output is correct
19 Correct 24 ms 5792 KB Output is correct
20 Correct 25 ms 5880 KB Output is correct
21 Correct 24 ms 6032 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 4 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 3 ms 4004 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 3 ms 4052 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 3 ms 4308 KB Output is correct
15 Correct 3 ms 4308 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5652 KB Output is correct
2 Correct 25 ms 5648 KB Output is correct
3 Correct 24 ms 5368 KB Output is correct
4 Correct 25 ms 5700 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 3 ms 4308 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 4 ms 4052 KB Output is correct
15 Correct 4 ms 4308 KB Output is correct
16 Correct 3 ms 4308 KB Output is correct
17 Correct 26 ms 5684 KB Output is correct
18 Correct 25 ms 5652 KB Output is correct
19 Correct 26 ms 5760 KB Output is correct
20 Correct 29 ms 5864 KB Output is correct
21 Correct 27 ms 6024 KB Output is correct
22 Correct 29 ms 6028 KB Output is correct
23 Correct 26 ms 5756 KB Output is correct
24 Correct 25 ms 5916 KB Output is correct
25 Correct 26 ms 6036 KB Output is correct
26 Correct 24 ms 5792 KB Output is correct
27 Correct 25 ms 5880 KB Output is correct
28 Correct 24 ms 6032 KB Output is correct
29 Correct 3 ms 4004 KB Output is correct
30 Correct 3 ms 4308 KB Output is correct
31 Correct 3 ms 4052 KB Output is correct
32 Correct 3 ms 4308 KB Output is correct
33 Correct 3 ms 4308 KB Output is correct
34 Correct 3 ms 4308 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 24 ms 5372 KB Output is correct
37 Correct 25 ms 5616 KB Output is correct
38 Correct 29 ms 5764 KB Output is correct
39 Correct 26 ms 6028 KB Output is correct
40 Correct 26 ms 6032 KB Output is correct
41 Correct 3 ms 4308 KB Output is correct
42 Correct 25 ms 5760 KB Output is correct
43 Correct 25 ms 5996 KB Output is correct
44 Correct 25 ms 6036 KB Output is correct
45 Correct 24 ms 5872 KB Output is correct
46 Correct 29 ms 6056 KB Output is correct
47 Correct 24 ms 6064 KB Output is correct