oj.uz

Submission #719510

# Submission time Handle Problem Language Result Execution time Memory
719510 2023-04-06T07:47:51 Z baojiaopisu Mutating DNA (IOI21_dna) C++17
100 / 100
 45 ms 16416 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

int d[N][5][5], f[5][5];
int a[N], b[N], pref[N][5];

void init(string A, string B) {
	int n = A.size();
	A = "#" + A;
	B = "#" + B;
	for(int i = 1; i <= n; i++) {
		if(A[i] == 'A') a[i] = 0;
		if(A[i] == 'T') a[i] = 1;
		if(A[i] == 'C') a[i] = 2;

		if(B[i] == 'A') b[i] = 0;
		if(B[i] == 'T') b[i] = 1;
		if(B[i] == 'C') b[i] = 2;

		for(int j = 0; j < 3; j++) {
			pref[i][j] = pref[i - 1][j] + (a[i] == j) - (b[i] == j);
		}

		for(int j = 0; j < 3; j++) {
			for(int k = 0; k < 3; k++) {
				d[i][j][k] = d[i - 1][j][k];
			}
		}
		d[i][a[i]][b[i]]++;
	}
}

int get_distance(int l, int r) {
	l++; r++;
	for(int i = 0; i < 3; i++) {
		if(pref[r][i] != pref[l - 1][i]) return -1;
	}

	int ans = 0;
	for(int i = 0; i < 3; i++) {
		for(int j = 0; j < 3; j++) {
			f[i][j] = d[r][i][j] - d[l - 1][i][j];
		}
	} 

	for(int i = 0; i < 3; i++) {
		for(int j = i + 1; j < 3; j++) {
			int x = min(f[i][j], f[j][i]);
			ans += x;
			f[i][j] -= x;
			f[j][i] -= x;
		}
	}

	int p = 0;
	for(int i = 0; i < 3; i++) {
		for(int j = i + 1; j < 3; j++) {
			if(f[i][j]) p = f[i][j];
		}
	}

	ans += 2 * p;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 15900 KB Output is correct
2 Correct 42 ms 16040 KB Output is correct
3 Correct 40 ms 14904 KB Output is correct
4 Correct 40 ms 16040 KB Output is correct
5 Correct 0 ms 308 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 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 9 ms 13540 KB Output is correct
5 Correct 8 ms 13652 KB Output is correct
6 Correct 10 ms 13544 KB Output is correct
7 Correct 8 ms 12728 KB Output is correct
8 Correct 9 ms 13640 KB Output is correct
9 Correct 7 ms 13636 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 9 ms 13540 KB Output is correct
5 Correct 8 ms 13652 KB Output is correct
6 Correct 10 ms 13544 KB Output is correct
7 Correct 8 ms 12728 KB Output is correct
8 Correct 9 ms 13640 KB Output is correct
9 Correct 7 ms 13636 KB Output is correct
10 Correct 43 ms 15864 KB Output is correct
11 Correct 44 ms 16032 KB Output is correct
12 Correct 45 ms 15500 KB Output is correct
13 Correct 41 ms 15804 KB Output is correct
14 Correct 42 ms 16308 KB Output is correct
15 Correct 39 ms 16296 KB Output is correct
16 Correct 38 ms 15380 KB Output is correct
17 Correct 37 ms 15640 KB Output is correct
18 Correct 40 ms 16328 KB Output is correct
19 Correct 33 ms 15380 KB Output is correct
20 Correct 34 ms 15784 KB Output is correct
21 Correct 35 ms 16268 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 9 ms 13540 KB Output is correct
5 Correct 8 ms 13652 KB Output is correct
6 Correct 10 ms 13544 KB Output is correct
7 Correct 8 ms 12728 KB Output is correct
8 Correct 9 ms 13640 KB Output is correct
9 Correct 7 ms 13636 KB Output is correct
10 Correct 8 ms 12508 KB Output is correct
11 Correct 9 ms 13652 KB Output is correct
12 Correct 8 ms 12756 KB Output is correct
13 Correct 9 ms 13540 KB Output is correct
14 Correct 9 ms 13652 KB Output is correct
15 Correct 8 ms 13652 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 15900 KB Output is correct
2 Correct 42 ms 16040 KB Output is correct
3 Correct 40 ms 14904 KB Output is correct
4 Correct 40 ms 16040 KB Output is correct
5 Correct 0 ms 308 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 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 9 ms 13540 KB Output is correct
12 Correct 8 ms 13652 KB Output is correct
13 Correct 10 ms 13544 KB Output is correct
14 Correct 8 ms 12728 KB Output is correct
15 Correct 9 ms 13640 KB Output is correct
16 Correct 7 ms 13636 KB Output is correct
17 Correct 43 ms 15864 KB Output is correct
18 Correct 44 ms 16032 KB Output is correct
19 Correct 45 ms 15500 KB Output is correct
20 Correct 41 ms 15804 KB Output is correct
21 Correct 42 ms 16308 KB Output is correct
22 Correct 39 ms 16296 KB Output is correct
23 Correct 38 ms 15380 KB Output is correct
24 Correct 37 ms 15640 KB Output is correct
25 Correct 40 ms 16328 KB Output is correct
26 Correct 33 ms 15380 KB Output is correct
27 Correct 34 ms 15784 KB Output is correct
28 Correct 35 ms 16268 KB Output is correct
29 Correct 8 ms 12508 KB Output is correct
30 Correct 9 ms 13652 KB Output is correct
31 Correct 8 ms 12756 KB Output is correct
32 Correct 9 ms 13540 KB Output is correct
33 Correct 9 ms 13652 KB Output is correct
34 Correct 8 ms 13652 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 40 ms 14804 KB Output is correct
37 Correct 42 ms 16028 KB Output is correct
38 Correct 42 ms 15608 KB Output is correct
39 Correct 42 ms 16380 KB Output is correct
40 Correct 40 ms 16416 KB Output is correct
41 Correct 7 ms 13632 KB Output is correct
42 Correct 39 ms 15548 KB Output is correct
43 Correct 40 ms 16288 KB Output is correct
44 Correct 39 ms 16296 KB Output is correct
45 Correct 39 ms 15544 KB Output is correct
46 Correct 44 ms 16276 KB Output is correct
47 Correct 38 ms 16336 KB Output is correct