oj.uz

Submission #725623

# Submission time Handle Problem Language Result Execution time Memory
725623 2023-04-17T19:01:46 Z svorogaze Mutating DNA (IOI21_dna) C++17
56 / 100
 45 ms 6576 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, std::greater<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define fastio std::cin.tie(0), std::cout.tie(0), std::ios_base::sync_with_stdio(false)
#define rep(a, b, c, d) for (int a = b; a < c; a += d)
#define INF ((1ll << 62) - 1)
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
using namespace std;
#define MN 200000
//#define int long long
#define mod (long long)(1e9 + 7)
#define mod2 (long long)(1000004099ll)
//#define int unsigned long long
//#define int long long
vector<int> aac, acc, atc;
vector<int> cor;

vector<int> bac, bcc, btc;

int gt(int pos, vector<int>& v) {
    if (pos < 0) return 0;
    return v[pos];
}

int gs(int l, int r, vector<int>& v) {
    return gt(r, v) - gt(l - 1, v);
}

int get_distance(int x, int y) {
    if (gs(x, y, aac) != gs(x, y, bac) || gs(x, y, acc) != gs(x, y, bcc) || gs(x, y, atc) != gs(x, y, btc)) {
        return -1;
    }
    return ((y - x + 1) - gs(x, y, cor) + 1) / 2;
}


void init(string a, string b) {
    int n = a.size();
    cor.resize(n);
    aac.resize(n), acc.resize(n), atc.resize(n);
    bac.resize(n), bcc.resize(n), btc.resize(n);
    for (int i = 0; i < n; ++i) {
        aac[i] = gt(i - 1, aac);
        acc[i] = gt(i - 1, acc);
        atc[i] = gt(i - 1, atc);
        if (a[i] == 'A') {
            aac[i]++;
        } else if (a[i] == 'T') {
            atc[i]++;
        } else {
            acc[i]++;
        }
    }
    for (int i = 0; i < n; ++i) {
        bac[i] = gt(i - 1, bac);
        bcc[i] = gt(i - 1, bcc);
        btc[i] = gt(i - 1, btc);
        if (b[i] == 'A') {
            bac[i]++;
        } else if (b[i] == 'T') {
            btc[i]++;
        } else {
            bcc[i]++;
        }
    }
    for (int i = 0; i < n; ++i) {
        cor[i] = gt(i - 1, cor);
        if (a[i] == b[i]) {
            cor[i]++;
        }
    }
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 6128 KB Output is correct
2 Correct 32 ms 6208 KB Output is correct
3 Correct 45 ms 5888 KB Output is correct
4 Correct 34 ms 6280 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 3796 KB Output is correct
5 Correct 5 ms 3796 KB Output is correct
6 Correct 5 ms 3796 KB Output is correct
7 Correct 4 ms 3512 KB Output is correct
8 Correct 5 ms 3796 KB Output is correct
9 Correct 5 ms 3764 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 3796 KB Output is correct
5 Correct 5 ms 3796 KB Output is correct
6 Correct 5 ms 3796 KB Output is correct
7 Correct 4 ms 3512 KB Output is correct
8 Correct 5 ms 3796 KB Output is correct
9 Correct 5 ms 3764 KB Output is correct
10 Correct 32 ms 6252 KB Output is correct
11 Correct 32 ms 6260 KB Output is correct
12 Correct 32 ms 6296 KB Output is correct
13 Correct 33 ms 6384 KB Output is correct
14 Correct 34 ms 6576 KB Output is correct
15 Correct 32 ms 6516 KB Output is correct
16 Correct 33 ms 6216 KB Output is correct
17 Correct 44 ms 6296 KB Output is correct
18 Correct 31 ms 6496 KB Output is correct
19 Correct 29 ms 6204 KB Output is correct
20 Correct 32 ms 6388 KB Output is correct
21 Correct 35 ms 6536 KB Output is correct

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 3796 KB Output is correct
5 Correct 5 ms 3796 KB Output is correct
6 Correct 5 ms 3796 KB Output is correct
7 Correct 4 ms 3512 KB Output is correct
8 Correct 5 ms 3796 KB Output is correct
9 Correct 5 ms 3764 KB Output is correct
10 Correct 4 ms 3540 KB Output is correct
11 Correct 5 ms 3796 KB Output is correct
12 Incorrect 4 ms 3540 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 6128 KB Output is correct
2 Correct 32 ms 6208 KB Output is correct
3 Correct 45 ms 5888 KB Output is correct
4 Correct 34 ms 6280 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 3796 KB Output is correct
12 Correct 5 ms 3796 KB Output is correct
13 Correct 5 ms 3796 KB Output is correct
14 Correct 4 ms 3512 KB Output is correct
15 Correct 5 ms 3796 KB Output is correct
16 Correct 5 ms 3764 KB Output is correct
17 Correct 32 ms 6252 KB Output is correct
18 Correct 32 ms 6260 KB Output is correct
19 Correct 32 ms 6296 KB Output is correct
20 Correct 33 ms 6384 KB Output is correct
21 Correct 34 ms 6576 KB Output is correct
22 Correct 32 ms 6516 KB Output is correct
23 Correct 33 ms 6216 KB Output is correct
24 Correct 44 ms 6296 KB Output is correct
25 Correct 31 ms 6496 KB Output is correct
26 Correct 29 ms 6204 KB Output is correct
27 Correct 32 ms 6388 KB Output is correct
28 Correct 35 ms 6536 KB Output is correct
29 Correct 4 ms 3540 KB Output is correct
30 Correct 5 ms 3796 KB Output is correct
31 Incorrect 4 ms 3540 KB Output isn't correct
32 Halted 0 ms 0 KB -