oj.uz

답안 #548636

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
548636 2022-04-14T04:44:06 Z Nicholas2k4 DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 47 ms 9716 KB 
#include "dna.h"
#include<bits/stdc++.h>
using namespace std;
int pref[100005][15];

void init(std::string a, std::string b) 
{
	memset(pref,0,sizeof pref);
	for(int i=1;i<=a.length();i++)
	{
		pref[i][0]=(a[i-1]=='A') + pref[i-1][0];
		pref[i][1]=(b[i-1]=='A') + pref[i-1][1];
		pref[i][2]=(a[i-1]=='T') + pref[i-1][2];
		pref[i][3]=(b[i-1]=='T') + pref[i-1][3];
		pref[i][4]=(a[i-1]=='C') + pref[i-1][4];
		pref[i][5]=(b[i-1]=='C') + pref[i-1][5];
		pref[i][6]=(a[i-1]=='A' && b[i-1]=='T') + pref[i-1][6];
		pref[i][7]=(a[i-1]=='T' && b[i-1]=='A') + pref[i-1][7];
		pref[i][8]=(a[i-1]=='T' && b[i-1]=='C') + pref[i-1][8];
		pref[i][9]=(a[i-1]=='C' && b[i-1]=='T') + pref[i-1][9];
		pref[i][10]=(a[i-1]=='C' && b[i-1]=='A') + pref[i-1][10];
		pref[i][11]=(a[i-1]=='A' && b[i-1]=='C') + pref[i-1][11];
	}
}

int sum(int l,int r,int id)
{
	return pref[r][id]-pref[l-1][id];
}

int get_distance(int x, int y) 
{
	x++;y++;
	if(sum(x,y,0)!=sum(x,y,1) || sum(x,y,2)!=sum(x,y,3) || sum(x,y,4)!=sum(x,y,5)) return -1;
	int ans=0,rem=0;
	for(int i=6;i<=10;i+=2)
	{
		int a=sum(x,y,i),b=sum(x,y,i+1);
		ans+=min(a,b);
		rem+=max(a,b)-min(a,b);
	}
	ans+=rem*2/3;
	return ans;
}

Compilation message

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

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 9272 KB Output is correct
2 Correct 34 ms 9340 KB Output is correct
3 Correct 30 ms 9244 KB Output is correct
4 Correct 32 ms 9356 KB Output is correct
5 Correct 3 ms 6100 KB Output is correct
6 Correct 3 ms 6100 KB Output is correct
7 Correct 3 ms 6100 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6068 KB Output is correct
2 Correct 3 ms 6100 KB Output is correct
3 Correct 3 ms 6068 KB Output is correct
4 Correct 6 ms 6880 KB Output is correct
5 Correct 5 ms 6996 KB Output is correct
6 Correct 5 ms 6868 KB Output is correct
7 Correct 5 ms 6868 KB Output is correct
8 Correct 6 ms 6972 KB Output is correct
9 Correct 5 ms 6868 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6068 KB Output is correct
2 Correct 3 ms 6100 KB Output is correct
3 Correct 3 ms 6068 KB Output is correct
4 Correct 6 ms 6880 KB Output is correct
5 Correct 5 ms 6996 KB Output is correct
6 Correct 5 ms 6868 KB Output is correct
7 Correct 5 ms 6868 KB Output is correct
8 Correct 6 ms 6972 KB Output is correct
9 Correct 5 ms 6868 KB Output is correct
10 Correct 33 ms 9332 KB Output is correct
11 Correct 38 ms 9332 KB Output is correct
12 Correct 36 ms 9632 KB Output is correct
13 Correct 33 ms 9584 KB Output is correct
14 Correct 33 ms 9716 KB Output is correct
15 Correct 32 ms 9716 KB Output is correct
16 Correct 46 ms 9592 KB Output is correct
17 Correct 44 ms 9568 KB Output is correct
18 Correct 31 ms 9608 KB Output is correct
19 Correct 32 ms 9624 KB Output is correct
20 Correct 32 ms 9580 KB Output is correct
21 Correct 33 ms 9696 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6068 KB Output is correct
2 Correct 3 ms 6100 KB Output is correct
3 Correct 3 ms 6068 KB Output is correct
4 Correct 6 ms 6880 KB Output is correct
5 Correct 5 ms 6996 KB Output is correct
6 Correct 5 ms 6868 KB Output is correct
7 Correct 5 ms 6868 KB Output is correct
8 Correct 6 ms 6972 KB Output is correct
9 Correct 5 ms 6868 KB Output is correct
10 Correct 6 ms 6856 KB Output is correct
11 Correct 5 ms 6868 KB Output is correct
12 Correct 6 ms 6848 KB Output is correct
13 Correct 5 ms 6892 KB Output is correct
14 Correct 6 ms 6844 KB Output is correct
15 Correct 5 ms 6868 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 9272 KB Output is correct
2 Correct 34 ms 9340 KB Output is correct
3 Correct 30 ms 9244 KB Output is correct
4 Correct 32 ms 9356 KB Output is correct
5 Correct 3 ms 6100 KB Output is correct
6 Correct 3 ms 6100 KB Output is correct
7 Correct 3 ms 6100 KB Output is correct
8 Correct 4 ms 6068 KB Output is correct
9 Correct 3 ms 6100 KB Output is correct
10 Correct 3 ms 6068 KB Output is correct
11 Correct 6 ms 6880 KB Output is correct
12 Correct 5 ms 6996 KB Output is correct
13 Correct 5 ms 6868 KB Output is correct
14 Correct 5 ms 6868 KB Output is correct
15 Correct 6 ms 6972 KB Output is correct
16 Correct 5 ms 6868 KB Output is correct
17 Correct 33 ms 9332 KB Output is correct
18 Correct 38 ms 9332 KB Output is correct
19 Correct 36 ms 9632 KB Output is correct
20 Correct 33 ms 9584 KB Output is correct
21 Correct 33 ms 9716 KB Output is correct
22 Correct 32 ms 9716 KB Output is correct
23 Correct 46 ms 9592 KB Output is correct
24 Correct 44 ms 9568 KB Output is correct
25 Correct 31 ms 9608 KB Output is correct
26 Correct 32 ms 9624 KB Output is correct
27 Correct 32 ms 9580 KB Output is correct
28 Correct 33 ms 9696 KB Output is correct
29 Correct 6 ms 6856 KB Output is correct
30 Correct 5 ms 6868 KB Output is correct
31 Correct 6 ms 6848 KB Output is correct
32 Correct 5 ms 6892 KB Output is correct
33 Correct 6 ms 6844 KB Output is correct
34 Correct 5 ms 6868 KB Output is correct
35 Correct 3 ms 6100 KB Output is correct
36 Correct 37 ms 9248 KB Output is correct
37 Correct 46 ms 9332 KB Output is correct
38 Correct 35 ms 9616 KB Output is correct
39 Correct 37 ms 9676 KB Output is correct
40 Correct 35 ms 9716 KB Output is correct
41 Correct 5 ms 6848 KB Output is correct
42 Correct 44 ms 9596 KB Output is correct
43 Correct 31 ms 9592 KB Output is correct
44 Correct 32 ms 9608 KB Output is correct
45 Correct 32 ms 9540 KB Output is correct
46 Correct 34 ms 9628 KB Output is correct
47 Correct 33 ms 9692 KB Output is correct