oj.uz

Submission #466317

# Submission time Handle Problem Language Result Execution time Memory
466317 2021-08-18T14:37:32 Z popovicirobert Mutating DNA (IOI21_dna) C++17
100 / 100
 53 ms 7444 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

constexpr int N = (int)1e5;
constexpr int SIGMA = 256;

static int freq[N + 1][3][3];
static int id[SIGMA];
static int n;

void init(std::string a, std::string b) {
	id['A'] = 0;
	id['C'] = 1;
	id['T'] = 2;

	n = a.size();
	a = " " + a;
	b = " " + b;

	for (int i = 1; i <= n; i++) {
		for (int x = 0; x < 3; x++) {
			for (int y = 0; y < 3; y++) {
				freq[i][x][y] = freq[i - 1][x][y] + (id[a[i]] == x && id[b[i]] == y);
			}
		}
	}
}

int get_distance(int x, int y) {
	x++, y++;

	static int currFreq[3][3];
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			currFreq[i][j] = freq[y][i][j] - freq[x - 1][i][j];
			// cerr << currFreq[i][j] << " ";
		} 
		// cerr << "\n";
	}
	// cerr << "\n";

	int answer = 0;
	auto Update = [&answer](int id1, int id2) {
		int curr = min(currFreq[id1][id2], currFreq[id2][id1]);
		currFreq[id1][id2] -= curr;
		currFreq[id2][id1] -= curr;
		answer += curr;
	};

	Update(0, 1);
	Update(1, 2);
	Update(0, 2);

	if (currFreq[0][1] != currFreq[1][2] || currFreq[1][2] != currFreq[2][0] ||
		currFreq[0][2] != currFreq[2][1] || currFreq[2][1] != currFreq[1][0]) {
		return -1;
	}

	int mx = 0;
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			if (i != j) {
				mx = max(mx, currFreq[i][j]);
			}
		}
	}
	answer += 2 * mx;
	// cerr << "DEBUG: " << mx << "\n";

	return answer;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:25:49: warning: array subscript has type 'char' [-Wchar-subscripts]
   25 |     freq[i][x][y] = freq[i - 1][x][y] + (id[a[i]] == x && id[b[i]] == y);
      |                                                 ^
dna.cpp:25:66: warning: array subscript has type 'char' [-Wchar-subscripts]
   25 |     freq[i][x][y] = freq[i - 1][x][y] + (id[a[i]] == x && id[b[i]] == y);
      |                                                                  ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 6956 KB Output is correct
2 Correct 42 ms 7008 KB Output is correct
3 Correct 39 ms 6656 KB Output is correct
4 Correct 43 ms 6964 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 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 5 ms 4556 KB Output is correct
5 Correct 6 ms 4664 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 5 ms 4632 KB Output is correct
9 Correct 5 ms 4684 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 5 ms 4556 KB Output is correct
5 Correct 6 ms 4664 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 5 ms 4632 KB Output is correct
9 Correct 5 ms 4684 KB Output is correct
10 Correct 40 ms 6964 KB Output is correct
11 Correct 40 ms 7000 KB Output is correct
12 Correct 44 ms 7052 KB Output is correct
13 Correct 53 ms 7196 KB Output is correct
14 Correct 42 ms 7444 KB Output is correct
15 Correct 40 ms 7328 KB Output is correct
16 Correct 42 ms 7012 KB Output is correct
17 Correct 41 ms 7096 KB Output is correct
18 Correct 40 ms 7216 KB Output is correct
19 Correct 38 ms 6972 KB Output is correct
20 Correct 40 ms 7088 KB Output is correct
21 Correct 38 ms 7308 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 5 ms 4556 KB Output is correct
5 Correct 6 ms 4664 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4300 KB Output is correct
8 Correct 5 ms 4632 KB Output is correct
9 Correct 5 ms 4684 KB Output is correct
10 Correct 6 ms 4300 KB Output is correct
11 Correct 7 ms 4664 KB Output is correct
12 Correct 5 ms 4300 KB Output is correct
13 Correct 5 ms 4668 KB Output is correct
14 Correct 6 ms 4668 KB Output is correct
15 Correct 6 ms 4684 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 6956 KB Output is correct
2 Correct 42 ms 7008 KB Output is correct
3 Correct 39 ms 6656 KB Output is correct
4 Correct 43 ms 6964 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 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 5 ms 4556 KB Output is correct
12 Correct 6 ms 4664 KB Output is correct
13 Correct 5 ms 4556 KB Output is correct
14 Correct 5 ms 4300 KB Output is correct
15 Correct 5 ms 4632 KB Output is correct
16 Correct 5 ms 4684 KB Output is correct
17 Correct 40 ms 6964 KB Output is correct
18 Correct 40 ms 7000 KB Output is correct
19 Correct 44 ms 7052 KB Output is correct
20 Correct 53 ms 7196 KB Output is correct
21 Correct 42 ms 7444 KB Output is correct
22 Correct 40 ms 7328 KB Output is correct
23 Correct 42 ms 7012 KB Output is correct
24 Correct 41 ms 7096 KB Output is correct
25 Correct 40 ms 7216 KB Output is correct
26 Correct 38 ms 6972 KB Output is correct
27 Correct 40 ms 7088 KB Output is correct
28 Correct 38 ms 7308 KB Output is correct
29 Correct 6 ms 4300 KB Output is correct
30 Correct 7 ms 4664 KB Output is correct
31 Correct 5 ms 4300 KB Output is correct
32 Correct 5 ms 4668 KB Output is correct
33 Correct 6 ms 4668 KB Output is correct
34 Correct 6 ms 4684 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 46 ms 6660 KB Output is correct
37 Correct 41 ms 6980 KB Output is correct
38 Correct 41 ms 7116 KB Output is correct
39 Correct 42 ms 7328 KB Output is correct
40 Correct 42 ms 7312 KB Output is correct
41 Correct 5 ms 4684 KB Output is correct
42 Correct 38 ms 6984 KB Output is correct
43 Correct 39 ms 7328 KB Output is correct
44 Correct 39 ms 7308 KB Output is correct
45 Correct 37 ms 7072 KB Output is correct
46 Correct 38 ms 7280 KB Output is correct
47 Correct 38 ms 7308 KB Output is correct