oj.uz

답안 #894338

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894338 2023-12-28T06:42:07 Z Malix DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 41 ms 14564 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair

vector<vi> arr;

void init(std::string a, std::string b) {
	int n=a.size();
	vector<vi> s(n,vi(6,0));
	REP(i,0,n){
		if(a[i]==b[i])continue;
		if(a[i]=='T'){
			if(b[i]=='A')s[i][0]++;
			if(b[i]=='C')s[i][2]++;
		}
		else if(a[i]=='A'){
			if(b[i]=='T')s[i][1]++;
			if(b[i]=='C')s[i][4]++;
		}
		else{
			if(b[i]=='T')s[i][3]++;
			if(b[i]=='A')s[i][5]++;
		}
	}
	arr.resize(n,vi(6,0));
	REP(i,0,6)arr[0][i]=s[0][i];
	REP(i,1,n){
		REP(j,0,6)arr[i][j]=arr[i-1][j]+s[i][j];
	}
}

int get_distance(int x, int y) {
	int ans=0;int t=0;
	vi arr2(6);
	if(x==0)REP(i,0,6)arr2[i]=arr[y][i];
	else REP(i,0,6)arr2[i]=arr[y][i]-arr[x-1][i];
	//REP(i,0,6)cout<<arr2[i]<<" ";
	REP(i,0,6){
		t=min(arr2[i],arr2[i+1]);
		arr2[i]-=t;arr2[i+1]-=t;
		ans+=t;
		i++;
	}
	if(arr2[0]==arr2[4]&&arr2[0]==arr2[3])ans+=2*arr2[0];
	else return -1;
	if(arr2[1]==arr2[2]&&arr2[1]==arr2[5])ans+=2*arr2[1];
	else return -1;
	return ans;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 14164 KB Output is correct
2 Correct 36 ms 14420 KB Output is correct
3 Correct 36 ms 13404 KB Output is correct
4 Correct 38 ms 14416 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 12 ms 11868 KB Output is correct
5 Correct 12 ms 12120 KB Output is correct
6 Correct 12 ms 11868 KB Output is correct
7 Correct 11 ms 11352 KB Output is correct
8 Correct 12 ms 12124 KB Output is correct
9 Correct 11 ms 12004 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 12 ms 11868 KB Output is correct
5 Correct 12 ms 12120 KB Output is correct
6 Correct 12 ms 11868 KB Output is correct
7 Correct 11 ms 11352 KB Output is correct
8 Correct 12 ms 12124 KB Output is correct
9 Correct 11 ms 12004 KB Output is correct
10 Correct 40 ms 14172 KB Output is correct
11 Correct 38 ms 14564 KB Output is correct
12 Correct 37 ms 13660 KB Output is correct
13 Correct 38 ms 13912 KB Output is correct
14 Correct 39 ms 14252 KB Output is correct
15 Correct 36 ms 14396 KB Output is correct
16 Correct 37 ms 13404 KB Output is correct
17 Correct 38 ms 13652 KB Output is correct
18 Correct 37 ms 14160 KB Output is correct
19 Correct 33 ms 13404 KB Output is correct
20 Correct 34 ms 13740 KB Output is correct
21 Correct 41 ms 14420 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 12 ms 11868 KB Output is correct
5 Correct 12 ms 12120 KB Output is correct
6 Correct 12 ms 11868 KB Output is correct
7 Correct 11 ms 11352 KB Output is correct
8 Correct 12 ms 12124 KB Output is correct
9 Correct 11 ms 12004 KB Output is correct
10 Correct 12 ms 11096 KB Output is correct
11 Correct 12 ms 12120 KB Output is correct
12 Correct 12 ms 11356 KB Output is correct
13 Correct 13 ms 12124 KB Output is correct
14 Correct 11 ms 11964 KB Output is correct
15 Correct 12 ms 12124 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 14164 KB Output is correct
2 Correct 36 ms 14420 KB Output is correct
3 Correct 36 ms 13404 KB Output is correct
4 Correct 38 ms 14416 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 12 ms 11868 KB Output is correct
12 Correct 12 ms 12120 KB Output is correct
13 Correct 12 ms 11868 KB Output is correct
14 Correct 11 ms 11352 KB Output is correct
15 Correct 12 ms 12124 KB Output is correct
16 Correct 11 ms 12004 KB Output is correct
17 Correct 40 ms 14172 KB Output is correct
18 Correct 38 ms 14564 KB Output is correct
19 Correct 37 ms 13660 KB Output is correct
20 Correct 38 ms 13912 KB Output is correct
21 Correct 39 ms 14252 KB Output is correct
22 Correct 36 ms 14396 KB Output is correct
23 Correct 37 ms 13404 KB Output is correct
24 Correct 38 ms 13652 KB Output is correct
25 Correct 37 ms 14160 KB Output is correct
26 Correct 33 ms 13404 KB Output is correct
27 Correct 34 ms 13740 KB Output is correct
28 Correct 41 ms 14420 KB Output is correct
29 Correct 12 ms 11096 KB Output is correct
30 Correct 12 ms 12120 KB Output is correct
31 Correct 12 ms 11356 KB Output is correct
32 Correct 13 ms 12124 KB Output is correct
33 Correct 11 ms 11964 KB Output is correct
34 Correct 12 ms 12124 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 35 ms 13400 KB Output is correct
37 Correct 38 ms 14468 KB Output is correct
38 Correct 37 ms 13648 KB Output is correct
39 Correct 37 ms 14428 KB Output is correct
40 Correct 38 ms 14424 KB Output is correct
41 Correct 11 ms 12124 KB Output is correct
42 Correct 37 ms 13652 KB Output is correct
43 Correct 37 ms 14172 KB Output is correct
44 Correct 39 ms 14192 KB Output is correct
45 Correct 33 ms 13648 KB Output is correct
46 Correct 34 ms 14172 KB Output is correct
47 Correct 35 ms 14172 KB Output is correct