oj.uz

Submission #437745

# Submission time Handle Problem Language Result Execution time Memory
437745 2021-06-27T02:20:10 Z jh05013 Mutating DNA (IOI21_dna) C++17
100 / 100
 51 ms 5440 KB 
#include <bits/stdc++.h>
using namespace std;
const int MXN = 100100;
int zac[MXN], zat[MXN], zca[MXN], zct[MXN], zta[MXN], ztc[MXN];

void init(string a, string b){
    int n = a.size();
    for(int i=1; i<=n; i++){
        zac[i]+= zac[i-1], zat[i]+= zat[i-1];
        zca[i]+= zca[i-1], zct[i]+= zct[i-1];
        zta[i]+= zta[i-1], ztc[i]+= ztc[i-1];
        char A = a[i-1], B = b[i-1];
        if(A == 'A'){
            if(B == 'C') zac[i]++;
            if(B == 'T') zat[i]++;
        }
        if(A == 'C'){
            if(B == 'A') zca[i]++;
            if(B == 'T') zct[i]++;
        }
        if(A == 'T'){
            if(B == 'A') zta[i]++;
            if(B == 'C') ztc[i]++;
        }
    }
}

int get_distance(int x, int y){
    int qac = zac[y+1]-zac[x], qat = zat[y+1]-zat[x];
    int qca = zca[y+1]-zca[x], qct = zct[y+1]-zct[x];
    int qta = zta[y+1]-zta[x], qtc = ztc[y+1]-ztc[x];
    if(qac+qat != qca+qta) return -1;
    if(qca+qct != qac+qtc) return -1;
    if(qta+qtc != qat+qct) return -1;

    // correcting two letters per swap
    int acca = min(qac, qca);
    qac-= acca, qca-= acca;
    int atta = min(qat, qta);
    qat-= atta, qta-= atta;
    int cttc = min(qct, qtc);
    qct-= cttc, qtc-= cttc;
	return acca + atta + cttc + 2*max(qac, qca);
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 4908 KB Output is correct
2 Correct 45 ms 4988 KB Output is correct
3 Correct 39 ms 4720 KB Output is correct
4 Correct 41 ms 5000 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 3320 KB Output is correct
5 Correct 5 ms 3404 KB Output is correct
6 Correct 6 ms 3380 KB Output is correct
7 Correct 5 ms 3140 KB Output is correct
8 Correct 5 ms 3404 KB Output is correct
9 Correct 4 ms 3404 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 3320 KB Output is correct
5 Correct 5 ms 3404 KB Output is correct
6 Correct 6 ms 3380 KB Output is correct
7 Correct 5 ms 3140 KB Output is correct
8 Correct 5 ms 3404 KB Output is correct
9 Correct 4 ms 3404 KB Output is correct
10 Correct 39 ms 4992 KB Output is correct
11 Correct 40 ms 5012 KB Output is correct
12 Correct 41 ms 5192 KB Output is correct
13 Correct 39 ms 5256 KB Output is correct
14 Correct 40 ms 5376 KB Output is correct
15 Correct 38 ms 5296 KB Output is correct
16 Correct 51 ms 5224 KB Output is correct
17 Correct 38 ms 5224 KB Output is correct
18 Correct 38 ms 5388 KB Output is correct
19 Correct 35 ms 5264 KB Output is correct
20 Correct 35 ms 5288 KB Output is correct
21 Correct 48 ms 5364 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 3320 KB Output is correct
5 Correct 5 ms 3404 KB Output is correct
6 Correct 6 ms 3380 KB Output is correct
7 Correct 5 ms 3140 KB Output is correct
8 Correct 5 ms 3404 KB Output is correct
9 Correct 4 ms 3404 KB Output is correct
10 Correct 5 ms 3148 KB Output is correct
11 Correct 5 ms 3404 KB Output is correct
12 Correct 5 ms 3148 KB Output is correct
13 Correct 5 ms 3404 KB Output is correct
14 Correct 5 ms 3404 KB Output is correct
15 Correct 4 ms 3328 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 4908 KB Output is correct
2 Correct 45 ms 4988 KB Output is correct
3 Correct 39 ms 4720 KB Output is correct
4 Correct 41 ms 5000 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 6 ms 3320 KB Output is correct
12 Correct 5 ms 3404 KB Output is correct
13 Correct 6 ms 3380 KB Output is correct
14 Correct 5 ms 3140 KB Output is correct
15 Correct 5 ms 3404 KB Output is correct
16 Correct 4 ms 3404 KB Output is correct
17 Correct 39 ms 4992 KB Output is correct
18 Correct 40 ms 5012 KB Output is correct
19 Correct 41 ms 5192 KB Output is correct
20 Correct 39 ms 5256 KB Output is correct
21 Correct 40 ms 5376 KB Output is correct
22 Correct 38 ms 5296 KB Output is correct
23 Correct 51 ms 5224 KB Output is correct
24 Correct 38 ms 5224 KB Output is correct
25 Correct 38 ms 5388 KB Output is correct
26 Correct 35 ms 5264 KB Output is correct
27 Correct 35 ms 5288 KB Output is correct
28 Correct 48 ms 5364 KB Output is correct
29 Correct 5 ms 3148 KB Output is correct
30 Correct 5 ms 3404 KB Output is correct
31 Correct 5 ms 3148 KB Output is correct
32 Correct 5 ms 3404 KB Output is correct
33 Correct 5 ms 3404 KB Output is correct
34 Correct 4 ms 3328 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 39 ms 4708 KB Output is correct
37 Correct 47 ms 4972 KB Output is correct
38 Correct 41 ms 5248 KB Output is correct
39 Correct 40 ms 5372 KB Output is correct
40 Correct 39 ms 5380 KB Output is correct
41 Correct 4 ms 3404 KB Output is correct
42 Correct 39 ms 5228 KB Output is correct
43 Correct 38 ms 5376 KB Output is correct
44 Correct 37 ms 5352 KB Output is correct
45 Correct 37 ms 5260 KB Output is correct
46 Correct 46 ms 5440 KB Output is correct
47 Correct 36 ms 5380 KB Output is correct