oj.uz

답안 #438867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
438867 2021-06-28T19:55:44 Z victoriad DNA 돌연변이 (IOI21_dna) C++17
84 / 100
 1500 ms 6312 KB 
#include <cmath>
#include <iostream>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <string>
#include <fstream>
#include "dna.h"

using namespace std;
vector<int>aa;
vector<int>ab;
vector<int>ac;
vector<int>ba;
vector<int>bb;
vector<int>bc;
vector<int>mismo;
string j;
string g;
void init(std::string a, std::string b) {
	j=a;
	g=b;
	int n=a.size();
	aa.assign(n+1,0);
	ab.assign(n+1,0);
	ac.assign(n+1,0);
	ba.assign(n+1,0);
	bb.assign(n+1,0);
	bc.assign(n+1,0);
	mismo.assign(n+1,0);
	for(int i=1;i<=n;i++){
		mismo[i]=mismo[i-1];
		if(a[i-1]==b[i-1]){
			mismo[i]=mismo[i-1]+1;
		}
	}
	for(int i=1;i<n+1;i++){
        aa[i]=aa[i-1];
        ab[i]=ab[i-1];
        ac[i]=ac[i-1];
        ba[i]=ba[i-1];
        bb[i]=bb[i-1];
        bc[i]=bc[i-1];
		if(a[i-1]=='A')aa[i]=aa[i-1]+1;
		else if(a[i-1]=='T')ab[i]=ab[i-1]+1;
		else if(a[i-1]=='C')ac[i]=ac[i-1]+1;
		if(b[i-1]=='A')ba[i]=ba[i-1]+1;
		else if(b[i-1]=='T')bb[i]=bb[i-1]+1;
		else if(b[i-1]=='C')bc[i]=bc[i-1]+1;
	}
}

int get_distance(int x, int y) {
	bool pos=true;
	int n=aa.size();
	if(aa[y+1]-aa[x]!=ba[y+1]-ba[x])pos=false;
	else if(ab[y+1]-ab[x]!=bb[y+1]-bb[x])pos=false;
	else if (ac[y+1]-ac[x]!=bc[y+1]-bc[x])pos=false;
	if(pos){
	if(x==y)return 0;
	if(y-x==1){
		if(j[x]!=g[x])return 1;
		else return 0;
	}
	else if(y-x==2){
		int h=mismo[y+1]-mismo[x];
		if(h==3)return 0;
		else if(h==2 ||h==1)return 1;
		else return 2;
	}
	else if(ac[n-1]==0 && bc[n-1]==0){
		int h=mismo[y+1]-mismo[x];
		int lon=y-x;
		return (lon-h+1)/2;
	}

	else{
		int l=y-x;
		vector<bool>co(l,false);
		int sp=0;
		int p=0;
		for(int i=x;i<y;i++){
			if(g[i]==j[i])co[i-x]=true;
		}
		for(int i=x;i<y;i++){
			if(!co[i-x]){
				for(int k=i+1;k<y;k++){
					if(g[i]==j[k] && g[k]==j[i] && !co[k-x]){
						p++;
						co[i-x]=true;
						co[k-x]=true;
						break;
					}
				}
				if(!co[i-x])sp++;
			}
		}
		p+=(sp/3)*2;
		p+=sp%3;
		return p;
	}
	}
	if(!pos)return -1;
	return 0;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 5092 KB Output is correct
2 Correct 46 ms 5168 KB Output is correct
3 Correct 43 ms 4756 KB Output is correct
4 Correct 41 ms 5188 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 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 0 ms 204 KB Output is correct
4 Correct 7 ms 3788 KB Output is correct
5 Correct 5 ms 3788 KB Output is correct
6 Correct 5 ms 3788 KB Output is correct
7 Correct 5 ms 3532 KB Output is correct
8 Correct 5 ms 3840 KB Output is correct
9 Correct 5 ms 3788 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 0 ms 204 KB Output is correct
4 Correct 7 ms 3788 KB Output is correct
5 Correct 5 ms 3788 KB Output is correct
6 Correct 5 ms 3788 KB Output is correct
7 Correct 5 ms 3532 KB Output is correct
8 Correct 5 ms 3840 KB Output is correct
9 Correct 5 ms 3788 KB Output is correct
10 Correct 41 ms 5044 KB Output is correct
11 Correct 41 ms 5188 KB Output is correct
12 Correct 42 ms 5188 KB Output is correct
13 Correct 40 ms 5668 KB Output is correct
14 Correct 42 ms 5888 KB Output is correct
15 Correct 40 ms 5792 KB Output is correct
16 Correct 41 ms 5572 KB Output is correct
17 Correct 46 ms 5668 KB Output is correct
18 Correct 39 ms 5864 KB Output is correct
19 Correct 36 ms 5700 KB Output is correct
20 Correct 37 ms 5804 KB Output is correct
21 Correct 37 ms 5892 KB Output is correct

Subtask #4
28.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 0 ms 204 KB Output is correct
4 Correct 7 ms 3788 KB Output is correct
5 Correct 5 ms 3788 KB Output is correct
6 Correct 5 ms 3788 KB Output is correct
7 Correct 5 ms 3532 KB Output is correct
8 Correct 5 ms 3840 KB Output is correct
9 Correct 5 ms 3788 KB Output is correct
10 Correct 5 ms 3532 KB Output is correct
11 Correct 7 ms 3916 KB Output is correct
12 Correct 5 ms 3532 KB Output is correct
13 Correct 35 ms 3824 KB Output is correct
14 Correct 34 ms 3788 KB Output is correct
15 Correct 19 ms 3844 KB Output is correct

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 5092 KB Output is correct
2 Correct 46 ms 5168 KB Output is correct
3 Correct 43 ms 4756 KB Output is correct
4 Correct 41 ms 5188 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 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 0 ms 204 KB Output is correct
11 Correct 7 ms 3788 KB Output is correct
12 Correct 5 ms 3788 KB Output is correct
13 Correct 5 ms 3788 KB Output is correct
14 Correct 5 ms 3532 KB Output is correct
15 Correct 5 ms 3840 KB Output is correct
16 Correct 5 ms 3788 KB Output is correct
17 Correct 41 ms 5044 KB Output is correct
18 Correct 41 ms 5188 KB Output is correct
19 Correct 42 ms 5188 KB Output is correct
20 Correct 40 ms 5668 KB Output is correct
21 Correct 42 ms 5888 KB Output is correct
22 Correct 40 ms 5792 KB Output is correct
23 Correct 41 ms 5572 KB Output is correct
24 Correct 46 ms 5668 KB Output is correct
25 Correct 39 ms 5864 KB Output is correct
26 Correct 36 ms 5700 KB Output is correct
27 Correct 37 ms 5804 KB Output is correct
28 Correct 37 ms 5892 KB Output is correct
29 Correct 5 ms 3532 KB Output is correct
30 Correct 7 ms 3916 KB Output is correct
31 Correct 5 ms 3532 KB Output is correct
32 Correct 35 ms 3824 KB Output is correct
33 Correct 34 ms 3788 KB Output is correct
34 Correct 19 ms 3844 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 41 ms 5980 KB Output is correct
37 Correct 42 ms 6312 KB Output is correct
38 Execution timed out 1573 ms 5828 KB Time limit exceeded
39 Halted 0 ms 0 KB -