답안 #599631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
599631 2022-07-19T17:32:54 Z Fidan DNA 돌연변이 (IOI21_dna) C++17
100 / 100
40 ms 7284 KB
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
typedef long long ll;
const ll N=(1e5)+10;
ll n;
vector<ll> AT(N, 0);
vector<ll> TA(N, 0);
vector<ll> CA(N, 0);
vector<ll> AC(N, 0);
vector<ll> TC(N, 0);
vector<ll> CT(N, 0);
void init(string a, string b) {
	n=a.length();
	a="."+a;
	b="."+b;
	for(ll i=1; i<=n; i++){
		AT[i]=AT[i-1];
		TA[i]=TA[i-1];
		AC[i]=AC[i-1];
		CA[i]=CA[i-1];
		CT[i]=CT[i-1];
		TC[i]=TC[i-1];
		if(a[i]=='T' && b[i]=='A') TA[i]++;
		else if(a[i]=='A' && b[i]=='T') AT[i]++;
		else if(a[i]=='A' && b[i]=='C') AC[i]++;
		else if(a[i]=='C' && b[i]=='A') CA[i]++;
		else if(a[i]=='C' && b[i]=='T') CT[i]++;
		else if(a[i]=='T' && b[i]=='C') TC[i]++;
	}
}
int get_distance(int x, int y) {
	x++, y++;
	ll ac=AC[y]-AC[x-1];
	ll ca=CA[y]-CA[x-1];
	ll at=AT[y]-AT[x-1];
	ll ta=TA[y]-TA[x-1];
	ll tc=TC[y]-TC[x-1];
	ll ct=CT[y]-CT[x-1];
	ll k=0;
	if(ca+ta!=ac+at) return -1;
	if(ct+at!=tc+ta) return -1;
	if(ac+tc!=ca+ct) return -1;
	if(ca<ac){
		swap(ca, ac);
		swap(at, ta);
		swap(tc, ct);
	}
	k+=ac+ta+ct;
	k+=2*(ca-ac);
	return k;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 6892 KB Output is correct
2 Correct 34 ms 6928 KB Output is correct
3 Correct 30 ms 6816 KB Output is correct
4 Correct 40 ms 6888 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 5 ms 5588 KB Output is correct
5 Correct 6 ms 5588 KB Output is correct
6 Correct 5 ms 5652 KB Output is correct
7 Correct 4 ms 5588 KB Output is correct
8 Correct 5 ms 5588 KB Output is correct
9 Correct 4 ms 5588 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 5 ms 5588 KB Output is correct
5 Correct 6 ms 5588 KB Output is correct
6 Correct 5 ms 5652 KB Output is correct
7 Correct 4 ms 5588 KB Output is correct
8 Correct 5 ms 5588 KB Output is correct
9 Correct 4 ms 5588 KB Output is correct
10 Correct 35 ms 6848 KB Output is correct
11 Correct 31 ms 6884 KB Output is correct
12 Correct 30 ms 7160 KB Output is correct
13 Correct 30 ms 7216 KB Output is correct
14 Correct 32 ms 7236 KB Output is correct
15 Correct 28 ms 7080 KB Output is correct
16 Correct 28 ms 7172 KB Output is correct
17 Correct 29 ms 7120 KB Output is correct
18 Correct 29 ms 7252 KB Output is correct
19 Correct 27 ms 7160 KB Output is correct
20 Correct 33 ms 7172 KB Output is correct
21 Correct 37 ms 7260 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 5 ms 5588 KB Output is correct
5 Correct 6 ms 5588 KB Output is correct
6 Correct 5 ms 5652 KB Output is correct
7 Correct 4 ms 5588 KB Output is correct
8 Correct 5 ms 5588 KB Output is correct
9 Correct 4 ms 5588 KB Output is correct
10 Correct 6 ms 5588 KB Output is correct
11 Correct 6 ms 5588 KB Output is correct
12 Correct 5 ms 5588 KB Output is correct
13 Correct 5 ms 5588 KB Output is correct
14 Correct 5 ms 5588 KB Output is correct
15 Correct 4 ms 5588 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 6892 KB Output is correct
2 Correct 34 ms 6928 KB Output is correct
3 Correct 30 ms 6816 KB Output is correct
4 Correct 40 ms 6888 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 5 ms 5588 KB Output is correct
12 Correct 6 ms 5588 KB Output is correct
13 Correct 5 ms 5652 KB Output is correct
14 Correct 4 ms 5588 KB Output is correct
15 Correct 5 ms 5588 KB Output is correct
16 Correct 4 ms 5588 KB Output is correct
17 Correct 35 ms 6848 KB Output is correct
18 Correct 31 ms 6884 KB Output is correct
19 Correct 30 ms 7160 KB Output is correct
20 Correct 30 ms 7216 KB Output is correct
21 Correct 32 ms 7236 KB Output is correct
22 Correct 28 ms 7080 KB Output is correct
23 Correct 28 ms 7172 KB Output is correct
24 Correct 29 ms 7120 KB Output is correct
25 Correct 29 ms 7252 KB Output is correct
26 Correct 27 ms 7160 KB Output is correct
27 Correct 33 ms 7172 KB Output is correct
28 Correct 37 ms 7260 KB Output is correct
29 Correct 6 ms 5588 KB Output is correct
30 Correct 6 ms 5588 KB Output is correct
31 Correct 5 ms 5588 KB Output is correct
32 Correct 5 ms 5588 KB Output is correct
33 Correct 5 ms 5588 KB Output is correct
34 Correct 4 ms 5588 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 29 ms 6796 KB Output is correct
37 Correct 33 ms 6868 KB Output is correct
38 Correct 33 ms 7176 KB Output is correct
39 Correct 40 ms 7160 KB Output is correct
40 Correct 31 ms 7176 KB Output is correct
41 Correct 4 ms 5640 KB Output is correct
42 Correct 28 ms 7232 KB Output is correct
43 Correct 30 ms 7176 KB Output is correct
44 Correct 38 ms 7180 KB Output is correct
45 Correct 27 ms 7176 KB Output is correct
46 Correct 26 ms 7184 KB Output is correct
47 Correct 27 ms 7284 KB Output is correct