Submission #794614

# Submission time Handle Problem Language Result Execution time Memory
794614 2023-07-26T16:28:18 Z mathematik Mutating DNA (IOI21_dna) C++17
100 / 100
79 ms 23564 KB
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

const string ATC = "ATC";

vector<vector<vector<int>>> amounts;
void init(std::string a, std::string b) {
	amounts = vector<vector<vector<int>>>(a.length() + 1, {{0, 0, 0}, {0, 0, 0}, {0, 0, 0}});
	for (int i = 0; i < a.length(); i++)
	{
		amounts[i + 1] = amounts[i];
		amounts[i + 1][ATC.find(a[i])][ATC.find(b[i])]++;
	}
}

int get_distance(int x, int y) {
	vector<vector<int>> t = {{0, 0, 0}, {0, 0, 0}, {0, 0, 0}};
	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			t[i][j] = amounts[y + 1][i][j] - amounts[x][i][j];
		}
	}
	
	int cost = 0;
	int c;

	for (int i = 0; i < 3; i++)
	{
		c = min(t[i][(i + 1) % 3], t[(i + 1) % 3][i]);
		t[i][(i + 1) % 3] -= c;
		t[(i + 1) % 3][i] -= c;
		cost += c;
	}
	
	c = min(t[0][1], min(t[1][2], t[2][0]));
	t[0][1] -= c;
	t[1][2] -= c;
	t[2][0] -= c;
	cost += 2 * c;

	c = min(t[0][2], min(t[2][1], t[1][0]));
	t[0][2] -= c;
	t[2][1] -= c;
	t[1][0] -= c;
	cost += 2 * c;

	return t[0][1] + t[1][0] + t[0][2] + t[2][0] + t[1][2] + t[2][1] == 0 ? cost : -1;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:11:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |  for (int i = 0; i < a.length(); i++)
      |                  ~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 65 ms 22860 KB Output is correct
2 Correct 72 ms 23100 KB Output is correct
3 Correct 79 ms 21448 KB Output is correct
4 Correct 65 ms 23096 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 22 ms 20316 KB Output is correct
5 Correct 22 ms 20664 KB Output is correct
6 Correct 24 ms 20432 KB Output is correct
7 Correct 21 ms 19264 KB Output is correct
8 Correct 22 ms 20568 KB Output is correct
9 Correct 22 ms 20628 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 22 ms 20316 KB Output is correct
5 Correct 22 ms 20664 KB Output is correct
6 Correct 24 ms 20432 KB Output is correct
7 Correct 21 ms 19264 KB Output is correct
8 Correct 22 ms 20568 KB Output is correct
9 Correct 22 ms 20628 KB Output is correct
10 Correct 65 ms 22904 KB Output is correct
11 Correct 68 ms 23056 KB Output is correct
12 Correct 67 ms 22056 KB Output is correct
13 Correct 68 ms 22564 KB Output is correct
14 Correct 69 ms 23464 KB Output is correct
15 Correct 70 ms 23348 KB Output is correct
16 Correct 62 ms 21896 KB Output is correct
17 Correct 62 ms 22480 KB Output is correct
18 Correct 64 ms 23344 KB Output is correct
19 Correct 55 ms 21984 KB Output is correct
20 Correct 57 ms 22468 KB Output is correct
21 Correct 58 ms 23448 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 22 ms 20316 KB Output is correct
5 Correct 22 ms 20664 KB Output is correct
6 Correct 24 ms 20432 KB Output is correct
7 Correct 21 ms 19264 KB Output is correct
8 Correct 22 ms 20568 KB Output is correct
9 Correct 22 ms 20628 KB Output is correct
10 Correct 20 ms 18832 KB Output is correct
11 Correct 22 ms 20644 KB Output is correct
12 Correct 21 ms 19308 KB Output is correct
13 Correct 22 ms 20444 KB Output is correct
14 Correct 22 ms 20592 KB Output is correct
15 Correct 24 ms 20588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 65 ms 22860 KB Output is correct
2 Correct 72 ms 23100 KB Output is correct
3 Correct 79 ms 21448 KB Output is correct
4 Correct 65 ms 23096 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 22 ms 20316 KB Output is correct
12 Correct 22 ms 20664 KB Output is correct
13 Correct 24 ms 20432 KB Output is correct
14 Correct 21 ms 19264 KB Output is correct
15 Correct 22 ms 20568 KB Output is correct
16 Correct 22 ms 20628 KB Output is correct
17 Correct 65 ms 22904 KB Output is correct
18 Correct 68 ms 23056 KB Output is correct
19 Correct 67 ms 22056 KB Output is correct
20 Correct 68 ms 22564 KB Output is correct
21 Correct 69 ms 23464 KB Output is correct
22 Correct 70 ms 23348 KB Output is correct
23 Correct 62 ms 21896 KB Output is correct
24 Correct 62 ms 22480 KB Output is correct
25 Correct 64 ms 23344 KB Output is correct
26 Correct 55 ms 21984 KB Output is correct
27 Correct 57 ms 22468 KB Output is correct
28 Correct 58 ms 23448 KB Output is correct
29 Correct 20 ms 18832 KB Output is correct
30 Correct 22 ms 20644 KB Output is correct
31 Correct 21 ms 19308 KB Output is correct
32 Correct 22 ms 20444 KB Output is correct
33 Correct 22 ms 20592 KB Output is correct
34 Correct 24 ms 20588 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 60 ms 21296 KB Output is correct
37 Correct 66 ms 23116 KB Output is correct
38 Correct 67 ms 22240 KB Output is correct
39 Correct 69 ms 23476 KB Output is correct
40 Correct 78 ms 23564 KB Output is correct
41 Correct 22 ms 20564 KB Output is correct
42 Correct 62 ms 22132 KB Output is correct
43 Correct 66 ms 23372 KB Output is correct
44 Correct 64 ms 23388 KB Output is correct
45 Correct 59 ms 22220 KB Output is correct
46 Correct 57 ms 23372 KB Output is correct
47 Correct 58 ms 23368 KB Output is correct