oj.uz

Submission #437337

# Submission time Handle Problem Language Result Execution time Memory
437337 2021-06-26T07:42:19 Z Mohammed_Atalah Mutating DNA (IOI21_dna) C++17
56 / 100
 80 ms 8040 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;


vector<int64_t> T1;
vector<int64_t> T2;
vector<int64_t> A1;
vector<int64_t> A2;
vector<int64_t> C1;
vector<int64_t> C2;

vector<int64_t> same;

void init(std::string a, std::string b) {

	int64_t len = a.size();

	T1.resize(len+1);
	T2.resize(len+1);
	A1.resize(len+1);
	A2.resize(len+1);
	C1.resize(len+1);
	C2.resize(len+1);
	same.resize(len+1);


	
	int64_t currA1 = 0;
	int64_t currT1 = 0;
	int64_t currA2 = 0;
	int64_t currT2 = 0;
	int64_t currC1 = 0;
	int64_t currC2 = 0;
	int64_t currsame = 0;

	for(int i = 0; i < len; i++){
		if(a[i] == 'A'){
			currA1++;
		}else if(a[i] == 'T'){
			currT1++;
		}else if(a[i] == 'C'){
			currC1++;
		}


		if(b[i] == 'A'){
			currA2++;
		}else if(b[i] == 'T'){
			currT2++;
		}else if(b[i] == 'C'){
			currC2++;
		}

		if(a[i] == b[i]){
			currsame++;
		}


		A1[i+1] = currA1;
		T1[i+1] = currT1;
		A2[i+1] = currA2;
		T2[i+1] = currT2;
		C1[i+1] = currC1;
		C2[i+1] = currC2;
		same[i+1] = currsame;


	}



}

int get_distance(int x, int y) {

	int64_t a1 = A1[y+1] - A1[x];
	int64_t t1 = T1[y+1] - T1[x];
	int64_t c1 = C1[y+1] - C1[x];
	int64_t a2 = A2[y+1] - A2[x];
	int64_t t2 = T2[y+1] - T2[x];
	int64_t c2 = C2[y+1] - C2[x];

	int64_t s = same[y+1] - same[x];
	// cout << s << endl;

	if(t1 != t2 || a1 != a2 || c1 != c2){
		// cout << t1 << " " << t2 << endl;
		// cout << a1 << " " << a2 << endl;
		// cout << c1 << " " << c2 << endl;
		return -1;
	}

	return ceil((((y-x)+1 ) - s )/ 2.0);

}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 7532 KB Output is correct
2 Correct 53 ms 7596 KB Output is correct
3 Correct 52 ms 7092 KB Output is correct
4 Correct 47 ms 7676 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 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 8 ms 6220 KB Output is correct
5 Correct 7 ms 6368 KB Output is correct
6 Correct 7 ms 6332 KB Output is correct
7 Correct 7 ms 5836 KB Output is correct
8 Correct 9 ms 6348 KB Output is correct
9 Correct 6 ms 6384 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 8 ms 6220 KB Output is correct
5 Correct 7 ms 6368 KB Output is correct
6 Correct 7 ms 6332 KB Output is correct
7 Correct 7 ms 5836 KB Output is correct
8 Correct 9 ms 6348 KB Output is correct
9 Correct 6 ms 6384 KB Output is correct
10 Correct 74 ms 7540 KB Output is correct
11 Correct 41 ms 7672 KB Output is correct
12 Correct 44 ms 7564 KB Output is correct
13 Correct 80 ms 7668 KB Output is correct
14 Correct 68 ms 7920 KB Output is correct
15 Correct 44 ms 7928 KB Output is correct
16 Correct 40 ms 7568 KB Output is correct
17 Correct 77 ms 7692 KB Output is correct
18 Correct 44 ms 7992 KB Output is correct
19 Correct 42 ms 7528 KB Output is correct
20 Correct 50 ms 7792 KB Output is correct
21 Correct 56 ms 8040 KB Output is correct

Subtask #4
0.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 8 ms 6220 KB Output is correct
5 Correct 7 ms 6368 KB Output is correct
6 Correct 7 ms 6332 KB Output is correct
7 Correct 7 ms 5836 KB Output is correct
8 Correct 9 ms 6348 KB Output is correct
9 Correct 6 ms 6384 KB Output is correct
10 Correct 7 ms 5832 KB Output is correct
11 Correct 8 ms 6348 KB Output is correct
12 Incorrect 7 ms 5964 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 57 ms 7532 KB Output is correct
2 Correct 53 ms 7596 KB Output is correct
3 Correct 52 ms 7092 KB Output is correct
4 Correct 47 ms 7676 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 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 8 ms 6220 KB Output is correct
12 Correct 7 ms 6368 KB Output is correct
13 Correct 7 ms 6332 KB Output is correct
14 Correct 7 ms 5836 KB Output is correct
15 Correct 9 ms 6348 KB Output is correct
16 Correct 6 ms 6384 KB Output is correct
17 Correct 74 ms 7540 KB Output is correct
18 Correct 41 ms 7672 KB Output is correct
19 Correct 44 ms 7564 KB Output is correct
20 Correct 80 ms 7668 KB Output is correct
21 Correct 68 ms 7920 KB Output is correct
22 Correct 44 ms 7928 KB Output is correct
23 Correct 40 ms 7568 KB Output is correct
24 Correct 77 ms 7692 KB Output is correct
25 Correct 44 ms 7992 KB Output is correct
26 Correct 42 ms 7528 KB Output is correct
27 Correct 50 ms 7792 KB Output is correct
28 Correct 56 ms 8040 KB Output is correct
29 Correct 7 ms 5832 KB Output is correct
30 Correct 8 ms 6348 KB Output is correct
31 Incorrect 7 ms 5964 KB Output isn't correct
32 Halted 0 ms 0 KB -