oj.uz

답안 #437872

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
437872 2021-06-27T08:32:56 Z aggrovector DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 47 ms 6252 KB 
#include "dna.h"
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int s[100005],ac[100005],ca[100005],at[100005],ta[100005],ct[100005],tc[100005],n,i,mac,mat,mct;

void init(std::string a, std::string b) {
	n=a.length();
	for (i=0;i<n;i++) {
		if (i==0) {
			ac[i]=0;
			ca[i]=0;
			at[i]=0;
			ta[i]=0;
			ct[i]=0;
			tc[i]=0;
		}
		else {
			ac[i]=ac[i-1];
			ca[i]=ca[i-1];
			at[i]=at[i-1];
			ta[i]=ta[i-1];
			ct[i]=ct[i-1];
			tc[i]=tc[i-1];
		}
		if (a[i]=='A') {
			if (b[i]=='C') {
				ac[i]++;
			}
			else if (b[i]=='T') {
				at[i]++;
			}
		}
		else if (a[i]=='C') {
			if (b[i]=='A') {
				ca[i]++;
			}
			else if (b[i]=='T') {
				ct[i]++;
			}
		}
		else if (a[i]=='T') {
			if (b[i]=='A') {
				ta[i]++;
			}
			else if (b[i]=='C') {
				tc[i]++;
			}
		}
	}
}

int get_distance(int x, int y) {
	if (ac[y]-ac[x-1]+at[y]-at[x-1]!=ca[y]-ca[x-1]+ta[y]-ta[x-1]) {
		return -1;
	}
	if (ca[y]-ca[x-1]+ct[y]-ct[x-1]!=ac[y]-ac[x-1]+tc[y]-tc[x-1]) {
		return -1;
	}
	if (ta[y]-ta[x-1]+tc[y]-tc[x-1]!=at[y]-at[x-1]+ct[y]-ct[x-1]) {
		return -1;
	}
	mac=min(ac[y]-ac[x-1],ca[y]-ca[x-1]);
	mat=min(at[y]-at[x-1],ta[y]-ta[x-1]);
	mct=min(ct[y]-ct[x-1],tc[y]-tc[x-1]);
	return mac+mat+mct+2*(max(ac[y]-ac[x-1],ca[y]-ca[x-1])-mac);
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 4484 KB Output is correct
2 Correct 46 ms 4484 KB Output is correct
3 Correct 47 ms 4276 KB Output is correct
4 Correct 39 ms 4480 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

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 5 ms 3148 KB Output is correct
5 Correct 6 ms 3132 KB Output is correct
6 Correct 4 ms 3188 KB Output is correct
7 Correct 4 ms 2964 KB Output is correct
8 Correct 5 ms 3180 KB Output is correct
9 Correct 4 ms 3148 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 5 ms 3148 KB Output is correct
5 Correct 6 ms 3132 KB Output is correct
6 Correct 4 ms 3188 KB Output is correct
7 Correct 4 ms 2964 KB Output is correct
8 Correct 5 ms 3180 KB Output is correct
9 Correct 4 ms 3148 KB Output is correct
10 Correct 39 ms 4444 KB Output is correct
11 Correct 41 ms 4476 KB Output is correct
12 Correct 40 ms 4660 KB Output is correct
13 Correct 45 ms 4748 KB Output is correct
14 Correct 40 ms 4856 KB Output is correct
15 Correct 39 ms 4756 KB Output is correct
16 Correct 38 ms 4588 KB Output is correct
17 Correct 38 ms 4720 KB Output is correct
18 Correct 37 ms 4864 KB Output is correct
19 Correct 35 ms 4624 KB Output is correct
20 Correct 35 ms 4824 KB Output is correct
21 Correct 39 ms 4852 KB Output is correct

Subtask #4
28.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 5 ms 3148 KB Output is correct
5 Correct 6 ms 3132 KB Output is correct
6 Correct 4 ms 3188 KB Output is correct
7 Correct 4 ms 2964 KB Output is correct
8 Correct 5 ms 3180 KB Output is correct
9 Correct 4 ms 3148 KB Output is correct
10 Correct 5 ms 2892 KB Output is correct
11 Correct 6 ms 3148 KB Output is correct
12 Correct 5 ms 3020 KB Output is correct
13 Correct 5 ms 3404 KB Output is correct
14 Correct 5 ms 3316 KB Output is correct
15 Correct 4 ms 3404 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 4484 KB Output is correct
2 Correct 46 ms 4484 KB Output is correct
3 Correct 47 ms 4276 KB Output is correct
4 Correct 39 ms 4480 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 5 ms 3148 KB Output is correct
12 Correct 6 ms 3132 KB Output is correct
13 Correct 4 ms 3188 KB Output is correct
14 Correct 4 ms 2964 KB Output is correct
15 Correct 5 ms 3180 KB Output is correct
16 Correct 4 ms 3148 KB Output is correct
17 Correct 39 ms 4444 KB Output is correct
18 Correct 41 ms 4476 KB Output is correct
19 Correct 40 ms 4660 KB Output is correct
20 Correct 45 ms 4748 KB Output is correct
21 Correct 40 ms 4856 KB Output is correct
22 Correct 39 ms 4756 KB Output is correct
23 Correct 38 ms 4588 KB Output is correct
24 Correct 38 ms 4720 KB Output is correct
25 Correct 37 ms 4864 KB Output is correct
26 Correct 35 ms 4624 KB Output is correct
27 Correct 35 ms 4824 KB Output is correct
28 Correct 39 ms 4852 KB Output is correct
29 Correct 5 ms 2892 KB Output is correct
30 Correct 6 ms 3148 KB Output is correct
31 Correct 5 ms 3020 KB Output is correct
32 Correct 5 ms 3404 KB Output is correct
33 Correct 5 ms 3316 KB Output is correct
34 Correct 4 ms 3404 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 41 ms 5516 KB Output is correct
37 Correct 41 ms 5876 KB Output is correct
38 Correct 40 ms 6024 KB Output is correct
39 Correct 41 ms 6148 KB Output is correct
40 Correct 40 ms 6252 KB Output is correct
41 Correct 4 ms 3404 KB Output is correct
42 Correct 41 ms 5984 KB Output is correct
43 Correct 40 ms 6128 KB Output is correct
44 Correct 38 ms 6128 KB Output is correct
45 Correct 35 ms 5900 KB Output is correct
46 Correct 38 ms 6144 KB Output is correct
47 Correct 35 ms 6164 KB Output is correct