oj.uz

Submission #819373

# Submission time Handle Problem Language Result Execution time Memory
819373 2023-08-10T09:50:00 Z gesgha Mutating DNA (IOI21_dna) C++17
100 / 100
 37 ms 9756 KB 
#include "dna.h"
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back

#define all(x) x.begin(), x.end()
#define pw(x) (1LL << (x))
#define sz(x) (int)x.size()

using namespace std;


template <typename T>
bool umx(T &x, T& y) {
	return x < y ? x = y, 1 : 0;
}

template <typename T>
bool umn(T &x, T& y) {
	return x > y ? x = y, 1 : 0;
}

using ll = long long;
using pll = pair <ll, ll>;
using pii = pair <int, int>;


const int N = 3e5 + 100;



int n;
int ca[N][3];
int cb[N][3];

int CNT[N][3][3];
int VAL[N];
void init(string a, string b) {
	VAL['A'] = 0;
	VAL['T'] = 1;
	VAL['C'] = 2;
	int n = sz(a);
	for (int i = 0; i < n; i++) {
		if (a[i] == 'A') ca[i][0] = 1;
		else if (a[i] == 'T') ca[i][1] = 1;
		else if (a[i] == 'C') ca[i][2] = 1;
		if (i) {
			for (int j = 0; j < 3; j++) ca[i][j] += ca[i - 1][j];
		}
	}
	for (int i = 0; i < n; i++) {
		if (b[i] == 'A') cb[i][0] = 1;
		else if (b[i] == 'T') cb[i][1] = 1;
		else if (b[i] == 'C') cb[i][2] = 1;
		if (i) {
			for (int j = 0; j < 3; j++) cb[i][j] += cb[i - 1][j];
		}
	}
	for (int i = 0; i < n; i++) {
		int x = VAL[a[i]], y = VAL[b[i]];
		CNT[i][x][y] = 1;
		if (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_distance(int x, int y) {
	for (int i = 0; i < 3; i++) {
		int c1 = ca[y][i], c2 = cb[y][i];
		if (x) {
			c1 -= ca[x - 1][i];
			c2 -= cb[x - 1][i];
		}
		if (c1 != c2) return -1;
	}
	int C[3][3] = {};
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			C[i][j] = CNT[y][i][j];
			if (x) C[i][j] -= CNT[x - 1][i][j];
		}
	}
	int ans = 0;
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			if (i == j) continue;
			int X = min(C[i][j], C[j][i]);
			ans += X;
			C[i][j] -= X;
			C[j][i] -= X;
		}
	}
	int ws = 0;
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			if(i == j) continue;
			ans += C[i][j];
			umx(ws, C[i][j]);
		}
	}
	ans -= ws;
	return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:62:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   62 |   int x = VAL[a[i]], y = VAL[b[i]];
      |                   ^
dna.cpp:62:34: warning: array subscript has type 'char' [-Wchar-subscripts]
   62 |   int x = VAL[a[i]], y = VAL[b[i]];
      |                                  ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 7948 KB Output is correct
2 Correct 29 ms 8080 KB Output is correct
3 Correct 28 ms 7408 KB Output is correct
4 Correct 30 ms 8068 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 5 ms 6740 KB Output is correct
6 Correct 5 ms 6692 KB Output is correct
7 Correct 5 ms 6324 KB Output is correct
8 Correct 5 ms 6740 KB Output is correct
9 Correct 4 ms 6740 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 5 ms 6740 KB Output is correct
6 Correct 5 ms 6692 KB Output is correct
7 Correct 5 ms 6324 KB Output is correct
8 Correct 5 ms 6740 KB Output is correct
9 Correct 4 ms 6740 KB Output is correct
10 Correct 29 ms 7940 KB Output is correct
11 Correct 30 ms 8060 KB Output is correct
12 Correct 30 ms 7924 KB Output is correct
13 Correct 30 ms 8140 KB Output is correct
14 Correct 31 ms 8336 KB Output is correct
15 Correct 29 ms 8376 KB Output is correct
16 Correct 31 ms 7944 KB Output is correct
17 Correct 31 ms 8164 KB Output is correct
18 Correct 31 ms 8328 KB Output is correct
19 Correct 28 ms 7924 KB Output is correct
20 Correct 28 ms 8220 KB Output is correct
21 Correct 29 ms 8400 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 5 ms 6740 KB Output is correct
6 Correct 5 ms 6692 KB Output is correct
7 Correct 5 ms 6324 KB Output is correct
8 Correct 5 ms 6740 KB Output is correct
9 Correct 4 ms 6740 KB Output is correct
10 Correct 4 ms 6100 KB Output is correct
11 Correct 5 ms 6740 KB Output is correct
12 Correct 4 ms 6228 KB Output is correct
13 Correct 5 ms 6868 KB Output is correct
14 Correct 5 ms 6944 KB Output is correct
15 Correct 5 ms 6976 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 7948 KB Output is correct
2 Correct 29 ms 8080 KB Output is correct
3 Correct 28 ms 7408 KB Output is correct
4 Correct 30 ms 8068 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 4 ms 6612 KB Output is correct
12 Correct 5 ms 6740 KB Output is correct
13 Correct 5 ms 6692 KB Output is correct
14 Correct 5 ms 6324 KB Output is correct
15 Correct 5 ms 6740 KB Output is correct
16 Correct 4 ms 6740 KB Output is correct
17 Correct 29 ms 7940 KB Output is correct
18 Correct 30 ms 8060 KB Output is correct
19 Correct 30 ms 7924 KB Output is correct
20 Correct 30 ms 8140 KB Output is correct
21 Correct 31 ms 8336 KB Output is correct
22 Correct 29 ms 8376 KB Output is correct
23 Correct 31 ms 7944 KB Output is correct
24 Correct 31 ms 8164 KB Output is correct
25 Correct 31 ms 8328 KB Output is correct
26 Correct 28 ms 7924 KB Output is correct
27 Correct 28 ms 8220 KB Output is correct
28 Correct 29 ms 8400 KB Output is correct
29 Correct 4 ms 6100 KB Output is correct
30 Correct 5 ms 6740 KB Output is correct
31 Correct 4 ms 6228 KB Output is correct
32 Correct 5 ms 6868 KB Output is correct
33 Correct 5 ms 6944 KB Output is correct
34 Correct 5 ms 6976 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 32 ms 8776 KB Output is correct
37 Correct 31 ms 9420 KB Output is correct
38 Correct 35 ms 9364 KB Output is correct
39 Correct 32 ms 9748 KB Output is correct
40 Correct 36 ms 9756 KB Output is correct
41 Correct 4 ms 6928 KB Output is correct
42 Correct 34 ms 9200 KB Output is correct
43 Correct 32 ms 9644 KB Output is correct
44 Correct 37 ms 9716 KB Output is correct
45 Correct 29 ms 9236 KB Output is correct
46 Correct 30 ms 9608 KB Output is correct
47 Correct 34 ms 9636 KB Output is correct