oj.uz

Submission #479933

# Submission time Handle Problem Language Result Execution time Memory
479933 2021-10-14T01:24:59 Z glome Mutating DNA (IOI21_dna) C++17
56 / 100
 115 ms 16768 KB 
#include "dna.h"

#include<bits/stdc++.h>

using namespace std;

vector<vector<int>> pref1(1e5, vector<int> (3, 0)), pref2(1e5, vector<int> (3, 0));
vector<int> sum(1e5, 0);

int n;

struct seg {
	vector<int> t = vector<int> (1e5 * 4);
	void build(int x, int l, int r) {
		if(l == r) {
			t[x] = sum[l];
			return;
		}
		int m = (l + r) / 2;
		build(2 * x, l, m);
		build(2 * x + 1, m + 1, r);
		t[x] = t[2 * x] + t[2 * x + 1];
	}
	void build() {
		build(1, 0, n - 1);
	}
	int ans(int x, int lx, int rx, int l, int r) {
		if(lx >= l && rx <= r) {
			return t[x];
		}
		if(lx > r || rx < l) {
			return 0;
		}
		int m = (lx + rx) / 2;
		return ans(2 * x, lx, m, l, r) + ans(2 * x + 1, m + 1, rx, l, r);
	}
	int ans(int l, int r) {
		return ans(1, 0, n - 1, l, r);
	}
};	

seg st;

void init(std::string a, std::string b) {
	n = a.size();;
	for (int i = 0; i<a.size(); i++) {
		pref1[i][0] = pref1[max(i-1, 0)][0];
		pref1[i][1] = pref1[max(i-1, 0)][1];
		pref1[i][2] = pref1[max(i-1, 0)][2];

		pref2[i][0] = pref2[max(i-1, 0)][0];
		pref2[i][1] = pref2[max(i-1, 0)][1];
		pref2[i][2] = pref2[max(i-1, 0)][2];

		if(a[i] == 'A') {
			pref1[i][0] += 1;
		}
		if(a[i] == 'T') {
			pref1[i][1] += 1;
		}
		if(a[i] == 'C') {
			pref1[i][2] += 1;
		}

		if(b[i] == 'A') {
			pref2[i][0] += 1;
		}
		if(b[i] == 'T') {
			pref2[i][1] += 1;
		}
		if(b[i] == 'C') {
			pref2[i][2] += 1;
		}
		if(a[i] != b[i]) {
			sum[i]++;
		}
	}
	st.build();
}

int get_distance(int x, int y) {
	if(pref1[y][0] - (x - 1 < 0 ? 0 : pref1[max(x-1, 0)][0]) != pref2[y][0] - (x - 1 < 0 ? 0 : pref2[max(x-1, 0)][0]) || pref1[y][1] - (x - 1 < 0 ? 0 : pref1[max(x-1, 0)][1]) != pref2[y][1] - (x - 1 < 0 ? 0 : pref2[max(x-1, 0)][1]) || pref1[y][2] - (x - 1 < 0 ? 0 : pref1[max(x-1, 0)][2]) != pref2[y][2] - (x - 1 < 0 ? 0 : pref2[max(x-1, 0)][2])) {
		return -1;
	}
	int k = st.ans(x, y);
	return (k & 1 ? k / 2 + 1 : k / 2);

}

Compilation message

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

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 16364 KB Output is correct
2 Correct 83 ms 16376 KB Output is correct
3 Correct 84 ms 16332 KB Output is correct
4 Correct 99 ms 16384 KB Output is correct
5 Correct 18 ms 13132 KB Output is correct
6 Correct 14 ms 13132 KB Output is correct
7 Correct 16 ms 13136 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 13132 KB Output is correct
2 Correct 13 ms 13132 KB Output is correct
3 Correct 13 ms 13132 KB Output is correct
4 Correct 17 ms 14004 KB Output is correct
5 Correct 18 ms 13928 KB Output is correct
6 Correct 17 ms 13900 KB Output is correct
7 Correct 20 ms 14028 KB Output is correct
8 Correct 18 ms 13900 KB Output is correct
9 Correct 20 ms 14008 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 13132 KB Output is correct
2 Correct 13 ms 13132 KB Output is correct
3 Correct 13 ms 13132 KB Output is correct
4 Correct 17 ms 14004 KB Output is correct
5 Correct 18 ms 13928 KB Output is correct
6 Correct 17 ms 13900 KB Output is correct
7 Correct 20 ms 14028 KB Output is correct
8 Correct 18 ms 13900 KB Output is correct
9 Correct 20 ms 14008 KB Output is correct
10 Correct 79 ms 16364 KB Output is correct
11 Correct 98 ms 16368 KB Output is correct
12 Correct 100 ms 16692 KB Output is correct
13 Correct 106 ms 16728 KB Output is correct
14 Correct 100 ms 16768 KB Output is correct
15 Correct 115 ms 16732 KB Output is correct
16 Correct 91 ms 16528 KB Output is correct
17 Correct 91 ms 16648 KB Output is correct
18 Correct 98 ms 16640 KB Output is correct
19 Correct 81 ms 16656 KB Output is correct
20 Correct 83 ms 16624 KB Output is correct
21 Correct 87 ms 16652 KB Output is correct

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 13132 KB Output is correct
2 Correct 13 ms 13132 KB Output is correct
3 Correct 13 ms 13132 KB Output is correct
4 Correct 17 ms 14004 KB Output is correct
5 Correct 18 ms 13928 KB Output is correct
6 Correct 17 ms 13900 KB Output is correct
7 Correct 20 ms 14028 KB Output is correct
8 Correct 18 ms 13900 KB Output is correct
9 Correct 20 ms 14008 KB Output is correct
10 Correct 17 ms 13932 KB Output is correct
11 Correct 18 ms 13944 KB Output is correct
12 Incorrect 18 ms 13900 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 87 ms 16364 KB Output is correct
2 Correct 83 ms 16376 KB Output is correct
3 Correct 84 ms 16332 KB Output is correct
4 Correct 99 ms 16384 KB Output is correct
5 Correct 18 ms 13132 KB Output is correct
6 Correct 14 ms 13132 KB Output is correct
7 Correct 16 ms 13136 KB Output is correct
8 Correct 13 ms 13132 KB Output is correct
9 Correct 13 ms 13132 KB Output is correct
10 Correct 13 ms 13132 KB Output is correct
11 Correct 17 ms 14004 KB Output is correct
12 Correct 18 ms 13928 KB Output is correct
13 Correct 17 ms 13900 KB Output is correct
14 Correct 20 ms 14028 KB Output is correct
15 Correct 18 ms 13900 KB Output is correct
16 Correct 20 ms 14008 KB Output is correct
17 Correct 79 ms 16364 KB Output is correct
18 Correct 98 ms 16368 KB Output is correct
19 Correct 100 ms 16692 KB Output is correct
20 Correct 106 ms 16728 KB Output is correct
21 Correct 100 ms 16768 KB Output is correct
22 Correct 115 ms 16732 KB Output is correct
23 Correct 91 ms 16528 KB Output is correct
24 Correct 91 ms 16648 KB Output is correct
25 Correct 98 ms 16640 KB Output is correct
26 Correct 81 ms 16656 KB Output is correct
27 Correct 83 ms 16624 KB Output is correct
28 Correct 87 ms 16652 KB Output is correct
29 Correct 17 ms 13932 KB Output is correct
30 Correct 18 ms 13944 KB Output is correct
31 Incorrect 18 ms 13900 KB Output isn't correct
32 Halted 0 ms 0 KB -