oj.uz

답안 #677101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677101 2023-01-02T09:27:49 Z hello_there_123 DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 37 ms 7440 KB 
#include <bits/stdc++.h>
using namespace std;
string s, t;
int n;
int lol[4][4][200005];
int mat[4][4];
//lol[i][j] -> i wants to turn into j
void init(std::string a, std::string b) {
	int n = a.length();
	for(int i=0;i<n;i++){
		int fir, sec;
		if(a[i] == 'A') fir = 0;
		if(a[i] == 'T') fir = 1;
		if(a[i] == 'C') fir = 2;
		if(b[i] == 'A') sec = 0;
		if(b[i] == 'T') sec = 1;
		if(b[i] == 'C') sec = 2;
		for(int j=0;j<3;j++){
			for(int k=0;k<3;k++){
				if(i!=0) lol[j][k][i] = lol[j][k][i-1];
			}
		}
      	if(a[i]==b[i]) continue;
		lol[fir][sec][i]++;
	}
	
}
 
int get_distance(int z, int y) {
	int ans = 0;
	for(int i=0;i<3;i++){
		for(int j=0;j<3;j++){
			if(z>0) mat[i][j] = lol[i][j][y] - lol[i][j][z-1];
          	else mat[i][j] = lol[i][j][y];
		}
	}
	int x = min(mat[0][1],mat[1][0]);
	ans+=x;
	mat[0][1]-=x;
	mat[1][0]-=x;
	x = min(mat[0][2],mat[2][0]);
	ans+=x;
	mat[0][2]-=x;
	mat[2][0]-=x;
	x = min(mat[1][2],mat[2][1]);
	ans+=x;
	mat[1][2]-=x;
	mat[2][1]-=x;
	if(mat[0][1] + mat[0][2] == mat[1][0] + mat[2][0] && mat[1][0]+mat[1][2] == mat[0][1] + mat[2][1] && mat[2][0]+mat[2][1] == mat[0][2]+mat[1][2]){
		ans+=2*(mat[0][1] + mat[0][2]);
		return ans;
	}
	else return -1;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:24:19: warning: 'sec' may be used uninitialized in this function [-Wmaybe-uninitialized]
   24 |   lol[fir][sec][i]++;
      |   ~~~~~~~~~~~~~~~~^~
dna.cpp:24:19: warning: 'fir' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 5680 KB Output is correct
2 Correct 33 ms 6984 KB Output is correct
3 Correct 32 ms 6664 KB Output is correct
4 Correct 33 ms 7160 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4564 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 4 ms 4564 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4564 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 4 ms 4564 KB Output is correct
10 Correct 37 ms 7024 KB Output is correct
11 Correct 33 ms 7068 KB Output is correct
12 Correct 35 ms 7032 KB Output is correct
13 Correct 34 ms 7188 KB Output is correct
14 Correct 33 ms 7424 KB Output is correct
15 Correct 31 ms 7372 KB Output is correct
16 Correct 31 ms 6956 KB Output is correct
17 Correct 31 ms 7152 KB Output is correct
18 Correct 31 ms 7356 KB Output is correct
19 Correct 29 ms 7056 KB Output is correct
20 Correct 29 ms 7188 KB Output is correct
21 Correct 29 ms 7288 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4564 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4564 KB Output is correct
9 Correct 4 ms 4564 KB Output is correct
10 Correct 5 ms 4240 KB Output is correct
11 Correct 5 ms 4564 KB Output is correct
12 Correct 5 ms 4308 KB Output is correct
13 Correct 5 ms 4564 KB Output is correct
14 Correct 6 ms 4604 KB Output is correct
15 Correct 5 ms 4580 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 5680 KB Output is correct
2 Correct 33 ms 6984 KB Output is correct
3 Correct 32 ms 6664 KB Output is correct
4 Correct 33 ms 7160 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 4564 KB Output is correct
12 Correct 5 ms 4564 KB Output is correct
13 Correct 5 ms 4564 KB Output is correct
14 Correct 4 ms 4308 KB Output is correct
15 Correct 5 ms 4564 KB Output is correct
16 Correct 4 ms 4564 KB Output is correct
17 Correct 37 ms 7024 KB Output is correct
18 Correct 33 ms 7068 KB Output is correct
19 Correct 35 ms 7032 KB Output is correct
20 Correct 34 ms 7188 KB Output is correct
21 Correct 33 ms 7424 KB Output is correct
22 Correct 31 ms 7372 KB Output is correct
23 Correct 31 ms 6956 KB Output is correct
24 Correct 31 ms 7152 KB Output is correct
25 Correct 31 ms 7356 KB Output is correct
26 Correct 29 ms 7056 KB Output is correct
27 Correct 29 ms 7188 KB Output is correct
28 Correct 29 ms 7288 KB Output is correct
29 Correct 5 ms 4240 KB Output is correct
30 Correct 5 ms 4564 KB Output is correct
31 Correct 5 ms 4308 KB Output is correct
32 Correct 5 ms 4564 KB Output is correct
33 Correct 6 ms 4604 KB Output is correct
34 Correct 5 ms 4580 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 35 ms 6628 KB Output is correct
37 Correct 35 ms 7032 KB Output is correct
38 Correct 34 ms 7132 KB Output is correct
39 Correct 34 ms 7440 KB Output is correct
40 Correct 33 ms 7412 KB Output is correct
41 Correct 4 ms 4564 KB Output is correct
42 Correct 31 ms 7112 KB Output is correct
43 Correct 32 ms 7320 KB Output is correct
44 Correct 31 ms 7328 KB Output is correct
45 Correct 30 ms 7148 KB Output is correct
46 Correct 30 ms 7284 KB Output is correct
47 Correct 29 ms 7296 KB Output is correct