Submission #437308

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
437308	2021-06-26T07:05:29 Z	DunderMifflin	Mutating DNA (IOI21_dna)	C++17	35 / 100	70 ms	8476 KB

dna

#include "dna.h"
#include<map>
using namespace std;

const int N = 123456;

int pref[3][3][N];
int asum[3][N];
int bsum[3][N];
map<char, int> f;

void init(std::string a, std::string b) {
	f['A'] = 0; f['C'] = 1; f['T'] = 2;
	int n = (int) a.size(); 
	a = " " + a;
	b = " " + b;
	for (int i = 1; i <= n; i++) {
		for (int k = 0; k < 3; k++) {
			for (int l = 0; l < 3; l++) {
				pref[k][l][i] = pref[k][l][i - 1] + (f[a[i]] == k && f[b[i]] == l);
			}
			asum[k][i] = asum[k][i - 1] + (f[a[i]] == k);
			bsum[k][i] = bsum[k][i - 1] + (f[b[i]] == k);
		}
	}
}

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

Subtask #1

0.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	52 ms	7968 KB	Output is correct
2	Correct	50 ms	8084 KB	Output is correct
3	Incorrect	70 ms	7536 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	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	15 ms	6696 KB	Output is correct
5	Correct	17 ms	6860 KB	Output is correct
6	Correct	15 ms	6772 KB	Output is correct
7	Correct	14 ms	6412 KB	Output is correct
8	Correct	20 ms	6904 KB	Output is correct
9	Correct	14 ms	6860 KB	Output is correct

Subtask #3

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	15 ms	6696 KB	Output is correct
5	Correct	17 ms	6860 KB	Output is correct
6	Correct	15 ms	6772 KB	Output is correct
7	Correct	14 ms	6412 KB	Output is correct
8	Correct	20 ms	6904 KB	Output is correct
9	Correct	14 ms	6860 KB	Output is correct
10	Correct	55 ms	8032 KB	Output is correct
11	Correct	57 ms	8084 KB	Output is correct
12	Correct	51 ms	7876 KB	Output is correct
13	Correct	51 ms	8108 KB	Output is correct
14	Correct	69 ms	8356 KB	Output is correct
15	Correct	51 ms	8352 KB	Output is correct
16	Correct	51 ms	7892 KB	Output is correct
17	Correct	48 ms	8080 KB	Output is correct
18	Correct	50 ms	8352 KB	Output is correct
19	Correct	56 ms	7944 KB	Output is correct
20	Correct	48 ms	8208 KB	Output is correct
21	Correct	47 ms	8476 KB	Output is correct

Subtask #4

0.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	15 ms	6696 KB	Output is correct
5	Correct	17 ms	6860 KB	Output is correct
6	Correct	15 ms	6772 KB	Output is correct
7	Correct	14 ms	6412 KB	Output is correct
8	Correct	20 ms	6904 KB	Output is correct
9	Correct	14 ms	6860 KB	Output is correct
10	Incorrect	15 ms	6220 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	52 ms	7968 KB	Output is correct
2	Correct	50 ms	8084 KB	Output is correct
3	Incorrect	70 ms	7536 KB	Output isn't correct
4	Halted	0 ms	0 KB	-