oj.uz

Submission #838378

# Submission time Handle Problem Language Result Execution time Memory
838378 2023-08-26T18:08:12 Z ALeonidou Mutating DNA (IOI21_dna) C++17
100 / 100
 42 ms 6904 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

#define ll int
#define sz(x) (ll)x.size()
#define MID ((l+r)/2)
#define F first
#define S second
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;
#define pb push_back
#define ins insert
#define inf 1e9

typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;

void printVct(vi &v){
    for (ll i =0; i<sz(v); i++){
        cout<<v[i]<<" ";
    }
    cout<<endl;
}

vi a1,c1,a2,c2,f;
vi ac,ca,at,ta,tc,ct;

ll getRange(vi &v, ll l, ll r){
    if (l == 0) return v[r];
    return v[r] - v[l-1];
}

void init(string a, string b){
    ll n = sz(a);
    a1.resize(n),a2.resize(n),c1.resize(n),c2.resize(n),f.resize(n);
    ac.resize(n),ca.resize(n),ta.resize(n),at.resize(n),ct.resize(n),tc.resize(n);
    a1[0] = (a[0]=='A');
    a2[0] = (b[0]=='A');
    c1[0] = (a[0] == 'C');
    c2[0] = (b[0] == 'C');
    f[0] = (a[0] == b[0]);
    ac[0] = (a[0] == 'A' && b[0] == 'C');
    ca[0] = (a[0] == 'C' && b[0] == 'A');
    at[0] = (a[0] == 'A' && b[0] == 'T');
    ta[0] = (a[0] == 'T' && b[0] == 'A');
    ct[0] = (a[0] == 'C' && b[0] == 'T');
    tc[0] = (a[0] == 'T' && b[0] == 'C');
    for (ll i =1; i<n; i++){
        a1[i] = (a[i]=='A') + a1[i-1];
        a2[i] = (b[i]=='A') + a2[i-1];
        c1[i] = (a[i] == 'C') + c1[i-1];
        c2[i] = (b[i] == 'C') + c2[i-1];
        f[i] = (a[i] == b[i]) + f[i-1];
        ac[i] = (a[i] == 'A' && b[i] == 'C') + ac[i-1];
        ca[i] = (a[i] == 'C' && b[i] == 'A') + ca[i-1];
        at[i] = (a[i] == 'A' && b[i] == 'T') + at[i-1];
        ta[i] = (a[i] == 'T' && b[i] == 'A') + ta[i-1];
        ct[i] = (a[i] == 'C' && b[i] == 'T') + ct[i-1];
        tc[i] = (a[i] == 'T' && b[i] == 'C') + tc[i-1];
    }

    // printVct(a1);
    // printVct(a2);
    // printVct(c1);
    // printVct(c2);
    // printVct(f);
}

int get_distance(int x, int y) {
    if (getRange(a1,x,y) == getRange(a2,x,y) && getRange(c1,x,y) == getRange(c2,x,y)){
        ll range = y-x+1;
        ll dif = range - getRange(f, x,y);
        ll good = min(getRange(ac,x,y), getRange(ca,x,y)) + min(getRange(at,x,y), getRange(ta,x,y)) + min(getRange(tc,x,y), getRange(ct,x,y));
        ll bad = dif - good*2;
        ll ans = good + bad/3*2;
        // dbg(dif);
        // dbg3(good, bad, ans);
        return ans;
    }
	return -1;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 6412 KB Output is correct
2 Correct 34 ms 6504 KB Output is correct
3 Correct 31 ms 6056 KB Output is correct
4 Correct 34 ms 6400 KB Output is correct
5 Correct 1 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 8 ms 5076 KB Output is correct
5 Correct 8 ms 5204 KB Output is correct
6 Correct 8 ms 5100 KB Output is correct
7 Correct 8 ms 4820 KB Output is correct
8 Correct 8 ms 5204 KB Output is correct
9 Correct 9 ms 5220 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 8 ms 5076 KB Output is correct
5 Correct 8 ms 5204 KB Output is correct
6 Correct 8 ms 5100 KB Output is correct
7 Correct 8 ms 4820 KB Output is correct
8 Correct 8 ms 5204 KB Output is correct
9 Correct 9 ms 5220 KB Output is correct
10 Correct 32 ms 6392 KB Output is correct
11 Correct 36 ms 6476 KB Output is correct
12 Correct 33 ms 6400 KB Output is correct
13 Correct 34 ms 6548 KB Output is correct
14 Correct 33 ms 6844 KB Output is correct
15 Correct 33 ms 6808 KB Output is correct
16 Correct 33 ms 6512 KB Output is correct
17 Correct 33 ms 6624 KB Output is correct
18 Correct 41 ms 6824 KB Output is correct
19 Correct 31 ms 6484 KB Output is correct
20 Correct 32 ms 6652 KB Output is correct
21 Correct 33 ms 6904 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 8 ms 5076 KB Output is correct
5 Correct 8 ms 5204 KB Output is correct
6 Correct 8 ms 5100 KB Output is correct
7 Correct 8 ms 4820 KB Output is correct
8 Correct 8 ms 5204 KB Output is correct
9 Correct 9 ms 5220 KB Output is correct
10 Correct 8 ms 4812 KB Output is correct
11 Correct 8 ms 5220 KB Output is correct
12 Correct 9 ms 4912 KB Output is correct
13 Correct 8 ms 5204 KB Output is correct
14 Correct 8 ms 5204 KB Output is correct
15 Correct 8 ms 5204 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 6412 KB Output is correct
2 Correct 34 ms 6504 KB Output is correct
3 Correct 31 ms 6056 KB Output is correct
4 Correct 34 ms 6400 KB Output is correct
5 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 8 ms 5076 KB Output is correct
12 Correct 8 ms 5204 KB Output is correct
13 Correct 8 ms 5100 KB Output is correct
14 Correct 8 ms 4820 KB Output is correct
15 Correct 8 ms 5204 KB Output is correct
16 Correct 9 ms 5220 KB Output is correct
17 Correct 32 ms 6392 KB Output is correct
18 Correct 36 ms 6476 KB Output is correct
19 Correct 33 ms 6400 KB Output is correct
20 Correct 34 ms 6548 KB Output is correct
21 Correct 33 ms 6844 KB Output is correct
22 Correct 33 ms 6808 KB Output is correct
23 Correct 33 ms 6512 KB Output is correct
24 Correct 33 ms 6624 KB Output is correct
25 Correct 41 ms 6824 KB Output is correct
26 Correct 31 ms 6484 KB Output is correct
27 Correct 32 ms 6652 KB Output is correct
28 Correct 33 ms 6904 KB Output is correct
29 Correct 8 ms 4812 KB Output is correct
30 Correct 8 ms 5220 KB Output is correct
31 Correct 9 ms 4912 KB Output is correct
32 Correct 8 ms 5204 KB Output is correct
33 Correct 8 ms 5204 KB Output is correct
34 Correct 8 ms 5204 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 34 ms 6116 KB Output is correct
37 Correct 33 ms 6468 KB Output is correct
38 Correct 42 ms 6528 KB Output is correct
39 Correct 33 ms 6780 KB Output is correct
40 Correct 34 ms 6848 KB Output is correct
41 Correct 8 ms 5204 KB Output is correct
42 Correct 32 ms 6528 KB Output is correct
43 Correct 35 ms 6812 KB Output is correct
44 Correct 35 ms 6872 KB Output is correct
45 Correct 39 ms 6540 KB Output is correct
46 Correct 32 ms 6840 KB Output is correct
47 Correct 32 ms 6816 KB Output is correct