oj.uz

답안 #622511

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
622511 2022-08-04T10:49:17 Z 61nar DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 39 ms 7416 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<int, int>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
const int MAXN = 100005;

int sum[MAXN][3][3];

void init(std::string a, std::string b) {
	auto sgn = [&](char c){
		switch(c){
			case 'A':{
				return 0;
			}
			case 'C':{
				return 1;
			}
			default:{
				return 2;
			}
		}
	};
	for(int i = 0; i < sz(a); i++){
		sum[i + 1][sgn(a[i])][sgn(b[i])]++;
		for(int j = 0; j < 3; j++){
			for(int k = 0; k < 3; k++){
				sum[i+1][j][k] += sum[i][j][k];
			}
		}
	}
}

int get_distance(int x, int y) {
	int adj[3][3] = {};
	int src[3] = {};
	int snk[3] = {};
	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 3; j++){
			adj[i][j] = sum[y+1][i][j] - sum[x][i][j];
			src[i] += adj[i][j];
			snk[j] += adj[i][j];
		}
	}
	for(int i = 0; i < 3; i++){
		if(src[i] != snk[i]) return -1;
	}
	int ret = 0;
	for(int i = 0; i < 3; i++){
		for(int j = 0; j < i; j++){
			int d = min(adj[i][j], adj[j][i]);
			adj[i][j] -= d;
			adj[j][i] -= d;
			ret += d;
		}
	}
	int d1 = max(adj[0][1], adj[1][0]);
	int d2 = max(adj[0][2], adj[2][0]);
	int d3 = max(adj[1][2], adj[2][1]);
	assert(d1 == d2 && d2 == d3);
	ret += 2 * d1;
	return ret;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 5652 KB Output is correct
2 Correct 34 ms 7032 KB Output is correct
3 Correct 33 ms 6684 KB Output is correct
4 Correct 34 ms 7016 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

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4436 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 4 ms 4536 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4436 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 4 ms 4536 KB Output is correct
10 Correct 35 ms 6936 KB Output is correct
11 Correct 35 ms 6952 KB Output is correct
12 Correct 34 ms 7052 KB Output is correct
13 Correct 32 ms 7160 KB Output is correct
14 Correct 33 ms 7288 KB Output is correct
15 Correct 32 ms 7240 KB Output is correct
16 Correct 35 ms 6936 KB Output is correct
17 Correct 31 ms 7140 KB Output is correct
18 Correct 31 ms 7312 KB Output is correct
19 Correct 29 ms 6980 KB Output is correct
20 Correct 38 ms 7124 KB Output is correct
21 Correct 30 ms 7288 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4436 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 4 ms 4536 KB Output is correct
10 Correct 4 ms 4120 KB Output is correct
11 Correct 4 ms 4564 KB Output is correct
12 Correct 4 ms 4264 KB Output is correct
13 Correct 4 ms 4564 KB Output is correct
14 Correct 4 ms 4564 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 5652 KB Output is correct
2 Correct 34 ms 7032 KB Output is correct
3 Correct 33 ms 6684 KB Output is correct
4 Correct 34 ms 7016 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 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 4436 KB Output is correct
12 Correct 5 ms 4564 KB Output is correct
13 Correct 4 ms 4564 KB Output is correct
14 Correct 4 ms 4308 KB Output is correct
15 Correct 5 ms 4564 KB Output is correct
16 Correct 4 ms 4536 KB Output is correct
17 Correct 35 ms 6936 KB Output is correct
18 Correct 35 ms 6952 KB Output is correct
19 Correct 34 ms 7052 KB Output is correct
20 Correct 32 ms 7160 KB Output is correct
21 Correct 33 ms 7288 KB Output is correct
22 Correct 32 ms 7240 KB Output is correct
23 Correct 35 ms 6936 KB Output is correct
24 Correct 31 ms 7140 KB Output is correct
25 Correct 31 ms 7312 KB Output is correct
26 Correct 29 ms 6980 KB Output is correct
27 Correct 38 ms 7124 KB Output is correct
28 Correct 30 ms 7288 KB Output is correct
29 Correct 4 ms 4120 KB Output is correct
30 Correct 4 ms 4564 KB Output is correct
31 Correct 4 ms 4264 KB Output is correct
32 Correct 4 ms 4564 KB Output is correct
33 Correct 4 ms 4564 KB Output is correct
34 Correct 4 ms 4564 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 39 ms 6624 KB Output is correct
37 Correct 37 ms 6972 KB Output is correct
38 Correct 39 ms 7188 KB Output is correct
39 Correct 33 ms 7344 KB Output is correct
40 Correct 34 ms 7416 KB Output is correct
41 Correct 5 ms 4564 KB Output is correct
42 Correct 32 ms 7004 KB Output is correct
43 Correct 30 ms 7288 KB Output is correct
44 Correct 35 ms 7292 KB Output is correct
45 Correct 31 ms 7076 KB Output is correct
46 Correct 31 ms 7276 KB Output is correct
47 Correct 32 ms 7276 KB Output is correct