oj.uz

Submission #568173

# Submission time Handle Problem Language Result Execution time Memory
568173 2022-05-24T19:17:58 Z d4xn Mutating DNA (IOI21_dna) C++17
56 / 100
 34 ms 5264 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5+5;

int pa[2][N];
int pt[2][N];
int pc[2][N];
int pdif[N];

void init(std::string a, std::string b) {
	int n = min(a.size(), b.size());
	for (int i = 0; i < n; i++) {
		pa[0][i] = (i == 0 ? 0 : pa[0][i-1]);
		pt[0][i] = (i == 0 ? 0 : pt[0][i-1]);
		pc[0][i] = (i == 0 ? 0 : pc[0][i-1]);
		pa[1][i] = (i == 0 ? 0 : pa[1][i-1]);
		pt[1][i] = (i == 0 ? 0 : pt[1][i-1]);
		pc[1][i] = (i == 0 ? 0 : pc[1][i-1]);
		pdif[i] = (i == 0 ? 0 : pdif[i-1]);

		if (a[i] == 'A') pa[0][i]++;
		if (a[i] == 'T') pt[0][i]++;
		if (a[i] == 'C') pc[0][i]++;

		if (b[i] == 'A') pa[1][i]++;
		if (b[i] == 'T') pt[1][i]++;
		if (b[i] == 'C') pc[1][i]++;

		if (a[i] != b[i]) pdif[i]++;
	}
}

int get_distance(int x, int y) {
	int aa, ab, ta, tb, ca, cb, dif;
	aa = pa[0][y] - (x == 0 ? 0 : pa[0][x-1]);
	ab = pa[1][y] - (x == 0 ? 0 : pa[1][x-1]);
	ta = pt[0][y] - (x == 0 ? 0 : pt[0][x-1]);
	tb = pt[1][y] - (x == 0 ? 0 : pt[1][x-1]);
	ca = pc[0][y] - (x == 0 ? 0 : pc[0][x-1]);
	cb = pc[1][y] - (x == 0 ? 0 : pc[1][x-1]);
	dif = pdif[y] - (x == 0 ? 0 : pdif[x-1]);

	if (aa != ab || ta != tb || ca != cb) return -1;

	if ((aa && ta && !ca) || (ta && ca && !aa) || (aa && ca && !ta))return dif/2 + dif%2;
	else {
		
	}
}

Compilation message

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

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 4932 KB Output is correct
2 Correct 30 ms 4880 KB Output is correct
3 Correct 32 ms 4548 KB Output is correct
4 Correct 31 ms 4852 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 1 ms 212 KB Output is correct
4 Correct 4 ms 3540 KB Output is correct
5 Correct 4 ms 3540 KB Output is correct
6 Correct 4 ms 3540 KB Output is correct
7 Correct 4 ms 3412 KB Output is correct
8 Correct 4 ms 3540 KB Output is correct
9 Correct 3 ms 3552 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 1 ms 212 KB Output is correct
4 Correct 4 ms 3540 KB Output is correct
5 Correct 4 ms 3540 KB Output is correct
6 Correct 4 ms 3540 KB Output is correct
7 Correct 4 ms 3412 KB Output is correct
8 Correct 4 ms 3540 KB Output is correct
9 Correct 3 ms 3552 KB Output is correct
10 Correct 32 ms 4916 KB Output is correct
11 Correct 30 ms 4836 KB Output is correct
12 Correct 32 ms 4988 KB Output is correct
13 Correct 30 ms 5124 KB Output is correct
14 Correct 34 ms 5220 KB Output is correct
15 Correct 28 ms 5128 KB Output is correct
16 Correct 29 ms 5024 KB Output is correct
17 Correct 31 ms 5072 KB Output is correct
18 Correct 31 ms 5264 KB Output is correct
19 Correct 27 ms 5056 KB Output is correct
20 Correct 27 ms 5148 KB Output is correct
21 Correct 27 ms 5256 KB Output is correct

Subtask #4
0.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 1 ms 212 KB Output is correct
4 Correct 4 ms 3540 KB Output is correct
5 Correct 4 ms 3540 KB Output is correct
6 Correct 4 ms 3540 KB Output is correct
7 Correct 4 ms 3412 KB Output is correct
8 Correct 4 ms 3540 KB Output is correct
9 Correct 3 ms 3552 KB Output is correct
10 Correct 5 ms 3284 KB Output is correct
11 Correct 4 ms 3540 KB Output is correct
12 Incorrect 4 ms 3412 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 4932 KB Output is correct
2 Correct 30 ms 4880 KB Output is correct
3 Correct 32 ms 4548 KB Output is correct
4 Correct 31 ms 4852 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 1 ms 212 KB Output is correct
11 Correct 4 ms 3540 KB Output is correct
12 Correct 4 ms 3540 KB Output is correct
13 Correct 4 ms 3540 KB Output is correct
14 Correct 4 ms 3412 KB Output is correct
15 Correct 4 ms 3540 KB Output is correct
16 Correct 3 ms 3552 KB Output is correct
17 Correct 32 ms 4916 KB Output is correct
18 Correct 30 ms 4836 KB Output is correct
19 Correct 32 ms 4988 KB Output is correct
20 Correct 30 ms 5124 KB Output is correct
21 Correct 34 ms 5220 KB Output is correct
22 Correct 28 ms 5128 KB Output is correct
23 Correct 29 ms 5024 KB Output is correct
24 Correct 31 ms 5072 KB Output is correct
25 Correct 31 ms 5264 KB Output is correct
26 Correct 27 ms 5056 KB Output is correct
27 Correct 27 ms 5148 KB Output is correct
28 Correct 27 ms 5256 KB Output is correct
29 Correct 5 ms 3284 KB Output is correct
30 Correct 4 ms 3540 KB Output is correct
31 Incorrect 4 ms 3412 KB Output isn't correct
32 Halted 0 ms 0 KB -