oj.uz

Submission #753722

# Submission time Handle Problem Language Result Execution time Memory
753722 2023-06-05T18:28:10 Z nicksms Mutating DNA (IOI21_dna) C++17
100 / 100
 55 ms 7628 KB 
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using db=long double;
template<class T> using V=vector<T>;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int,int>;
#define f first
#define s second
#define sz(x) (int)((x).size())

string A, B;
V<V<vi>> cnts(3,V<vi>(3));

void init(string a, string b) {
	A=a, B=b;
	map<char, int> m = {{'A',0}, {'T',1}, {'C',2}};
	for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) {
		cnts[i][j]=vi(sz(a)+1);
	}
	for (int i = 0; i < sz(a); i++) {
		cnts[m[a[i]]][m[b[i]]][i+1] = 1;
	}
	for (int i = 0; i < 3; i++) 
		for (int j = 0; j < 3; j++)
			for (int k = 0; k < sz(a); k++) 
				cnts[i][j][k+1] += cnts[i][j][k];
}

int get_distance(int x, int y) {
	vi t(3); 
	V<vi> e(3,vi(3));
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			t[i] += (e[i][j] = cnts[i][j][y+1]-cnts[i][j][x]);
			t[j] -= e[i][j];
		}
	}
	for (int i = 0; i < 3; i++) if (t[i]) return -1;
	int tot = 0;
	for (int i = 0; i < 3; i++) 
		for (int j = 0; j < 3; j++) if (i != j) {
			int m = min(e[i][j],e[j][i]);
			tot += m; e[i][j] -= m; e[j][i] -= m;
		}
	int rem = 0;
	for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) if (i != j) rem += e[i][j];
	assert(rem % 3 == 0);
	return tot + 2*(rem/3);
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 7244 KB Output is correct
2 Correct 53 ms 7380 KB Output is correct
3 Correct 50 ms 6932 KB Output is correct
4 Correct 50 ms 7244 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 4692 KB Output is correct
5 Correct 5 ms 4832 KB Output is correct
6 Correct 5 ms 4792 KB Output is correct
7 Correct 5 ms 4436 KB Output is correct
8 Correct 7 ms 4820 KB Output is correct
9 Correct 5 ms 4820 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 4692 KB Output is correct
5 Correct 5 ms 4832 KB Output is correct
6 Correct 5 ms 4792 KB Output is correct
7 Correct 5 ms 4436 KB Output is correct
8 Correct 7 ms 4820 KB Output is correct
9 Correct 5 ms 4820 KB Output is correct
10 Correct 48 ms 7168 KB Output is correct
11 Correct 49 ms 7268 KB Output is correct
12 Correct 50 ms 7228 KB Output is correct
13 Correct 50 ms 7448 KB Output is correct
14 Correct 51 ms 7608 KB Output is correct
15 Correct 50 ms 7604 KB Output is correct
16 Correct 47 ms 7244 KB Output is correct
17 Correct 46 ms 7372 KB Output is correct
18 Correct 46 ms 7556 KB Output is correct
19 Correct 44 ms 7192 KB Output is correct
20 Correct 46 ms 7420 KB Output is correct
21 Correct 45 ms 7544 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 4692 KB Output is correct
5 Correct 5 ms 4832 KB Output is correct
6 Correct 5 ms 4792 KB Output is correct
7 Correct 5 ms 4436 KB Output is correct
8 Correct 7 ms 4820 KB Output is correct
9 Correct 5 ms 4820 KB Output is correct
10 Correct 6 ms 4432 KB Output is correct
11 Correct 6 ms 4820 KB Output is correct
12 Correct 6 ms 4436 KB Output is correct
13 Correct 7 ms 4824 KB Output is correct
14 Correct 6 ms 4820 KB Output is correct
15 Correct 6 ms 4796 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 7244 KB Output is correct
2 Correct 53 ms 7380 KB Output is correct
3 Correct 50 ms 6932 KB Output is correct
4 Correct 50 ms 7244 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 5 ms 4692 KB Output is correct
12 Correct 5 ms 4832 KB Output is correct
13 Correct 5 ms 4792 KB Output is correct
14 Correct 5 ms 4436 KB Output is correct
15 Correct 7 ms 4820 KB Output is correct
16 Correct 5 ms 4820 KB Output is correct
17 Correct 48 ms 7168 KB Output is correct
18 Correct 49 ms 7268 KB Output is correct
19 Correct 50 ms 7228 KB Output is correct
20 Correct 50 ms 7448 KB Output is correct
21 Correct 51 ms 7608 KB Output is correct
22 Correct 50 ms 7604 KB Output is correct
23 Correct 47 ms 7244 KB Output is correct
24 Correct 46 ms 7372 KB Output is correct
25 Correct 46 ms 7556 KB Output is correct
26 Correct 44 ms 7192 KB Output is correct
27 Correct 46 ms 7420 KB Output is correct
28 Correct 45 ms 7544 KB Output is correct
29 Correct 6 ms 4432 KB Output is correct
30 Correct 6 ms 4820 KB Output is correct
31 Correct 6 ms 4436 KB Output is correct
32 Correct 7 ms 4824 KB Output is correct
33 Correct 6 ms 4820 KB Output is correct
34 Correct 6 ms 4796 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 49 ms 6840 KB Output is correct
37 Correct 55 ms 7328 KB Output is correct
38 Correct 52 ms 7328 KB Output is correct
39 Correct 55 ms 7608 KB Output is correct
40 Correct 54 ms 7572 KB Output is correct
41 Correct 5 ms 4820 KB Output is correct
42 Correct 47 ms 7312 KB Output is correct
43 Correct 51 ms 7528 KB Output is correct
44 Correct 48 ms 7608 KB Output is correct
45 Correct 46 ms 7280 KB Output is correct
46 Correct 48 ms 7628 KB Output is correct
47 Correct 48 ms 7628 KB Output is correct