oj.uz

Submission #586031

# Submission time Handle Problem Language Result Execution time Memory
586031 2022-06-29T18:29:38 Z eyangch Mutating DNA (IOI21_dna) C++17
100 / 100
 35 ms 7372 KB 
#include <bits/stdc++.h>
#define endl '\n'
#define eat cin
#define moo cout

using namespace std;

int pfx[3][3][100000];

void init(string a, string b){
	for(int i = 0; i < (int)a.length(); i++){
		int ai = 0, bi = 0;
		if(a[i] == 'T') ai = 1;
		if(a[i] == 'C') ai = 2;
		if(b[i] == 'T') bi = 1;
		if(b[i] == 'C') bi = 2;
		pfx[ai][bi][i]++;
		if(i > 0){
			for(int j = 0; j < 3; j++){
				for(int k = 0; k < 3; k++){
					pfx[j][k][i] += pfx[j][k][i-1];
				}
			}
		}
	}
}

int get_distance(int x, int y){
	int d = 0;
	int cur[3][3];
	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 3; j++){
			cur[i][j] = pfx[i][j][y];
			if(x > 0) cur[i][j] -= pfx[i][j][x-1];
		}
	}
	for(int i = 0; i < 3; i++){
		int nxt = (i+1)%3;
		int mn = min(cur[i][nxt], cur[nxt][i]);
		d += mn;
		cur[i][nxt] -= d;
		cur[nxt][i] -= d;
	}
	int rem = cur[0][1] - cur[1][0];
	if(cur[1][2] - cur[2][1] != rem || cur[2][0] - cur[0][2] != rem){
		return -1;
	}
	return d + abs(rem) * 2;
}

/*int32_t main(){
	eat.tie(0) -> sync_with_stdio(0);
	init("ATACAT", "ACTATA");
	moo << get_distance(1, 2) << ' ' << get_distance(4, 5) << ' ' << get_distance(0, 0) << endl;
}*/

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 5640 KB Output is correct
2 Correct 33 ms 5640 KB Output is correct
3 Correct 32 ms 5368 KB Output is correct
4 Correct 33 ms 6980 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 308 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 4 ms 4308 KB Output is correct
7 Correct 4 ms 4132 KB Output is correct
8 Correct 4 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 4 ms 4308 KB Output is correct
7 Correct 4 ms 4132 KB Output is correct
8 Correct 4 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 34 ms 5636 KB Output is correct
11 Correct 35 ms 5704 KB Output is correct
12 Correct 33 ms 5732 KB Output is correct
13 Correct 33 ms 5888 KB Output is correct
14 Correct 35 ms 5992 KB Output is correct
15 Correct 34 ms 5888 KB Output is correct
16 Correct 32 ms 5792 KB Output is correct
17 Correct 32 ms 5892 KB Output is correct
18 Correct 32 ms 6020 KB Output is correct
19 Correct 31 ms 5748 KB Output is correct
20 Correct 33 ms 5908 KB Output is correct
21 Correct 30 ms 6024 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 4 ms 4308 KB Output is correct
7 Correct 4 ms 4132 KB Output is correct
8 Correct 4 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 4 ms 4052 KB Output is correct
11 Correct 5 ms 4544 KB Output is correct
12 Correct 4 ms 4308 KB Output is correct
13 Correct 4 ms 4576 KB Output is correct
14 Correct 4 ms 4544 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 5640 KB Output is correct
2 Correct 33 ms 5640 KB Output is correct
3 Correct 32 ms 5368 KB Output is correct
4 Correct 33 ms 6980 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 4 ms 4308 KB Output is correct
12 Correct 4 ms 4308 KB Output is correct
13 Correct 4 ms 4308 KB Output is correct
14 Correct 4 ms 4132 KB Output is correct
15 Correct 4 ms 4308 KB Output is correct
16 Correct 3 ms 4308 KB Output is correct
17 Correct 34 ms 5636 KB Output is correct
18 Correct 35 ms 5704 KB Output is correct
19 Correct 33 ms 5732 KB Output is correct
20 Correct 33 ms 5888 KB Output is correct
21 Correct 35 ms 5992 KB Output is correct
22 Correct 34 ms 5888 KB Output is correct
23 Correct 32 ms 5792 KB Output is correct
24 Correct 32 ms 5892 KB Output is correct
25 Correct 32 ms 6020 KB Output is correct
26 Correct 31 ms 5748 KB Output is correct
27 Correct 33 ms 5908 KB Output is correct
28 Correct 30 ms 6024 KB Output is correct
29 Correct 4 ms 4052 KB Output is correct
30 Correct 5 ms 4544 KB Output is correct
31 Correct 4 ms 4308 KB Output is correct
32 Correct 4 ms 4576 KB Output is correct
33 Correct 4 ms 4544 KB Output is correct
34 Correct 4 ms 4564 KB Output is correct
35 Correct 1 ms 308 KB Output is correct
36 Correct 33 ms 6656 KB Output is correct
37 Correct 34 ms 7032 KB Output is correct
38 Correct 34 ms 7144 KB Output is correct
39 Correct 34 ms 7304 KB Output is correct
40 Correct 34 ms 7372 KB Output is correct
41 Correct 4 ms 4564 KB Output is correct
42 Correct 34 ms 7036 KB Output is correct
43 Correct 32 ms 7304 KB Output is correct
44 Correct 33 ms 7312 KB Output is correct
45 Correct 30 ms 7108 KB Output is correct
46 Correct 31 ms 7300 KB Output is correct
47 Correct 31 ms 7304 KB Output is correct