oj.uz

답안 #439443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
439443 2021-06-30T02:24:07 Z Maurimuri80 DNA 돌연변이 (IOI21_dna) C++17
56 / 100
 92 ms 26856 KB 
#include "dna.h"
#include <iostream>
#include <vector>
using namespace std;
string A,B;
vector<int> AT;
vector<vector<int>> vA,vB;
vector<vector<int>> acumA,acumB;
vector<int> acum;
void init(std::string a, std::string b) {
	A = a;
	B = b;
	AT.assign(a.size(),0);
	acum.assign(a.size(),0);
	vA.assign(a.size(),vector<int>(3,0));
	vB.assign(a.size(),vector<int>(3,0));
	acumA.assign(a.size(),vector<int>(3,0));
	acumB.assign(a.size(),vector<int>(3,0));
	if (A[0] != B[0]) acum[0] = 1;
	if (A[0] == 'T') acumA[0][0] = 1;
	if (A[0] == 'A') acumA[0][1] = 1;
	if (A[0] == 'C') acumA[0][2] = 1;
	if (B[0] == 'T') acumB[0][0] = 1;
	if (B[0] == 'A') acumB[0][1] = 1;
	if (B[0] == 'C') acumB[0][2] = 1;

	for (int i = 1; i < a.size(); i++)
	{
		if (A[i] == 'T') vA[i][0] = 1;
		if (A[i] == 'A') vA[i][1] = 1;
		if (A[i] == 'C') vA[i][2] = 1;
		if (B[i] == 'T') vB[i][0] = 1;
		if (B[i] == 'A') vB[i][1] = 1;
		if (B[i] == 'C') vB[i][2] = 1;
		if (A[i] != B[i])
		{
			AT[i] = 1;
		}
		acum[i] = acum[i-1]+AT[i];
		acumA[i][0] = acumA[i-1][0]+ vA[i][0];
		acumA[i][1] = acumA[i-1][1]+ vA[i][1];
		acumA[i][2] = acumA[i-1][2]+ vA[i][2];
		acumB[i][0] = acumB[i-1][0]+ vB[i][0];
		acumB[i][1] = acumB[i-1][1]+ vB[i][1];
		acumB[i][2] = acumB[i-1][2]+ vB[i][2];
	}
}

int get_distance(int x, int y) {
	/*int Amo[3] = {0,0,0};
	int Amo2[3] = {0,0,0};
	for (int i = x; i <= y; i++)
	{
		if (A[i] == 'T') Amo[0]++;
		if (A[i] == 'A') Amo[1]++;
		if (A[i] == 'C') Amo[2]++;
		if (B[i] == 'T') Amo2[0]++;
		if (B[i] == 'A') Amo2[1]++;
		if (B[i] == 'C') Amo2[2]++;
	}*/
	int ta,tb,ca,cb,aa,ab;
	if (x == 0)
	{
		ta = acumA[y][0];
		tb = acumB[y][0];
		aa = acumA[y][1];
		ab = acumB[y][1];
		ca = acumA[y][2];
		cb = acumB[y][2];
	}else
	{
		ta = acumA[y][0] - acumA[x-1][0];
		tb = acumB[y][0] - acumB[x-1][0];
		aa = acumA[y][1] - acumA[x-1][1];
		ab = acumB[y][1] - acumB[x-1][1];
		ca = acumA[y][2] - acumA[x-1][2];
		cb = acumB[y][2] - acumB[x-1][2];
	}
	//cout<<ta<<" "<<aa<<" "<<ca<<endl;
	//cout<<tb<<" "<<ab<<" "<<cb<<endl;
	
	if ((y-x) <= 2)
	{
		if (ta == tb && aa == ab && ca == cb)
		{
			if ((y-x) == 0){
				return 0;
			}
			if ((y-x) == 1)
			{
				if (A[x] == B[x]) return 0;
				return 1;
			}
			if (A[x] == B[x] && A[x+1] == B[x+1])
			{
				return 0;
			}
			if (A[x] == B[x] || A[x+1] == B[x+1] || A[y] == B[y])
			{
				return 1;
			}
			return 2;
		}else
		{
			return -1;
		}
	}
	if (ca == cb && ca == 0 && ta == tb && aa == ab)
	{
		int dif;
		if (x == 0)
		{
			dif = (acum[y]);
		}else
		{
			dif = (acum[y]-acum[x-1]);
		}	
		return dif/2;
	}else
	{
		return -1;
	}
	
	return 0;
}

Compilation message

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

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 26088 KB Output is correct
2 Correct 79 ms 26436 KB Output is correct
3 Correct 73 ms 24324 KB Output is correct
4 Correct 79 ms 26436 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 38 ms 23672 KB Output is correct
5 Correct 36 ms 23888 KB Output is correct
6 Correct 36 ms 23684 KB Output is correct
7 Correct 35 ms 22284 KB Output is correct
8 Correct 40 ms 23840 KB Output is correct
9 Correct 35 ms 23896 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 38 ms 23672 KB Output is correct
5 Correct 36 ms 23888 KB Output is correct
6 Correct 36 ms 23684 KB Output is correct
7 Correct 35 ms 22284 KB Output is correct
8 Correct 40 ms 23840 KB Output is correct
9 Correct 35 ms 23896 KB Output is correct
10 Correct 86 ms 26184 KB Output is correct
11 Correct 82 ms 26520 KB Output is correct
12 Correct 85 ms 25140 KB Output is correct
13 Correct 87 ms 25704 KB Output is correct
14 Correct 92 ms 26856 KB Output is correct
15 Correct 87 ms 26796 KB Output is correct
16 Correct 77 ms 24972 KB Output is correct
17 Correct 80 ms 25668 KB Output is correct
18 Correct 83 ms 26724 KB Output is correct
19 Correct 65 ms 25008 KB Output is correct
20 Correct 68 ms 25668 KB Output is correct
21 Correct 69 ms 26716 KB Output is correct

Subtask #4
0.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 38 ms 23672 KB Output is correct
5 Correct 36 ms 23888 KB Output is correct
6 Correct 36 ms 23684 KB Output is correct
7 Correct 35 ms 22284 KB Output is correct
8 Correct 40 ms 23840 KB Output is correct
9 Correct 35 ms 23896 KB Output is correct
10 Correct 32 ms 21880 KB Output is correct
11 Correct 35 ms 23968 KB Output is correct
12 Incorrect 35 ms 22316 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 26088 KB Output is correct
2 Correct 79 ms 26436 KB Output is correct
3 Correct 73 ms 24324 KB Output is correct
4 Correct 79 ms 26436 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 38 ms 23672 KB Output is correct
12 Correct 36 ms 23888 KB Output is correct
13 Correct 36 ms 23684 KB Output is correct
14 Correct 35 ms 22284 KB Output is correct
15 Correct 40 ms 23840 KB Output is correct
16 Correct 35 ms 23896 KB Output is correct
17 Correct 86 ms 26184 KB Output is correct
18 Correct 82 ms 26520 KB Output is correct
19 Correct 85 ms 25140 KB Output is correct
20 Correct 87 ms 25704 KB Output is correct
21 Correct 92 ms 26856 KB Output is correct
22 Correct 87 ms 26796 KB Output is correct
23 Correct 77 ms 24972 KB Output is correct
24 Correct 80 ms 25668 KB Output is correct
25 Correct 83 ms 26724 KB Output is correct
26 Correct 65 ms 25008 KB Output is correct
27 Correct 68 ms 25668 KB Output is correct
28 Correct 69 ms 26716 KB Output is correct
29 Correct 32 ms 21880 KB Output is correct
30 Correct 35 ms 23968 KB Output is correct
31 Incorrect 35 ms 22316 KB Output isn't correct
32 Halted 0 ms 0 KB -