답안 #703003

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
703003 2023-02-25T13:23:09 Z n1k DNA 돌연변이 (IOI21_dna) C++17
100 / 100
69 ms 8780 KB
#include <bits/stdc++.h>
 
#define ll long long
#define vt vector
#define pb push_back
#define ar array
#define all(x) (x).begin(), (x).end()
#define sz(x) (x).size()
 
using namespace std;
 
/*
 1. simplify
 2. add new elements
 3. brute force solution
 4. optimize
 5. start implementing
*/
 
// --- templates ---
 
// --- code ---
 
string a, b;

map<char, int> m = {
	{'A', 0},
	{'T', 1},
	{'C', 2}
};

const int N = 100000 + 5;


int pc[N][3], padj[N][3][3];
 
void init(string aa, string bb){
	memset(pc, 0, sizeof pc);
	memset(padj, 0, sizeof padj);

	a = aa;
	b = bb;
	int n = sz(a);

	for(int i = 0; i < n; i++){
		if(i){
			for(int j = 0; j < 3; j++){
				for(int k = 0; k < 3; k++){
					padj[i][j][k] = padj[i - 1][j][k];
				}
				pc[i][j] = pc[i - 1][j];
			}
		}

		if(a[i] != b[i]){
			padj[i][m[a[i]]][m[b[i]]]++;
		}
		pc[i][m[a[i]]]++;
		pc[i][m[b[i]]]--;
	}
}
 
int get_distance(int x, int y){
	vt<vt<int>> adj(3, vt<int>(3));
	vt<int> c(3);

	for(int i = 0; i < 3; i++){
		c[i] = pc[y][i] - (x ? pc[x - 1][i] : 0);
	}

	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 3; j++){
			adj[i][j] = padj[y][i][j] - (x ? padj[x - 1][i][j] : 0);
		}
	}

	if(c[0] || c[1] || c[2]){
		return -1;
	}
 
	int ans = 0;
	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 3; j++){
			if(adj[i][j] && adj[j][i]){
				int take = min(adj[i][j], adj[j][i]);
				ans += take;
				adj[i][j] -= take;
				adj[j][i] -= take;
			}else{
				for(int k = 0; k < 3; k++){
					int take = min({adj[i][j], adj[j][k], adj[k][i]});
					adj[i][j] -= take, adj[j][k] -= take, adj[k][i] -= take;
					ans += 2 * take;
				}
			}
		}
	}
 
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 7064 KB Output is correct
2 Correct 58 ms 7092 KB Output is correct
3 Correct 53 ms 6960 KB Output is correct
4 Correct 56 ms 7080 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 7 ms 5716 KB Output is correct
5 Correct 7 ms 5784 KB Output is correct
6 Correct 6 ms 5716 KB Output is correct
7 Correct 6 ms 5716 KB Output is correct
8 Correct 6 ms 5780 KB Output is correct
9 Correct 5 ms 5788 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 7 ms 5716 KB Output is correct
5 Correct 7 ms 5784 KB Output is correct
6 Correct 6 ms 5716 KB Output is correct
7 Correct 6 ms 5716 KB Output is correct
8 Correct 6 ms 5780 KB Output is correct
9 Correct 5 ms 5788 KB Output is correct
10 Correct 55 ms 7080 KB Output is correct
11 Correct 61 ms 7148 KB Output is correct
12 Correct 55 ms 7420 KB Output is correct
13 Correct 58 ms 8752 KB Output is correct
14 Correct 59 ms 8768 KB Output is correct
15 Correct 52 ms 8764 KB Output is correct
16 Correct 53 ms 8636 KB Output is correct
17 Correct 69 ms 8684 KB Output is correct
18 Correct 56 ms 8764 KB Output is correct
19 Correct 50 ms 8620 KB Output is correct
20 Correct 57 ms 8676 KB Output is correct
21 Correct 52 ms 8772 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 7 ms 5716 KB Output is correct
5 Correct 7 ms 5784 KB Output is correct
6 Correct 6 ms 5716 KB Output is correct
7 Correct 6 ms 5716 KB Output is correct
8 Correct 6 ms 5780 KB Output is correct
9 Correct 5 ms 5788 KB Output is correct
10 Correct 7 ms 5712 KB Output is correct
11 Correct 6 ms 5716 KB Output is correct
12 Correct 6 ms 5728 KB Output is correct
13 Correct 6 ms 5716 KB Output is correct
14 Correct 6 ms 5716 KB Output is correct
15 Correct 5 ms 5716 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 7064 KB Output is correct
2 Correct 58 ms 7092 KB Output is correct
3 Correct 53 ms 6960 KB Output is correct
4 Correct 56 ms 7080 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 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 7 ms 5716 KB Output is correct
12 Correct 7 ms 5784 KB Output is correct
13 Correct 6 ms 5716 KB Output is correct
14 Correct 6 ms 5716 KB Output is correct
15 Correct 6 ms 5780 KB Output is correct
16 Correct 5 ms 5788 KB Output is correct
17 Correct 55 ms 7080 KB Output is correct
18 Correct 61 ms 7148 KB Output is correct
19 Correct 55 ms 7420 KB Output is correct
20 Correct 58 ms 8752 KB Output is correct
21 Correct 59 ms 8768 KB Output is correct
22 Correct 52 ms 8764 KB Output is correct
23 Correct 53 ms 8636 KB Output is correct
24 Correct 69 ms 8684 KB Output is correct
25 Correct 56 ms 8764 KB Output is correct
26 Correct 50 ms 8620 KB Output is correct
27 Correct 57 ms 8676 KB Output is correct
28 Correct 52 ms 8772 KB Output is correct
29 Correct 7 ms 5712 KB Output is correct
30 Correct 6 ms 5716 KB Output is correct
31 Correct 6 ms 5728 KB Output is correct
32 Correct 6 ms 5716 KB Output is correct
33 Correct 6 ms 5716 KB Output is correct
34 Correct 5 ms 5716 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 59 ms 8324 KB Output is correct
37 Correct 57 ms 8388 KB Output is correct
38 Correct 64 ms 8676 KB Output is correct
39 Correct 54 ms 8780 KB Output is correct
40 Correct 52 ms 8756 KB Output is correct
41 Correct 5 ms 5972 KB Output is correct
42 Correct 58 ms 8664 KB Output is correct
43 Correct 58 ms 8748 KB Output is correct
44 Correct 56 ms 8768 KB Output is correct
45 Correct 52 ms 8652 KB Output is correct
46 Correct 56 ms 8704 KB Output is correct
47 Correct 53 ms 8700 KB Output is correct