oj.uz

Submission #565169

# Submission time Handle Problem Language Result Execution time Memory
565169 2022-05-20T11:38:53 Z hoanghq2004 Mutating DNA (IOI21_dna) C++17
100 / 100
 51 ms 6072 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "dna.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 1e5 + 10;

int code[256];
int s[N][3][3];

void init(string a, string b) {
    code['A'] = 0, code['C'] = 1, code['T'] = 2;
    int n = a.size();
    for (int i = 1; i <= n; ++i) {
        for (int x = 0; x < 3; ++x)
            for (int y = 0; y < 3; ++y)
                s[i][x][y] = s[i - 1][x][y];
        ++s[i][code[a[i - 1]]][code[b[i - 1]]];
    }
}

int get_distance(int L, int R) {
    ++L, ++R;
    int need = 0;
    int rem = 0;
    for (int x = 0; x < 3; ++x) {
        int num = 0;
        for (int y = 0; y < 3; ++y)
            num += s[R][x][y] - s[L - 1][x][y];
        for (int y = 0; y < 3; ++y)
            num -= s[R][y][x] - s[L - 1][y][x];
        if (num) return -1;
    }
    for (int x = 0; x < 3; ++x) {
        for (int y = x + 1; y < 3; ++y) {
            need += min(s[R][x][y] - s[L - 1][x][y], s[R][y][x] - s[L - 1][y][x]);
            rem += max(s[R][x][y] - s[L - 1][x][y], s[R][y][x] - s[L - 1][y][x]) - min(s[R][x][y] - s[L - 1][x][y], s[R][y][x] - s[L - 1][y][x]);
        }
    }
    need += rem * 2 / 3;
    return need;
}

//
//int main() {
//	int n, q;
//	assert(scanf("%d %d", &n, &q) == 2);
//	char A[n+1], B[n+1];
//	assert(scanf("%s", A) == 1);
//	assert(scanf("%s", B) == 1);
//	std::string a = std::string(A);
//	std::string b = std::string(B);
//	std::vector<int> x(q), y(q);
//	for (int i = 0; i < q; i++) {
//		assert(scanf("%d %d", &x[i], &y[i]) == 2);
//	}
//	fclose(stdin);
//	std::vector<int> results(q);
//	init(a, b);
//	for (int i = 0; i < q; i++) {
//		results[i] = get_distance(x[i], y[i]);
//	}
//	for (int i = 0; i < q; i++) {
//		printf("%d\n", results[i]);
//	}
//	fclose(stdout);
//	return 0;
//}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:26:29: warning: array subscript has type 'char' [-Wchar-subscripts]
   26 |         ++s[i][code[a[i - 1]]][code[b[i - 1]]];
      |                             ^
dna.cpp:26:45: warning: array subscript has type 'char' [-Wchar-subscripts]
   26 |         ++s[i][code[a[i - 1]]][code[b[i - 1]]];
      |                                             ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 5616 KB Output is correct
2 Correct 36 ms 5644 KB Output is correct
3 Correct 36 ms 5360 KB Output is correct
4 Correct 44 ms 5720 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 0 ms 212 KB Output is correct
4 Correct 4 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4316 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 4 ms 4308 KB Output is correct
9 Correct 4 ms 4308 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 0 ms 212 KB Output is correct
4 Correct 4 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4316 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 4 ms 4308 KB Output is correct
9 Correct 4 ms 4308 KB Output is correct
10 Correct 34 ms 5652 KB Output is correct
11 Correct 51 ms 5748 KB Output is correct
12 Correct 37 ms 5648 KB Output is correct
13 Correct 32 ms 5900 KB Output is correct
14 Correct 32 ms 5984 KB Output is correct
15 Correct 32 ms 5912 KB Output is correct
16 Correct 30 ms 5760 KB Output is correct
17 Correct 40 ms 5832 KB Output is correct
18 Correct 32 ms 5980 KB Output is correct
19 Correct 29 ms 5756 KB Output is correct
20 Correct 29 ms 5888 KB Output is correct
21 Correct 29 ms 6032 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 0 ms 212 KB Output is correct
4 Correct 4 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4316 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 4 ms 4308 KB Output is correct
9 Correct 4 ms 4308 KB Output is correct
10 Correct 5 ms 4036 KB Output is correct
11 Correct 4 ms 4308 KB Output is correct
12 Correct 3 ms 4052 KB Output is correct
13 Correct 4 ms 4308 KB Output is correct
14 Correct 4 ms 4308 KB Output is correct
15 Correct 4 ms 4308 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 5616 KB Output is correct
2 Correct 36 ms 5644 KB Output is correct
3 Correct 36 ms 5360 KB Output is correct
4 Correct 44 ms 5720 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 0 ms 212 KB Output is correct
11 Correct 4 ms 4308 KB Output is correct
12 Correct 3 ms 4308 KB Output is correct
13 Correct 3 ms 4316 KB Output is correct
14 Correct 3 ms 4052 KB Output is correct
15 Correct 4 ms 4308 KB Output is correct
16 Correct 4 ms 4308 KB Output is correct
17 Correct 34 ms 5652 KB Output is correct
18 Correct 51 ms 5748 KB Output is correct
19 Correct 37 ms 5648 KB Output is correct
20 Correct 32 ms 5900 KB Output is correct
21 Correct 32 ms 5984 KB Output is correct
22 Correct 32 ms 5912 KB Output is correct
23 Correct 30 ms 5760 KB Output is correct
24 Correct 40 ms 5832 KB Output is correct
25 Correct 32 ms 5980 KB Output is correct
26 Correct 29 ms 5756 KB Output is correct
27 Correct 29 ms 5888 KB Output is correct
28 Correct 29 ms 6032 KB Output is correct
29 Correct 5 ms 4036 KB Output is correct
30 Correct 4 ms 4308 KB Output is correct
31 Correct 3 ms 4052 KB Output is correct
32 Correct 4 ms 4308 KB Output is correct
33 Correct 4 ms 4308 KB Output is correct
34 Correct 4 ms 4308 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 35 ms 5332 KB Output is correct
37 Correct 33 ms 5664 KB Output is correct
38 Correct 32 ms 5724 KB Output is correct
39 Correct 34 ms 6024 KB Output is correct
40 Correct 44 ms 6012 KB Output is correct
41 Correct 5 ms 4308 KB Output is correct
42 Correct 30 ms 5848 KB Output is correct
43 Correct 30 ms 6032 KB Output is correct
44 Correct 30 ms 6024 KB Output is correct
45 Correct 29 ms 5756 KB Output is correct
46 Correct 30 ms 6024 KB Output is correct
47 Correct 33 ms 6072 KB Output is correct