oj.uz

Submission #719177

# Submission time Handle Problem Language Result Execution time Memory
719177 2023-04-05T15:04:56 Z thimote75 Mutating DNA (IOI21_dna) C++17
100 / 100
 75 ms 16620 KB 
#include "dna.h"

#include <bits/stdc++.h>
using namespace std;

int to_int(char ch) {
	if (ch == 'A') return 0;
	if (ch == 'C') return 1;
	if (ch == 'T') return 2;

	assert(false);
}

struct SGD {
	int m[3][3];

	void init () {
		for (int i = 0; i < 3; i ++)
			for (int j = 0; j < 3; j ++)
				m[i][j] = 0;
	}
	SGD () { init(); }
	SGD (char a, char b) {
		init();
		int ia = to_int(a);
		int ib = to_int(b);

		m[ia][ib] ++;
	}

	SGD merge (SGD &other) {
		SGD res;

		for (int i = 0; i < 3; i ++)
			for (int j = 0; j < 3; j ++)
				res.m[i][j] = m[i][j] + other.m[i][j];
	
		return res;
	}
	int flux (int i) {
		int f = 0;
		for (int j = 0; j < 3; j ++) {
			if (j == i) continue ;

			f -= m[i][j];
			f += m[j][i];
		}

		return f;
	}
	int distance () {
		if (flux(0) != 0
		 || flux(1) != 0
		 || flux(2) != 0)
		 	return -1;

		int r[3][3];
		for (int i = 0; i < 3; i ++) for (int j = 0; j < 3; j ++)
			r[i][j] = m[i][j];
		
		int dist = 0;
		for (int i = 0; i < 3; i ++) {
			for (int j = i + 1; j < 3; j ++) {
				dist += min(r[j][i], r[i][j]);

				r[i][j] -= r[j][i];
				r[j][i]  = 0;
			}
		}

		int residual  = abs(r[0][2]);
		if (residual != abs(r[0][1])) return -1;
		if (residual != abs(r[1][2])) return -1;

		dist += 2 * residual;

		return dist;
	}
};

struct SegTree {
	int size, start, height;
	vector<SGD> tree;

	SegTree () = default;
	SegTree (vector<SGD> &values) {
		size = values.size();
		height = ceil(log2(size));
		start = 1 << height;

		tree.resize(start << 1);

		for (int i = 0; i < size; i ++)
			tree[i + start] = values[i];
	
		for (int i = start - 1; i >= 1; i --) {
			int n0 = i << 1;
			int n1 = n0 + 1;

			tree[i] = tree[n0].merge(tree[n1]);
		}
	}

	SGD query (int x, int y) {
		x += start;
		y += start;

		SGD res;

		while (x < y) {
			if ((x & 1) == 1) res = res.merge(tree[x]);
			if ((y & 1) == 0) res = res.merge(tree[y]);
		
			x = (x + 1) >> 1;
			y = (y - 1) >> 1;
		}

		if (x == y) res = res.merge(tree[x]);

		return res;
	}
};

vector<SGD> object_array;
SegTree tree;

void init(string a, string b) {
	object_array.resize(a.size());
	for (int i = 0; i < a.size(); i ++)
		object_array[i] = SGD(a[i], b[i]);

	tree = SegTree(object_array);
}

int get_distance(int x, int y) {
	SGD res = tree.query(x, y);

	return res.distance();
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:129:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |  for (int i = 0; i < a.size(); i ++)
      |                  ~~^~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 14860 KB Output is correct
2 Correct 48 ms 15004 KB Output is correct
3 Correct 42 ms 14568 KB Output is correct
4 Correct 42 ms 14892 KB Output is correct
5 Correct 1 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 1 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 11 ms 13524 KB Output is correct
5 Correct 11 ms 13620 KB Output is correct
6 Correct 11 ms 13524 KB Output is correct
7 Correct 11 ms 13268 KB Output is correct
8 Correct 13 ms 13652 KB Output is correct
9 Correct 11 ms 13660 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 11 ms 13524 KB Output is correct
5 Correct 11 ms 13620 KB Output is correct
6 Correct 11 ms 13524 KB Output is correct
7 Correct 11 ms 13268 KB Output is correct
8 Correct 13 ms 13652 KB Output is correct
9 Correct 11 ms 13660 KB Output is correct
10 Correct 42 ms 14840 KB Output is correct
11 Correct 44 ms 14852 KB Output is correct
12 Correct 68 ms 14992 KB Output is correct
13 Correct 67 ms 16416 KB Output is correct
14 Correct 66 ms 16564 KB Output is correct
15 Correct 66 ms 16520 KB Output is correct
16 Correct 60 ms 16184 KB Output is correct
17 Correct 65 ms 16276 KB Output is correct
18 Correct 75 ms 16496 KB Output is correct
19 Correct 59 ms 16276 KB Output is correct
20 Correct 63 ms 16312 KB Output is correct
21 Correct 60 ms 16500 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 11 ms 13524 KB Output is correct
5 Correct 11 ms 13620 KB Output is correct
6 Correct 11 ms 13524 KB Output is correct
7 Correct 11 ms 13268 KB Output is correct
8 Correct 13 ms 13652 KB Output is correct
9 Correct 11 ms 13660 KB Output is correct
10 Correct 14 ms 13268 KB Output is correct
11 Correct 12 ms 13652 KB Output is correct
12 Correct 12 ms 13316 KB Output is correct
13 Correct 12 ms 13624 KB Output is correct
14 Correct 12 ms 13652 KB Output is correct
15 Correct 13 ms 13656 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 14860 KB Output is correct
2 Correct 48 ms 15004 KB Output is correct
3 Correct 42 ms 14568 KB Output is correct
4 Correct 42 ms 14892 KB Output is correct
5 Correct 1 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 1 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 11 ms 13524 KB Output is correct
12 Correct 11 ms 13620 KB Output is correct
13 Correct 11 ms 13524 KB Output is correct
14 Correct 11 ms 13268 KB Output is correct
15 Correct 13 ms 13652 KB Output is correct
16 Correct 11 ms 13660 KB Output is correct
17 Correct 42 ms 14840 KB Output is correct
18 Correct 44 ms 14852 KB Output is correct
19 Correct 68 ms 14992 KB Output is correct
20 Correct 67 ms 16416 KB Output is correct
21 Correct 66 ms 16564 KB Output is correct
22 Correct 66 ms 16520 KB Output is correct
23 Correct 60 ms 16184 KB Output is correct
24 Correct 65 ms 16276 KB Output is correct
25 Correct 75 ms 16496 KB Output is correct
26 Correct 59 ms 16276 KB Output is correct
27 Correct 63 ms 16312 KB Output is correct
28 Correct 60 ms 16500 KB Output is correct
29 Correct 14 ms 13268 KB Output is correct
30 Correct 12 ms 13652 KB Output is correct
31 Correct 12 ms 13316 KB Output is correct
32 Correct 12 ms 13624 KB Output is correct
33 Correct 12 ms 13652 KB Output is correct
34 Correct 13 ms 13656 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 46 ms 15968 KB Output is correct
37 Correct 44 ms 16264 KB Output is correct
38 Correct 66 ms 16404 KB Output is correct
39 Correct 68 ms 16576 KB Output is correct
40 Correct 64 ms 16620 KB Output is correct
41 Correct 12 ms 13780 KB Output is correct
42 Correct 59 ms 16264 KB Output is correct
43 Correct 72 ms 16504 KB Output is correct
44 Correct 63 ms 16496 KB Output is correct
45 Correct 64 ms 16244 KB Output is correct
46 Correct 63 ms 16496 KB Output is correct
47 Correct 62 ms 16584 KB Output is correct