oj.uz

Submission #806612

# Submission time Handle Problem Language Result Execution time Memory
806612 2023-08-04T08:19:42 Z nemethm Mutating DNA (IOI21_dna) C++17
100 / 100
 44 ms 7548 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long int;

int a[100100][2] = {0}, t[100100][2] = {0}, c[100100][2] = {0};

int at[100100] = {0}, ac[100100] = {0}, tc[100100] = {0},
	ta[100100] = {0}, ca[100100] = {0}, ct[100100] = {0};

void analyse(string& s, int p){
	for(int i = 0; i < s.size(); ++i){
		a[i + 1][p] = a[i][p];
		t[i + 1][p] = t[i][p];
		c[i + 1][p] = c[i][p];
		if(s[i] == 'A'){
			++a[i + 1][p];
		}
		if(s[i] == 'T'){
			++t[i + 1][p];
		}
		if(s[i] == 'C'){
			++c[i + 1][p];
		}
	}
}

void init(std::string s1, std::string s2) {
	analyse(s1, 0);
	analyse(s2, 1);
	for(int i = 0; i < s1.size(); ++i){
		at[i + 1] = at[i];
		ac[i + 1] = ac[i];
		tc[i + 1] = tc[i];

		ta[i + 1] = ta[i];
		ca[i + 1] = ca[i];
		ct[i + 1] = ct[i];
		if(s1[i] != s2[i]){
			if(s1[i] == 'A'){
				if(s2[i] == 'C'){
					++ac[i + 1];
				}
				else{
					++at[i + 1];
				}
			}
			if(s1[i] == 'T'){
				if(s2[i] == 'C'){
					++tc[i + 1];
				}
				else{
					++ta[i + 1];
				}
			}
			if(s1[i] == 'C'){
				if(s2[i] == 'A'){
					++ca[i + 1];
				}
				else{
					++ct[i + 1];
				}
			}
		}
	}
}

int sum(int x, int y, int t[][2], int p){
	return t[y][p] - t[x - 1][p];
}

int sum2(int x, int y, int t[]){
	return t[y] - t[x - 1];
}

int get_distance(int x, int y) {
	++x, ++y;
	if(sum(x, y, a, 0) == sum(x, y, a, 1) && sum(x, y, t, 0) == sum(x, y, t, 1) && sum(x, y, c, 0) == sum(x, y, c, 1)){
		int excess = abs(sum2(x, y, ac) - sum2(x, y, ca)) + abs(sum2(x, y, at) - sum2(x, y, ta)) + abs(sum2(x, y, ct) - sum2(x, y, tc));
		int sol = min(sum2(x, y, ac), sum2(x, y, ca)) + min(sum2(x, y, at), sum2(x, y, ta)) + min(sum2(x, y, ct), sum2(x, y, tc));
		sol += excess * 2 / 3;
		return sol;
	}
	return -1;
}

Compilation message

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

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 6924 KB Output is correct
2 Correct 28 ms 6976 KB Output is correct
3 Correct 35 ms 6500 KB Output is correct
4 Correct 40 ms 7008 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 5564 KB Output is correct
5 Correct 5 ms 5648 KB Output is correct
6 Correct 6 ms 5588 KB Output is correct
7 Correct 7 ms 5332 KB Output is correct
8 Correct 5 ms 5688 KB Output is correct
9 Correct 4 ms 5716 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 5564 KB Output is correct
5 Correct 5 ms 5648 KB Output is correct
6 Correct 6 ms 5588 KB Output is correct
7 Correct 7 ms 5332 KB Output is correct
8 Correct 5 ms 5688 KB Output is correct
9 Correct 4 ms 5716 KB Output is correct
10 Correct 32 ms 6972 KB Output is correct
11 Correct 41 ms 6920 KB Output is correct
12 Correct 29 ms 6920 KB Output is correct
13 Correct 30 ms 7176 KB Output is correct
14 Correct 30 ms 7256 KB Output is correct
15 Correct 28 ms 7304 KB Output is correct
16 Correct 42 ms 6960 KB Output is correct
17 Correct 31 ms 7144 KB Output is correct
18 Correct 29 ms 7328 KB Output is correct
19 Correct 27 ms 7032 KB Output is correct
20 Correct 27 ms 7128 KB Output is correct
21 Correct 29 ms 7312 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 5564 KB Output is correct
5 Correct 5 ms 5648 KB Output is correct
6 Correct 6 ms 5588 KB Output is correct
7 Correct 7 ms 5332 KB Output is correct
8 Correct 5 ms 5688 KB Output is correct
9 Correct 4 ms 5716 KB Output is correct
10 Correct 5 ms 5216 KB Output is correct
11 Correct 6 ms 5620 KB Output is correct
12 Correct 5 ms 5352 KB Output is correct
13 Correct 7 ms 5588 KB Output is correct
14 Correct 6 ms 5616 KB Output is correct
15 Correct 5 ms 5636 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 6924 KB Output is correct
2 Correct 28 ms 6976 KB Output is correct
3 Correct 35 ms 6500 KB Output is correct
4 Correct 40 ms 7008 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 5 ms 5564 KB Output is correct
12 Correct 5 ms 5648 KB Output is correct
13 Correct 6 ms 5588 KB Output is correct
14 Correct 7 ms 5332 KB Output is correct
15 Correct 5 ms 5688 KB Output is correct
16 Correct 4 ms 5716 KB Output is correct
17 Correct 32 ms 6972 KB Output is correct
18 Correct 41 ms 6920 KB Output is correct
19 Correct 29 ms 6920 KB Output is correct
20 Correct 30 ms 7176 KB Output is correct
21 Correct 30 ms 7256 KB Output is correct
22 Correct 28 ms 7304 KB Output is correct
23 Correct 42 ms 6960 KB Output is correct
24 Correct 31 ms 7144 KB Output is correct
25 Correct 29 ms 7328 KB Output is correct
26 Correct 27 ms 7032 KB Output is correct
27 Correct 27 ms 7128 KB Output is correct
28 Correct 29 ms 7312 KB Output is correct
29 Correct 5 ms 5216 KB Output is correct
30 Correct 6 ms 5620 KB Output is correct
31 Correct 5 ms 5352 KB Output is correct
32 Correct 7 ms 5588 KB Output is correct
33 Correct 6 ms 5616 KB Output is correct
34 Correct 5 ms 5636 KB Output is correct
35 Correct 0 ms 308 KB Output is correct
36 Correct 41 ms 6552 KB Output is correct
37 Correct 31 ms 6920 KB Output is correct
38 Correct 30 ms 7020 KB Output is correct
39 Correct 31 ms 7336 KB Output is correct
40 Correct 40 ms 7304 KB Output is correct
41 Correct 7 ms 5728 KB Output is correct
42 Correct 36 ms 7220 KB Output is correct
43 Correct 44 ms 7476 KB Output is correct
44 Correct 37 ms 7500 KB Output is correct
45 Correct 29 ms 7228 KB Output is correct
46 Correct 33 ms 7480 KB Output is correct
47 Correct 30 ms 7548 KB Output is correct