oj.uz

Submission #981528

# Submission time Handle Problem Language Result Execution time Memory
981528 2024-05-13T09:55:45 Z faqinyeager Mutating DNA (IOI21_dna) C++17
35 / 100
 27 ms 6440 KB 
#include "dna.h"
#include <bits/stdc++.h>

int n, a_cnt, b_cnt;
int asum[100050][3], bsum[100050][3];
int cnt[100050];

void init(std::string a, std::string b){
	n = (int)a.size();
	for(int i = 0; i < n; i++){
		if(a[i] == 'A') asum[i][0] ++;
		else if(a[i] == 'C') asum[i][1] ++;
		else asum[i][2]++;

		if(b[i] == 'A') bsum[i][0] ++;
		else if(b[i] == 'C') bsum[i][1] ++;
		else bsum[i][2]++;
	}
	for(int i = 1; i < n; i++){
		for(int j = 0; j < 3; j++){
			asum[i][j] += asum[i - 1][j];
			bsum[i][j] += bsum[i - 1][j]; 
		}
	}
	for(int i = 0; i < n; i++){
		if(a[i] != b[i]) cnt[i] = 1;
	}
	for(int i = 1; i < n; i++) cnt[i] += cnt[i - 1];
}

int get_distance(int x, int y){
	for(int j = 0; j < 3; j++){
		if(asum[y][j] - asum[x - 1][j] != bsum[y][j] - bsum[x - 1][j]){
			return -1;
		} 
	}

	return (cnt[y] - cnt[x - 1]) / 2;
}

Subtask #1
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4880 KB Output is correct
2 Correct 23 ms 4884 KB Output is correct
3 Incorrect 23 ms 4796 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 3 ms 3672 KB Output is correct
5 Correct 3 ms 3676 KB Output is correct
6 Correct 4 ms 3928 KB Output is correct
7 Correct 3 ms 3420 KB Output is correct
8 Correct 3 ms 3676 KB Output is correct
9 Correct 3 ms 3676 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 3 ms 3672 KB Output is correct
5 Correct 3 ms 3676 KB Output is correct
6 Correct 4 ms 3928 KB Output is correct
7 Correct 3 ms 3420 KB Output is correct
8 Correct 3 ms 3676 KB Output is correct
9 Correct 3 ms 3676 KB Output is correct
10 Correct 25 ms 4892 KB Output is correct
11 Correct 23 ms 4888 KB Output is correct
12 Correct 24 ms 5412 KB Output is correct
13 Correct 27 ms 5920 KB Output is correct
14 Correct 27 ms 6280 KB Output is correct
15 Correct 23 ms 5392 KB Output is correct
16 Correct 26 ms 6204 KB Output is correct
17 Correct 24 ms 5660 KB Output is correct
18 Correct 25 ms 6164 KB Output is correct
19 Correct 22 ms 6440 KB Output is correct
20 Correct 24 ms 6036 KB Output is correct
21 Correct 23 ms 6160 KB Output is correct

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 3 ms 3672 KB Output is correct
5 Correct 3 ms 3676 KB Output is correct
6 Correct 4 ms 3928 KB Output is correct
7 Correct 3 ms 3420 KB Output is correct
8 Correct 3 ms 3676 KB Output is correct
9 Correct 3 ms 3676 KB Output is correct
10 Incorrect 3 ms 3416 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4880 KB Output is correct
2 Correct 23 ms 4884 KB Output is correct
3 Incorrect 23 ms 4796 KB Output isn't correct
4 Halted 0 ms 0 KB -