oj.uz

답안 #531180

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
531180 2022-02-28T03:25:12 Z jamezzz DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 39 ms 7296 KB 
#include "dna.h"

#include <bits/stdc++.h>
using namespace std;

int n;
int pfx[100005][6],pa[100005][3],pb[100005][3],cnt[6];

int to(char c){
	if(c=='A')return 0;
	else if(c=='C')return 1;
	else return 2;
}

void init(string a,string b){
	n=a.length();
	for(int i=1;i<=n;++i){
		for(int j=0;j<3;++j){
			pa[i][j]=pa[i-1][j];
			pb[i][j]=pb[i-1][j];
		}
		++pa[i][to(a[i-1])];
		++pb[i][to(b[i-1])];
	}
	for(int i=0;i<n;++i){
		for(int j=0;j<6;++j){
			pfx[i+1][j]=pfx[i][j];
		}
		int v;
		if(a[i]==b[i])continue;
		if(a[i]=='C'&&b[i]=='A')v=0;
		if(a[i]=='T'&&b[i]=='A')v=1;
		if(a[i]=='A'&&b[i]=='C')v=2;
		if(a[i]=='T'&&b[i]=='C')v=3;
		if(a[i]=='A'&&b[i]=='T')v=4;
		if(a[i]=='C'&&b[i]=='T')v=5;
		++pfx[i+1][v];
	}
}

int get_distance(int x,int y){
	++x;++y;
	bool pos=true;
	for(int i=0;i<3;++i)pos=pos&&(pa[y][i]-pa[x-1][i]==pb[y][i]-pb[x-1][i]);
	if(!pos)return -1;
	for(int i=0;i<6;++i)cnt[i]=pfx[y][i]-pfx[x-1][i];
	int t,ans=0;
	
	t=min(cnt[0],cnt[2]);
	cnt[0]-=t;cnt[2]-=t;ans+=t;
	
	t=min(cnt[1],cnt[4]);
	cnt[1]-=t;cnt[4]-=t;ans+=t;
	
	t=min(cnt[3],cnt[5]);
	cnt[3]-=t;cnt[5]-=t;ans+=t;
	
	ans+=2*(cnt[0]+cnt[2]);
	
	return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:37:15: warning: 'v' may be used uninitialized in this function [-Wmaybe-uninitialized]
   37 |   ++pfx[i+1][v];
      |     ~~~~~~~~~~^

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 6784 KB Output is correct
2 Correct 31 ms 6804 KB Output is correct
3 Correct 32 ms 6388 KB Output is correct
4 Correct 33 ms 6784 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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 5396 KB Output is correct
5 Correct 6 ms 5528 KB Output is correct
6 Correct 5 ms 5476 KB Output is correct
7 Correct 5 ms 5196 KB Output is correct
8 Correct 5 ms 5512 KB Output is correct
9 Correct 4 ms 5452 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 5396 KB Output is correct
5 Correct 6 ms 5528 KB Output is correct
6 Correct 5 ms 5476 KB Output is correct
7 Correct 5 ms 5196 KB Output is correct
8 Correct 5 ms 5512 KB Output is correct
9 Correct 4 ms 5452 KB Output is correct
10 Correct 34 ms 6788 KB Output is correct
11 Correct 34 ms 6860 KB Output is correct
12 Correct 32 ms 6800 KB Output is correct
13 Correct 33 ms 6980 KB Output is correct
14 Correct 33 ms 7164 KB Output is correct
15 Correct 31 ms 7172 KB Output is correct
16 Correct 31 ms 6836 KB Output is correct
17 Correct 31 ms 6908 KB Output is correct
18 Correct 36 ms 7264 KB Output is correct
19 Correct 39 ms 6844 KB Output is correct
20 Correct 30 ms 7052 KB Output is correct
21 Correct 30 ms 7296 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 5396 KB Output is correct
5 Correct 6 ms 5528 KB Output is correct
6 Correct 5 ms 5476 KB Output is correct
7 Correct 5 ms 5196 KB Output is correct
8 Correct 5 ms 5512 KB Output is correct
9 Correct 4 ms 5452 KB Output is correct
10 Correct 5 ms 5068 KB Output is correct
11 Correct 6 ms 5580 KB Output is correct
12 Correct 6 ms 5236 KB Output is correct
13 Correct 6 ms 5452 KB Output is correct
14 Correct 6 ms 5548 KB Output is correct
15 Correct 5 ms 5452 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 6784 KB Output is correct
2 Correct 31 ms 6804 KB Output is correct
3 Correct 32 ms 6388 KB Output is correct
4 Correct 33 ms 6784 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 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 6 ms 5396 KB Output is correct
12 Correct 6 ms 5528 KB Output is correct
13 Correct 5 ms 5476 KB Output is correct
14 Correct 5 ms 5196 KB Output is correct
15 Correct 5 ms 5512 KB Output is correct
16 Correct 4 ms 5452 KB Output is correct
17 Correct 34 ms 6788 KB Output is correct
18 Correct 34 ms 6860 KB Output is correct
19 Correct 32 ms 6800 KB Output is correct
20 Correct 33 ms 6980 KB Output is correct
21 Correct 33 ms 7164 KB Output is correct
22 Correct 31 ms 7172 KB Output is correct
23 Correct 31 ms 6836 KB Output is correct
24 Correct 31 ms 6908 KB Output is correct
25 Correct 36 ms 7264 KB Output is correct
26 Correct 39 ms 6844 KB Output is correct
27 Correct 30 ms 7052 KB Output is correct
28 Correct 30 ms 7296 KB Output is correct
29 Correct 5 ms 5068 KB Output is correct
30 Correct 6 ms 5580 KB Output is correct
31 Correct 6 ms 5236 KB Output is correct
32 Correct 6 ms 5452 KB Output is correct
33 Correct 6 ms 5548 KB Output is correct
34 Correct 5 ms 5452 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 32 ms 6364 KB Output is correct
37 Correct 33 ms 6784 KB Output is correct
38 Correct 32 ms 6896 KB Output is correct
39 Correct 33 ms 7168 KB Output is correct
40 Correct 33 ms 7204 KB Output is correct
41 Correct 4 ms 5452 KB Output is correct
42 Correct 31 ms 6904 KB Output is correct
43 Correct 31 ms 7176 KB Output is correct
44 Correct 32 ms 7128 KB Output is correct
45 Correct 30 ms 6944 KB Output is correct
46 Correct 30 ms 7172 KB Output is correct
47 Correct 31 ms 7200 KB Output is correct