Submission #444862

# Submission time Handle Problem Language Result Execution time Memory
444862 2021-07-15T16:10:29 Z apostoldaniel854 Mutating DNA (IOI21_dna) C++17
100 / 100
57 ms 7396 KB
#include "dna.h"
#include <map>
#include <vector>
#include <bits/stdc++.h>
using ll = long long;
#define dbg(x) std::cerr << #x << " " << x << "\n"

const int MAX_N = 1e5;
int sum[MAX_N][3][3];

void init(std::string a, std::string b) {
    std::map <char, int> mp;
    mp['A'] = 0, mp['C'] = 1, mp['T'] = 2;
    int n = a.size ();
    for (int i = 0; i < n; i++) {
        if (i > 0) {
            for (int j = 0; j < 3; j++)
                for (int k = 0; k < 3; k++)
                    sum[i][j][k] += sum[i - 1][j][k];
        }
        sum[i][mp[a[i]]][mp[b[i]]]++;
    }
}

int cnt[3][3];
int get_distance(int x, int y) {
    std::vector <int> freqA (3, 0), freqB (3, 0);
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            cnt[i][j] = sum[y][i][j];
            if (x > 0) {
                cnt[i][j] -= sum[x - 1][i][j];
            }
   //         dbg (i); dbg (j); dbg (cnt[i][j]);
            freqA[i] += cnt[i][j];
            freqB[j] += cnt[i][j];
        }
    }
    for (int i = 0; i < 3; i++)
        if (freqA[i] != freqB[i])
            return -1;
    int ans = 0;
    for (int i = 0; i < 3; i++) {
        for (int j = i + 1; j < 3; j++) {
            int sub = std::min (cnt[i][j], cnt[j][i]);
            ans += sub;
            cnt[i][j] -= sub;
            cnt[j][i] -= sub;
        }
    }
    int to_add = 0;
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            if (i != j && cnt[i][j]) {
                to_add = cnt[i][j];
            }
        }
    }
    ans += 2 * to_add;
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 47 ms 6916 KB Output is correct
2 Correct 47 ms 6976 KB Output is correct
3 Correct 48 ms 6616 KB Output is correct
4 Correct 48 ms 7048 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 4428 KB Output is correct
5 Correct 6 ms 4564 KB Output is correct
6 Correct 6 ms 4540 KB Output is correct
7 Correct 6 ms 4300 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 4428 KB Output is correct
5 Correct 6 ms 4564 KB Output is correct
6 Correct 6 ms 4540 KB Output is correct
7 Correct 6 ms 4300 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct
10 Correct 49 ms 6896 KB Output is correct
11 Correct 47 ms 6952 KB Output is correct
12 Correct 46 ms 7008 KB Output is correct
13 Correct 47 ms 7176 KB Output is correct
14 Correct 47 ms 7280 KB Output is correct
15 Correct 45 ms 7332 KB Output is correct
16 Correct 44 ms 6976 KB Output is correct
17 Correct 45 ms 7052 KB Output is correct
18 Correct 45 ms 7268 KB Output is correct
19 Correct 43 ms 7008 KB Output is correct
20 Correct 57 ms 7144 KB Output is correct
21 Correct 42 ms 7296 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 4428 KB Output is correct
5 Correct 6 ms 4564 KB Output is correct
6 Correct 6 ms 4540 KB Output is correct
7 Correct 6 ms 4300 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct
10 Correct 5 ms 4172 KB Output is correct
11 Correct 6 ms 4556 KB Output is correct
12 Correct 6 ms 4300 KB Output is correct
13 Correct 6 ms 4536 KB Output is correct
14 Correct 6 ms 4556 KB Output is correct
15 Correct 5 ms 4556 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 47 ms 6916 KB Output is correct
2 Correct 47 ms 6976 KB Output is correct
3 Correct 48 ms 6616 KB Output is correct
4 Correct 48 ms 7048 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 6 ms 4428 KB Output is correct
12 Correct 6 ms 4564 KB Output is correct
13 Correct 6 ms 4540 KB Output is correct
14 Correct 6 ms 4300 KB Output is correct
15 Correct 6 ms 4556 KB Output is correct
16 Correct 5 ms 4556 KB Output is correct
17 Correct 49 ms 6896 KB Output is correct
18 Correct 47 ms 6952 KB Output is correct
19 Correct 46 ms 7008 KB Output is correct
20 Correct 47 ms 7176 KB Output is correct
21 Correct 47 ms 7280 KB Output is correct
22 Correct 45 ms 7332 KB Output is correct
23 Correct 44 ms 6976 KB Output is correct
24 Correct 45 ms 7052 KB Output is correct
25 Correct 45 ms 7268 KB Output is correct
26 Correct 43 ms 7008 KB Output is correct
27 Correct 57 ms 7144 KB Output is correct
28 Correct 42 ms 7296 KB Output is correct
29 Correct 5 ms 4172 KB Output is correct
30 Correct 6 ms 4556 KB Output is correct
31 Correct 6 ms 4300 KB Output is correct
32 Correct 6 ms 4536 KB Output is correct
33 Correct 6 ms 4556 KB Output is correct
34 Correct 5 ms 4556 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 46 ms 6648 KB Output is correct
37 Correct 49 ms 7020 KB Output is correct
38 Correct 47 ms 7104 KB Output is correct
39 Correct 51 ms 7396 KB Output is correct
40 Correct 47 ms 7348 KB Output is correct
41 Correct 4 ms 4556 KB Output is correct
42 Correct 45 ms 7040 KB Output is correct
43 Correct 46 ms 7296 KB Output is correct
44 Correct 44 ms 7272 KB Output is correct
45 Correct 55 ms 6964 KB Output is correct
46 Correct 43 ms 7296 KB Output is correct
47 Correct 44 ms 7280 KB Output is correct