답안 #777789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
777789 2023-07-09T16:05:02 Z RonTheprogrammer DNA 돌연변이 (IOI21_dna) C++17
100 / 100
32 ms 8596 KB
#include "dna.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
int n;
int cnt[100002][3];
int sum[100002][3][3];
 
void init(std::string a, std::string b){
    n = (int)a.size();
    for(int i=1; i<=n; i++){
        for(int j=0; j<3; j++) for(int k=0; k<3; k++) sum[i][j][k] = sum[i-1][j][k];
        for(int j=0; j<3; j++) cnt[i][j] = cnt[i-1][j];
        sum[i][a[i-1]=='A'?0:a[i-1]=='T'?1:2][b[i-1]=='A'?0:b[i-1]=='T'?1:2]++;
        cnt[i][a[i-1]=='A'?0:a[i-1]=='T'?1:2]++;
        cnt[i][b[i-1]=='A'?0:b[i-1]=='T'?1:2]--;
    }
}
 
int get_distance(int x, int y) {
    x++, y++;
	int ans = 0;
	int c[3][3]={{0}};
	for(int i=0; i<3; i++) for(int j=0; j<3; j++) c[i][j] = sum[y][i][j] - sum[x-1][i][j];
 
	if(cnt[y][0] != cnt[x-1][0]) return -1;
	if(cnt[y][1] != cnt[x-1][1]) return -1;
	if(cnt[y][2] != cnt[x-1][2]) return -1;
 
	int tmp;
	tmp = min(c[0][1], c[1][0]);
	c[0][1] -= tmp, c[1][0] -= tmp, ans += tmp;
	tmp = min(c[0][2], c[2][0]);
	c[0][2] -= tmp, c[2][0] -= tmp, ans += tmp;
	tmp = min(c[2][1], c[1][2]);
	c[2][1] -= tmp, c[1][2] -= tmp, ans += tmp;
 
	ans += 2 * (c[0][1] + c[1][0]);
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 7176 KB Output is correct
2 Correct 26 ms 7196 KB Output is correct
3 Correct 27 ms 6724 KB Output is correct
4 Correct 27 ms 7264 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 5716 KB Output is correct
5 Correct 4 ms 5716 KB Output is correct
6 Correct 4 ms 5716 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 4 ms 5700 KB Output is correct
9 Correct 3 ms 5696 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 5716 KB Output is correct
5 Correct 4 ms 5716 KB Output is correct
6 Correct 4 ms 5716 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 4 ms 5700 KB Output is correct
9 Correct 3 ms 5696 KB Output is correct
10 Correct 27 ms 7116 KB Output is correct
11 Correct 28 ms 7164 KB Output is correct
12 Correct 28 ms 7208 KB Output is correct
13 Correct 28 ms 7480 KB Output is correct
14 Correct 29 ms 7552 KB Output is correct
15 Correct 28 ms 7532 KB Output is correct
16 Correct 27 ms 7264 KB Output is correct
17 Correct 29 ms 7476 KB Output is correct
18 Correct 28 ms 7604 KB Output is correct
19 Correct 26 ms 7280 KB Output is correct
20 Correct 26 ms 7432 KB Output is correct
21 Correct 27 ms 7660 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 5716 KB Output is correct
5 Correct 4 ms 5716 KB Output is correct
6 Correct 4 ms 5716 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 4 ms 5700 KB Output is correct
9 Correct 3 ms 5696 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 4 ms 5688 KB Output is correct
12 Correct 5 ms 5412 KB Output is correct
13 Correct 4 ms 5716 KB Output is correct
14 Correct 4 ms 5692 KB Output is correct
15 Correct 4 ms 5716 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 7176 KB Output is correct
2 Correct 26 ms 7196 KB Output is correct
3 Correct 27 ms 6724 KB Output is correct
4 Correct 27 ms 7264 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 4 ms 5716 KB Output is correct
12 Correct 4 ms 5716 KB Output is correct
13 Correct 4 ms 5716 KB Output is correct
14 Correct 4 ms 5332 KB Output is correct
15 Correct 4 ms 5700 KB Output is correct
16 Correct 3 ms 5696 KB Output is correct
17 Correct 27 ms 7116 KB Output is correct
18 Correct 28 ms 7164 KB Output is correct
19 Correct 28 ms 7208 KB Output is correct
20 Correct 28 ms 7480 KB Output is correct
21 Correct 29 ms 7552 KB Output is correct
22 Correct 28 ms 7532 KB Output is correct
23 Correct 27 ms 7264 KB Output is correct
24 Correct 29 ms 7476 KB Output is correct
25 Correct 28 ms 7604 KB Output is correct
26 Correct 26 ms 7280 KB Output is correct
27 Correct 26 ms 7432 KB Output is correct
28 Correct 27 ms 7660 KB Output is correct
29 Correct 4 ms 5204 KB Output is correct
30 Correct 4 ms 5688 KB Output is correct
31 Correct 5 ms 5412 KB Output is correct
32 Correct 4 ms 5716 KB Output is correct
33 Correct 4 ms 5692 KB Output is correct
34 Correct 4 ms 5716 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 26 ms 7700 KB Output is correct
37 Correct 27 ms 8176 KB Output is correct
38 Correct 28 ms 8212 KB Output is correct
39 Correct 32 ms 8596 KB Output is correct
40 Correct 28 ms 8560 KB Output is correct
41 Correct 3 ms 5728 KB Output is correct
42 Correct 27 ms 8224 KB Output is correct
43 Correct 29 ms 8456 KB Output is correct
44 Correct 28 ms 8440 KB Output is correct
45 Correct 27 ms 8204 KB Output is correct
46 Correct 30 ms 8556 KB Output is correct
47 Correct 27 ms 8436 KB Output is correct