답안 #437500

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
437500	2021-06-26T11:42:48 Z	grt	DNA 돌연변이 (IOI21_dna)	C++17	35 / 100	54 ms	7680 KB

dna

#include <bits/stdc++.h>
#define PB push_back
#define ST first
#define ND second
#define _ ios_base::sync_with_stdio(0); cin.tie(0);
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

using namespace std;

using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;

const int nax = 100 * 1000 + 10;
int cnt[nax][10];
int cur[10];
map<char,int>odp;

void init(string a, string b) {
	odp['A'] = 0;
	odp['T'] = 1;
	odp['C'] = 2;
	for(int i = 1; i <= (int)a.size(); ++i) {
		for(int j = 0; j < 9; ++j) {
			cnt[i][j] = cnt[i - 1][j];
		}
		int x = odp[a[i - 1]] * 3 + odp[b[i - 1]];
		cnt[i][x]++;
	}	
}

int get_distance(int x, int y) {
	y++;
	for(int i = 0; i < 9; ++i) {
		cur[i] = cnt[y][i] - cnt[x][i];
	}
	if(cur[0] + cur[3] + cur[6] != cur[0] + cur[1] + cur[2]) return -1;
	if(cur[1] + cur[4] + cur[7] != cur[3] + cur[4] + cur[5]) return -1;
	if(cur[2] + cur[5] + cur[8] != cur[6] + cur[7] + cur[8]) return -1;
	int ans = 0;
	ans = max(cur[1], cur[3]) + max(cur[2], cur[6]) + max(cur[5], cur[7]);
	return ans;
}

Subtask #1

0.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	54 ms	7300 KB	Output is correct
2	Correct	52 ms	7408 KB	Output is correct
3	Incorrect	52 ms	7008 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #2

22.0 / 22.0

#	결과	실행 시간	메모리	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	4832 KB	Output is correct
5	Correct	7 ms	4940 KB	Output is correct
6	Correct	8 ms	4904 KB	Output is correct
7	Correct	9 ms	4556 KB	Output is correct
8	Correct	7 ms	4988 KB	Output is correct
9	Correct	6 ms	4940 KB	Output is correct

Subtask #3

13.0 / 13.0

#	결과	실행 시간	메모리	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	4832 KB	Output is correct
5	Correct	7 ms	4940 KB	Output is correct
6	Correct	8 ms	4904 KB	Output is correct
7	Correct	9 ms	4556 KB	Output is correct
8	Correct	7 ms	4988 KB	Output is correct
9	Correct	6 ms	4940 KB	Output is correct
10	Correct	43 ms	7280 KB	Output is correct
11	Correct	43 ms	7384 KB	Output is correct
12	Correct	48 ms	7384 KB	Output is correct
13	Correct	52 ms	7508 KB	Output is correct
14	Correct	45 ms	7660 KB	Output is correct
15	Correct	43 ms	7680 KB	Output is correct
16	Correct	41 ms	7256 KB	Output is correct
17	Correct	42 ms	7452 KB	Output is correct
18	Correct	54 ms	7680 KB	Output is correct
19	Correct	43 ms	7312 KB	Output is correct
20	Correct	41 ms	7448 KB	Output is correct
21	Correct	39 ms	7656 KB	Output is correct

Subtask #4

0.0 / 28.0

#	결과	실행 시간	메모리	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	4832 KB	Output is correct
5	Correct	7 ms	4940 KB	Output is correct
6	Correct	8 ms	4904 KB	Output is correct
7	Correct	9 ms	4556 KB	Output is correct
8	Correct	7 ms	4988 KB	Output is correct
9	Correct	6 ms	4940 KB	Output is correct
10	Incorrect	7 ms	4476 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	54 ms	7300 KB	Output is correct
2	Correct	52 ms	7408 KB	Output is correct
3	Incorrect	52 ms	7008 KB	Output isn't correct
4	Halted	0 ms	0 KB	-