oj.uz

Submission #930438

# Submission time Handle Problem Language Result Execution time Memory
930438 2024-02-19T15:42:12 Z SmuggingSpun Mutating DNA (IOI21_dna) C++17
100 / 100
 34 ms 7192 KB 
#include "dna.h"
#include<bits/stdc++.h>
using namespace std;
const int lim = 1e5 + 5;
int get_id(char c){
	return (c == 'A' ? 0 : 1 + int(c == 'T'));
}
int cnt[lim][3][3];
void init(string a, string b){
	int n = a.size();
	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 3; j++){
			cnt[0][i][j] = 0;
		}
	}
	for(int i = 1; i <= n; i++){
		for(int j = 0; j < 3; j++){
			for(int k = 0; k < 3; k++){
				cnt[i][j][k] = cnt[i - 1][j][k] + int(get_id(a[i - 1]) == j && get_id(b[i - 1]) == k);
			}
		}
	}
}
int get_distance(int x, int y) {
	x++;
	y++;
	int cycle, ans = 0;
	for(int i = 0; i < 3; i++){
		int j = (i == 2 ? 0 : i + 1), a = cnt[y][i][j] - cnt[x - 1][i][j], b = cnt[y][j][i] - cnt[x - 1][j][i];
		if(i == 0){
			cycle = a - b;
		}
		else if(cycle != a -b){
			return -1;
		}
		ans += min(a, b);
	}
	return ans + (abs(cycle) << 1);
}

Compilation message

dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:33:8: warning: 'cycle' may be used uninitialized in this function [-Wmaybe-uninitialized]
   33 |   else if(cycle != a -b){
      |        ^~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 5904 KB Output is correct
2 Correct 33 ms 6488 KB Output is correct
3 Correct 27 ms 5972 KB Output is correct
4 Correct 26 ms 6296 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 5 ms 4504 KB Output is correct
5 Correct 4 ms 4484 KB Output is correct
6 Correct 4 ms 4444 KB Output is correct
7 Correct 4 ms 4296 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4440 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 5 ms 4504 KB Output is correct
5 Correct 4 ms 4484 KB Output is correct
6 Correct 4 ms 4444 KB Output is correct
7 Correct 4 ms 4296 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4440 KB Output is correct
10 Correct 26 ms 6416 KB Output is correct
11 Correct 27 ms 6536 KB Output is correct
12 Correct 27 ms 6948 KB Output is correct
13 Correct 27 ms 6676 KB Output is correct
14 Correct 29 ms 6924 KB Output is correct
15 Correct 26 ms 6156 KB Output is correct
16 Correct 27 ms 6684 KB Output is correct
17 Correct 28 ms 6224 KB Output is correct
18 Correct 27 ms 6924 KB Output is correct
19 Correct 25 ms 6952 KB Output is correct
20 Correct 25 ms 6680 KB Output is correct
21 Correct 33 ms 6928 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 5 ms 4504 KB Output is correct
5 Correct 4 ms 4484 KB Output is correct
6 Correct 4 ms 4444 KB Output is correct
7 Correct 4 ms 4296 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4440 KB Output is correct
10 Correct 4 ms 4184 KB Output is correct
11 Correct 5 ms 4444 KB Output is correct
12 Correct 4 ms 4188 KB Output is correct
13 Correct 5 ms 4444 KB Output is correct
14 Correct 5 ms 4444 KB Output is correct
15 Correct 4 ms 4700 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 5904 KB Output is correct
2 Correct 33 ms 6488 KB Output is correct
3 Correct 27 ms 5972 KB Output is correct
4 Correct 26 ms 6296 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 5 ms 4504 KB Output is correct
12 Correct 4 ms 4484 KB Output is correct
13 Correct 4 ms 4444 KB Output is correct
14 Correct 4 ms 4296 KB Output is correct
15 Correct 4 ms 4444 KB Output is correct
16 Correct 4 ms 4440 KB Output is correct
17 Correct 26 ms 6416 KB Output is correct
18 Correct 27 ms 6536 KB Output is correct
19 Correct 27 ms 6948 KB Output is correct
20 Correct 27 ms 6676 KB Output is correct
21 Correct 29 ms 6924 KB Output is correct
22 Correct 26 ms 6156 KB Output is correct
23 Correct 27 ms 6684 KB Output is correct
24 Correct 28 ms 6224 KB Output is correct
25 Correct 27 ms 6924 KB Output is correct
26 Correct 25 ms 6952 KB Output is correct
27 Correct 25 ms 6680 KB Output is correct
28 Correct 33 ms 6928 KB Output is correct
29 Correct 4 ms 4184 KB Output is correct
30 Correct 5 ms 4444 KB Output is correct
31 Correct 4 ms 4188 KB Output is correct
32 Correct 5 ms 4444 KB Output is correct
33 Correct 5 ms 4444 KB Output is correct
34 Correct 4 ms 4700 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 34 ms 6356 KB Output is correct
37 Correct 26 ms 6744 KB Output is correct
38 Correct 27 ms 6608 KB Output is correct
39 Correct 27 ms 6668 KB Output is correct
40 Correct 28 ms 7184 KB Output is correct
41 Correct 4 ms 4700 KB Output is correct
42 Correct 27 ms 6640 KB Output is correct
43 Correct 27 ms 6924 KB Output is correct
44 Correct 29 ms 7048 KB Output is correct
45 Correct 26 ms 6832 KB Output is correct
46 Correct 26 ms 7192 KB Output is correct
47 Correct 26 ms 6884 KB Output is correct