답안 #915981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915981 2024-01-25T05:23:14 Z ByeWorld DNA 돌연변이 (IOI21_dna) C++17
100 / 100
40 ms 6620 KB
#include "dna.h"
#include <bits/stdc++.h>
#define bupol __builtin_popcount
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 3e5+10;
const int MAXK = 205;
const int LOG = 20;
const int MOD = 1e9+9;
const int SQRT = 520;
const int INF = 1e9+10;
typedef pair<ll,ll> pii;
typedef pair<int, pii> ipii;

string s, t; int n;
int AT[MAXN], TA[MAXN], AC[MAXN], CA[MAXN], TC[MAXN], CT[MAXN];

void init(string a, string b) {
	s = '.'+a; t = '.'+b; n = a.size(); 
	for(int i=1; i<=n; i++){
		AT[i]=AT[i-1];
		TA[i]=TA[i-1];
		CT[i]=CT[i-1];
		TC[i]=TC[i-1];
		AC[i]=AC[i-1];
		CA[i]=CA[i-1];

		if(s[i]=='A'){
			if(t[i]=='C') AC[i]++;
			else if(t[i]=='T') AT[i]++;
		} else if(s[i]=='C'){
			if(t[i]=='A') CA[i]++;
			else if(t[i]=='T') CT[i]++;
		} else {
			if(t[i]=='A') TA[i]++;
			else if(t[i]=='C') TC[i]++;
		}
	}
}
int at,ta,tc,ct,ac,ca;
int get_distance(int x, int y) {
	x++; y++;
	at=AT[y]-AT[x-1],ta=TA[y]-TA[x-1],tc=TC[y]-TC[x-1],ct=CT[y]-CT[x-1],
	ac=AC[y]-AC[x-1],ca=CA[y]-CA[x-1];

	//cout << CA[y] << ' ' << CA[x-1] << ' ' << " p\n";

	//cout<<ca<<' '<<ac<<' '<<at<<' '<<ta<<' '<< ct<<' '<< tc << " p\n";
	int ans = 0;
	int te = min(ac,ca); ans += te;
	ac -= te; ca -= te;
	te = min(at, ta); ans += te;
	at -= te; ta -= te;
	te = min(ct, tc); ans += te;
	ct -= te; tc -= te;

	te = min(min(ca, at), tc); ans += 2*te;
	ca -= te; at -= te; tc -= te;
	te = min(min(ac, ct), ta); ans += 2*te;
	ac -= te; ct -= te; ta -= te;
	
	if(ac!=0||ca!=0||at!=0||ta!=0||ct!=0||tc!=0) return -1;
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 5952 KB Output is correct
2 Correct 25 ms 5896 KB Output is correct
3 Correct 25 ms 5460 KB Output is correct
4 Correct 33 ms 5964 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 4 ms 3676 KB Output is correct
5 Correct 4 ms 3564 KB Output is correct
6 Correct 3 ms 3676 KB Output is correct
7 Correct 3 ms 3416 KB Output is correct
8 Correct 3 ms 3596 KB Output is correct
9 Correct 3 ms 3780 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 4 ms 3676 KB Output is correct
5 Correct 4 ms 3564 KB Output is correct
6 Correct 3 ms 3676 KB Output is correct
7 Correct 3 ms 3416 KB Output is correct
8 Correct 3 ms 3596 KB Output is correct
9 Correct 3 ms 3780 KB Output is correct
10 Correct 25 ms 5716 KB Output is correct
11 Correct 25 ms 5976 KB Output is correct
12 Correct 26 ms 5968 KB Output is correct
13 Correct 26 ms 6484 KB Output is correct
14 Correct 26 ms 6620 KB Output is correct
15 Correct 25 ms 6492 KB Output is correct
16 Correct 26 ms 6428 KB Output is correct
17 Correct 25 ms 6224 KB Output is correct
18 Correct 25 ms 6484 KB Output is correct
19 Correct 24 ms 6228 KB Output is correct
20 Correct 24 ms 6228 KB Output is correct
21 Correct 24 ms 6488 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 4 ms 3676 KB Output is correct
5 Correct 4 ms 3564 KB Output is correct
6 Correct 3 ms 3676 KB Output is correct
7 Correct 3 ms 3416 KB Output is correct
8 Correct 3 ms 3596 KB Output is correct
9 Correct 3 ms 3780 KB Output is correct
10 Correct 4 ms 3420 KB Output is correct
11 Correct 4 ms 3784 KB Output is correct
12 Correct 4 ms 3528 KB Output is correct
13 Correct 3 ms 3676 KB Output is correct
14 Correct 4 ms 3676 KB Output is correct
15 Correct 3 ms 3676 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 5952 KB Output is correct
2 Correct 25 ms 5896 KB Output is correct
3 Correct 25 ms 5460 KB Output is correct
4 Correct 33 ms 5964 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 4 ms 3676 KB Output is correct
12 Correct 4 ms 3564 KB Output is correct
13 Correct 3 ms 3676 KB Output is correct
14 Correct 3 ms 3416 KB Output is correct
15 Correct 3 ms 3596 KB Output is correct
16 Correct 3 ms 3780 KB Output is correct
17 Correct 25 ms 5716 KB Output is correct
18 Correct 25 ms 5976 KB Output is correct
19 Correct 26 ms 5968 KB Output is correct
20 Correct 26 ms 6484 KB Output is correct
21 Correct 26 ms 6620 KB Output is correct
22 Correct 25 ms 6492 KB Output is correct
23 Correct 26 ms 6428 KB Output is correct
24 Correct 25 ms 6224 KB Output is correct
25 Correct 25 ms 6484 KB Output is correct
26 Correct 24 ms 6228 KB Output is correct
27 Correct 24 ms 6228 KB Output is correct
28 Correct 24 ms 6488 KB Output is correct
29 Correct 4 ms 3420 KB Output is correct
30 Correct 4 ms 3784 KB Output is correct
31 Correct 4 ms 3528 KB Output is correct
32 Correct 3 ms 3676 KB Output is correct
33 Correct 4 ms 3676 KB Output is correct
34 Correct 3 ms 3676 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 27 ms 5808 KB Output is correct
37 Correct 27 ms 6288 KB Output is correct
38 Correct 26 ms 6484 KB Output is correct
39 Correct 26 ms 6484 KB Output is correct
40 Correct 28 ms 6492 KB Output is correct
41 Correct 4 ms 3676 KB Output is correct
42 Correct 40 ms 6228 KB Output is correct
43 Correct 26 ms 6484 KB Output is correct
44 Correct 26 ms 6608 KB Output is correct
45 Correct 38 ms 6232 KB Output is correct
46 Correct 24 ms 6488 KB Output is correct
47 Correct 28 ms 6484 KB Output is correct