oj.uz

답안 #824027

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824027 2023-08-13T11:35:22 Z SoulKnight DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 250 ms 5812 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ln '\n'

const int N = 1e5 + 5;

int same[N];
int n;
vector<int> wa[3], wb[3];
map<string, vector<int>> mp;

int get_range(const vector<int>& vec, int l, int r){
	return upper_bound(vec.begin(), vec.end(), r) - lower_bound(vec.begin(), vec.end(), l);
}

void init(std::string a, std::string b) {
	n = a.size();
	for (int i = 0; i < n; i++) same[i] = (a[i] == b[i]);
	for (int i = 0; i < n; i++) same[i] += same[i-1];

	for (int i = 0; i < n; i++){
		if (a[i] == 'A') wa[0].push_back(i);
		else if (a[i] == 'C') wa[1].push_back(i);
		else wa[2].push_back(i);
	}

	for (int i = 0; i < n; i++){
		if (b[i] == 'A') wb[0].push_back(i);
		else if (b[i] == 'C') wb[1].push_back(i);
		else wb[2].push_back(i);
	}

	for (int i = 0; i < n; i++){
		string s; s.append(1, a[i]); s.append(1, b[i]);
		mp[s].push_back(i);
	}
}

int get_distance(int x, int y) {
	bool ok = true;
	for (int i = 0; i < 3; i++){
		int c1 = get_range(wa[i], x, y);
		int c2 = get_range(wb[i], x, y);

		if (c1 != c2) {ok = false; break;}
	}

	if (!ok) return -1;
	int len = y-x+1, ans = 0, res;

	res = min(get_range(mp["AC"], x, y), get_range(mp["CA"], x, y)); ans += res; len -= 2 * res;
	res = min(get_range(mp["AT"], x, y), get_range(mp["TA"], x, y)); ans += res; len -= 2 * res;
	res = min(get_range(mp["CT"], x, y), get_range(mp["TC"], x, y)); ans += res; len -= 2 * res;

	int s = (same[y] - ((x-1 < 0)? 0: same[x-1]));
	len -= s;
	return ans + len/3*2;



}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 153 ms 4024 KB Output is correct
2 Correct 154 ms 5396 KB Output is correct
3 Correct 234 ms 5164 KB Output is correct
4 Correct 244 ms 5476 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 2912 KB Output is correct
5 Correct 7 ms 2804 KB Output is correct
6 Correct 7 ms 2848 KB Output is correct
7 Correct 7 ms 2768 KB Output is correct
8 Correct 8 ms 2956 KB Output is correct
9 Correct 6 ms 3064 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 2912 KB Output is correct
5 Correct 7 ms 2804 KB Output is correct
6 Correct 7 ms 2848 KB Output is correct
7 Correct 7 ms 2768 KB Output is correct
8 Correct 8 ms 2956 KB Output is correct
9 Correct 6 ms 3064 KB Output is correct
10 Correct 150 ms 5388 KB Output is correct
11 Correct 152 ms 5460 KB Output is correct
12 Correct 148 ms 5480 KB Output is correct
13 Correct 148 ms 5612 KB Output is correct
14 Correct 150 ms 5808 KB Output is correct
15 Correct 140 ms 5648 KB Output is correct
16 Correct 137 ms 5396 KB Output is correct
17 Correct 135 ms 5532 KB Output is correct
18 Correct 139 ms 5720 KB Output is correct
19 Correct 109 ms 5472 KB Output is correct
20 Correct 115 ms 5652 KB Output is correct
21 Correct 114 ms 5552 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 2912 KB Output is correct
5 Correct 7 ms 2804 KB Output is correct
6 Correct 7 ms 2848 KB Output is correct
7 Correct 7 ms 2768 KB Output is correct
8 Correct 8 ms 2956 KB Output is correct
9 Correct 6 ms 3064 KB Output is correct
10 Correct 8 ms 2772 KB Output is correct
11 Correct 9 ms 2932 KB Output is correct
12 Correct 8 ms 2644 KB Output is correct
13 Correct 8 ms 2952 KB Output is correct
14 Correct 9 ms 2996 KB Output is correct
15 Correct 7 ms 3076 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 153 ms 4024 KB Output is correct
2 Correct 154 ms 5396 KB Output is correct
3 Correct 234 ms 5164 KB Output is correct
4 Correct 244 ms 5476 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 7 ms 2912 KB Output is correct
12 Correct 7 ms 2804 KB Output is correct
13 Correct 7 ms 2848 KB Output is correct
14 Correct 7 ms 2768 KB Output is correct
15 Correct 8 ms 2956 KB Output is correct
16 Correct 6 ms 3064 KB Output is correct
17 Correct 150 ms 5388 KB Output is correct
18 Correct 152 ms 5460 KB Output is correct
19 Correct 148 ms 5480 KB Output is correct
20 Correct 148 ms 5612 KB Output is correct
21 Correct 150 ms 5808 KB Output is correct
22 Correct 140 ms 5648 KB Output is correct
23 Correct 137 ms 5396 KB Output is correct
24 Correct 135 ms 5532 KB Output is correct
25 Correct 139 ms 5720 KB Output is correct
26 Correct 109 ms 5472 KB Output is correct
27 Correct 115 ms 5652 KB Output is correct
28 Correct 114 ms 5552 KB Output is correct
29 Correct 8 ms 2772 KB Output is correct
30 Correct 9 ms 2932 KB Output is correct
31 Correct 8 ms 2644 KB Output is correct
32 Correct 8 ms 2952 KB Output is correct
33 Correct 9 ms 2996 KB Output is correct
34 Correct 7 ms 3076 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 236 ms 5160 KB Output is correct
37 Correct 250 ms 5552 KB Output is correct
38 Correct 231 ms 5584 KB Output is correct
39 Correct 224 ms 5804 KB Output is correct
40 Correct 224 ms 5692 KB Output is correct
41 Correct 8 ms 3080 KB Output is correct
42 Correct 206 ms 5536 KB Output is correct
43 Correct 207 ms 5776 KB Output is correct
44 Correct 206 ms 5608 KB Output is correct
45 Correct 137 ms 5580 KB Output is correct
46 Correct 153 ms 5608 KB Output is correct
47 Correct 143 ms 5812 KB Output is correct