oj.uz

Submission #981515

# Submission time Handle Problem Language Result Execution time Memory
981515 2024-05-13T09:35:58 Z faqinyeager Mutating DNA (IOI21_dna) C++17
0 / 100
 29 ms 4632 KB 
#include "dna.h"
#include <bits/stdc++.h>

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

void init(std::string a, std::string b){
	n = (int)a.size();
	for(int i = 0; i < n; i++){
		asum[i][a[i] - 'A'] ++;
		bsum[i][b[i] - 'A'] ++;
	}
	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]; 
		}
	}
}

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;
		} 
	}
	int ans = 0;
	for(int i = x + 1; i <= y; i++){
		int cnt = 0;
		for(int j = 0; j < 3; j++){
			if(asum[i][j] - asum[i - 1][j] != bsum[i][j] - bsum[i - 1][j]) cnt++;
		}
		if(cnt == 2) ans ++;
	}

	return ans;
}

Subtask #1
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 4632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 4632 KB Output isn't correct
2 Halted 0 ms 0 KB -