oj.uz

Submission #852872

# Submission time Handle Problem Language Result Execution time Memory
852872 2023-09-23T02:47:16 Z hngwlog Mutating DNA (IOI21_dna) C++17
100 / 100
 83 ms 22596 KB 
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;

#define fi first
#define se second
#define _size(x) (int)x.size()
#define BIT(i, x) ((x >> i) & 1)
#define MASK(n) ((1 << n) - 1)
#define REP(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define FOR(i, a, b) for (int i = a, _b = (b); i <= _b; i++)
#define FORD(i, a, b) for (int i = a, _b = (b); i >= _b; i--)
#define FORB1(i, mask) for (int i = mask; i > 0; i ^= i & - i)
#define FORB0(i, n, mask) for (int i = ((1 << n) - 1) ^ mask; i > 0; i ^= i & - i)
#define FORALL(i, a) for (auto i: a)
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);

vector<vector<vector<int>>> f;

void init(string a, string b) {

    int n = _size(a);
    vector<int> chA(n + 1), chB(n + 1);
    f.resize(n + 1, vector<vector<int>>(3, vector<int>(3)));
    FOR(i, 1, n) {
        if (a[i - 1] == 'A') chA[i] = 0;
        else if (a[i - 1] == 'T') chA[i] = 1;
        else chA[i] = 2;
        if (b[i - 1] == 'A') chB[i] = 0;
        else if (b[i - 1] == 'T') chB[i] = 1;
        else chB[i] = 2;
        REP(j, 3) REP(z, 3) f[i][j][z] = f[i - 1][j][z];
        f[i][chA[i]][chB[i]]++;
    }

}

int get_distance(int x, int y) {

    x++, y++;
    vector<vector<int>> g(3, vector<int>(3));
    REP(i, 3) REP(j, 3) g[i][j] = f[y][i][j] - f[x - 1][i][j];
    int ans = 0;
    REP(i, 3) REP(j, 3) {
        int value = min(g[i][j], g[j][i]);
        g[i][j] -= value;
        if (i == j) continue;
        g[j][i] -= value;
        ans += value;
    }
    vector<pair<int, int>> vtx;
    REP(i, 3) REP(j, 3) if (g[i][j]) vtx.push_back({i, j});
    if (!_size(vtx)) return ans;
    if (_size(vtx) != 3) return - 1;
    int value = g[vtx[0].fi][vtx[0].se];
    FORALL(e, vtx) if (g[e.fi][e.se] != value) return - 1;
    FORALL(p, vtx) FORALL(q, vtx) {
        if (p == q) continue;
        if (p.fi == q.fi) return - 1;
        int cnt = (p.fi == q.se) + (p.se == q.fi) + (p.se == q.se);
        if (cnt != 1) return - 1;
    }
    return ans + value * 2;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 22096 KB Output is correct
2 Correct 62 ms 22352 KB Output is correct
3 Correct 58 ms 20568 KB Output is correct
4 Correct 61 ms 22348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 22 ms 21080 KB Output is correct
5 Correct 24 ms 21336 KB Output is correct
6 Correct 23 ms 21336 KB Output is correct
7 Correct 20 ms 19804 KB Output is correct
8 Correct 23 ms 21336 KB Output is correct
9 Correct 21 ms 21336 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 22 ms 21080 KB Output is correct
5 Correct 24 ms 21336 KB Output is correct
6 Correct 23 ms 21336 KB Output is correct
7 Correct 20 ms 19804 KB Output is correct
8 Correct 23 ms 21336 KB Output is correct
9 Correct 21 ms 21336 KB Output is correct
10 Correct 69 ms 22080 KB Output is correct
11 Correct 62 ms 22312 KB Output is correct
12 Correct 71 ms 21028 KB Output is correct
13 Correct 65 ms 21584 KB Output is correct
14 Correct 68 ms 22356 KB Output is correct
15 Correct 70 ms 22352 KB Output is correct
16 Correct 60 ms 21076 KB Output is correct
17 Correct 66 ms 21592 KB Output is correct
18 Correct 65 ms 22352 KB Output is correct
19 Correct 55 ms 21072 KB Output is correct
20 Correct 54 ms 21592 KB Output is correct
21 Correct 55 ms 22348 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 22 ms 21080 KB Output is correct
5 Correct 24 ms 21336 KB Output is correct
6 Correct 23 ms 21336 KB Output is correct
7 Correct 20 ms 19804 KB Output is correct
8 Correct 23 ms 21336 KB Output is correct
9 Correct 21 ms 21336 KB Output is correct
10 Correct 19 ms 19544 KB Output is correct
11 Correct 24 ms 21240 KB Output is correct
12 Correct 19 ms 19804 KB Output is correct
13 Correct 21 ms 21080 KB Output is correct
14 Correct 20 ms 21336 KB Output is correct
15 Correct 21 ms 21336 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 22096 KB Output is correct
2 Correct 62 ms 22352 KB Output is correct
3 Correct 58 ms 20568 KB Output is correct
4 Correct 61 ms 22348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 500 KB Output is correct
11 Correct 22 ms 21080 KB Output is correct
12 Correct 24 ms 21336 KB Output is correct
13 Correct 23 ms 21336 KB Output is correct
14 Correct 20 ms 19804 KB Output is correct
15 Correct 23 ms 21336 KB Output is correct
16 Correct 21 ms 21336 KB Output is correct
17 Correct 69 ms 22080 KB Output is correct
18 Correct 62 ms 22312 KB Output is correct
19 Correct 71 ms 21028 KB Output is correct
20 Correct 65 ms 21584 KB Output is correct
21 Correct 68 ms 22356 KB Output is correct
22 Correct 70 ms 22352 KB Output is correct
23 Correct 60 ms 21076 KB Output is correct
24 Correct 66 ms 21592 KB Output is correct
25 Correct 65 ms 22352 KB Output is correct
26 Correct 55 ms 21072 KB Output is correct
27 Correct 54 ms 21592 KB Output is correct
28 Correct 55 ms 22348 KB Output is correct
29 Correct 19 ms 19544 KB Output is correct
30 Correct 24 ms 21240 KB Output is correct
31 Correct 19 ms 19804 KB Output is correct
32 Correct 21 ms 21080 KB Output is correct
33 Correct 20 ms 21336 KB Output is correct
34 Correct 21 ms 21336 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 58 ms 20568 KB Output is correct
37 Correct 83 ms 22356 KB Output is correct
38 Correct 70 ms 21080 KB Output is correct
39 Correct 77 ms 22352 KB Output is correct
40 Correct 76 ms 22352 KB Output is correct
41 Correct 21 ms 21336 KB Output is correct
42 Correct 67 ms 21068 KB Output is correct
43 Correct 77 ms 22360 KB Output is correct
44 Correct 69 ms 22452 KB Output is correct
45 Correct 61 ms 21104 KB Output is correct
46 Correct 64 ms 22596 KB Output is correct
47 Correct 66 ms 22352 KB Output is correct