oj.uz

답안 #443408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443408 2021-07-10T13:00:59 Z Aryan_Raina DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 54 ms 9404 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
 
#define ar array
#define all(a) a.begin(), a.end()

int id(char x) {
	if (x == 'A') return 0;
	else if (x == 'C') return 1;
	else if (x == 'T') return 2;
	return -1;
}
 
const int MXN = 100009;
int cnt[MXN][3][3], tota[MXN][3], totb[MXN][3];
 
void init(string a, string b) {
	for (int i = 0; i < a.size(); i++) {
		for (int j = 0; j < 3; j++)
			for (int k = 0; k < 3; k++)
				cnt[i+1][j][k] = cnt[i][j][k];

		cnt[i+1][id(a[i])][id(b[i])]++;

		for (int j = 0; j < 3; j++) {
			tota[i+1][j] = tota[i][j];
			totb[i+1][j] = totb[i][j];
		}

		tota[i+1][id(a[i])]++;
		totb[i+1][id(b[i])]++;
	}
}

int get_distance(int x, int y) {
	++x, ++y;
	for (int i = 0; i < 3; i++)
		if (tota[y][i]-tota[x-1][i] != totb[y][i]-totb[x-1][i])
			return -1;

	int A[3][3];
	for (int i = 0; i < 3; i++)
		for (int j = 0; j < 3; j++)
			A[i][j] = cnt[y][i][j]-cnt[x-1][i][j];

	int ans = 0;
	ans += min(A[0][1],A[1][0]);
	ans += min(A[1][2],A[2][1]);
	ans += min(A[2][0],A[0][2]);
	ans += 2 * (max(A[0][1],A[1][0])-min(A[0][1],A[1][0]));

	return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:19:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for (int i = 0; i < a.size(); i++) {
      |                  ~~^~~~~~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 8836 KB Output is correct
2 Correct 45 ms 8888 KB Output is correct
3 Correct 48 ms 8388 KB Output is correct
4 Correct 46 ms 9020 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 7 ms 6860 KB Output is correct
5 Correct 8 ms 6860 KB Output is correct
6 Correct 9 ms 6860 KB Output is correct
7 Correct 6 ms 6476 KB Output is correct
8 Correct 7 ms 6944 KB Output is correct
9 Correct 6 ms 6860 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 7 ms 6860 KB Output is correct
5 Correct 8 ms 6860 KB Output is correct
6 Correct 9 ms 6860 KB Output is correct
7 Correct 6 ms 6476 KB Output is correct
8 Correct 7 ms 6944 KB Output is correct
9 Correct 6 ms 6860 KB Output is correct
10 Correct 44 ms 8884 KB Output is correct
11 Correct 44 ms 8996 KB Output is correct
12 Correct 47 ms 8816 KB Output is correct
13 Correct 47 ms 9112 KB Output is correct
14 Correct 46 ms 9272 KB Output is correct
15 Correct 47 ms 9216 KB Output is correct
16 Correct 42 ms 8824 KB Output is correct
17 Correct 53 ms 8968 KB Output is correct
18 Correct 47 ms 9396 KB Output is correct
19 Correct 39 ms 8888 KB Output is correct
20 Correct 40 ms 9100 KB Output is correct
21 Correct 39 ms 9400 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 7 ms 6860 KB Output is correct
5 Correct 8 ms 6860 KB Output is correct
6 Correct 9 ms 6860 KB Output is correct
7 Correct 6 ms 6476 KB Output is correct
8 Correct 7 ms 6944 KB Output is correct
9 Correct 6 ms 6860 KB Output is correct
10 Correct 6 ms 6348 KB Output is correct
11 Correct 8 ms 6868 KB Output is correct
12 Correct 8 ms 6476 KB Output is correct
13 Correct 7 ms 6888 KB Output is correct
14 Correct 8 ms 6860 KB Output is correct
15 Correct 6 ms 6860 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 8836 KB Output is correct
2 Correct 45 ms 8888 KB Output is correct
3 Correct 48 ms 8388 KB Output is correct
4 Correct 46 ms 9020 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 7 ms 6860 KB Output is correct
12 Correct 8 ms 6860 KB Output is correct
13 Correct 9 ms 6860 KB Output is correct
14 Correct 6 ms 6476 KB Output is correct
15 Correct 7 ms 6944 KB Output is correct
16 Correct 6 ms 6860 KB Output is correct
17 Correct 44 ms 8884 KB Output is correct
18 Correct 44 ms 8996 KB Output is correct
19 Correct 47 ms 8816 KB Output is correct
20 Correct 47 ms 9112 KB Output is correct
21 Correct 46 ms 9272 KB Output is correct
22 Correct 47 ms 9216 KB Output is correct
23 Correct 42 ms 8824 KB Output is correct
24 Correct 53 ms 8968 KB Output is correct
25 Correct 47 ms 9396 KB Output is correct
26 Correct 39 ms 8888 KB Output is correct
27 Correct 40 ms 9100 KB Output is correct
28 Correct 39 ms 9400 KB Output is correct
29 Correct 6 ms 6348 KB Output is correct
30 Correct 8 ms 6868 KB Output is correct
31 Correct 8 ms 6476 KB Output is correct
32 Correct 7 ms 6888 KB Output is correct
33 Correct 8 ms 6860 KB Output is correct
34 Correct 6 ms 6860 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 45 ms 8448 KB Output is correct
37 Correct 44 ms 8960 KB Output is correct
38 Correct 51 ms 8948 KB Output is correct
39 Correct 46 ms 9356 KB Output is correct
40 Correct 54 ms 9312 KB Output is correct
41 Correct 6 ms 6860 KB Output is correct
42 Correct 43 ms 8920 KB Output is correct
43 Correct 41 ms 9372 KB Output is correct
44 Correct 44 ms 9292 KB Output is correct
45 Correct 40 ms 8992 KB Output is correct
46 Correct 51 ms 9320 KB Output is correct
47 Correct 39 ms 9404 KB Output is correct