oj.uz

Submission #444171

# Submission time Handle Problem Language Result Execution time Memory
444171 2021-07-13T08:48:54 Z urd05 Mutating DNA (IOI21_dna) C++17
100 / 100
 47 ms 9756 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

int asum[3][100001];
int bsum[3][100001];
int c[3]={'A','T','C'};
int atc[9][100001];

void init(string a, string b) {
    int n=a.size();
    for(int i=1;i<=n;i++) {
        for(int j=0;j<3;j++) {
            if (a[i-1]==c[j]) {
                asum[j][i]=asum[j][i-1]+1;
            }
            else {
                asum[j][i]=asum[j][i-1];
            }
            if (b[i-1]==c[j]) {
                bsum[j][i]=bsum[j][i-1]+1;
            }
            else {
                bsum[j][i]=bsum[j][i-1];
            }
        }
    }
    for(int i=1;i<=n;i++) {
        int val=0;
        for(int j=0;j<3;j++) {
            if (a[i-1]==c[j]) {
                val+=j*3;
            }
            if (b[i-1]==c[j]) {
                val+=j;
            }
        }
        for(int j=0;j<9;j++) {
            atc[j][i]=atc[j][i-1]+(val==j);
        }
    }
}

int get_distance(int x, int y) {
    x++;
    y++;
    for(int j=0;j<3;j++) {
        if (asum[j][y]-asum[j][x-1]!=bsum[j][y]-bsum[j][x-1]) {
            return -1;
        }
    }
	int AT=atc[1][y]-atc[1][x-1];
	int TA=atc[3][y]-atc[3][x-1];
	int AC=atc[2][y]-atc[2][x-1];
	int CA=atc[6][y]-atc[6][x-1];
	int TC=atc[5][y]-atc[5][x-1];
	int CT=atc[7][y]-atc[7][x-1];
	return min(AT,TA)+min(AC,CA)+min(TC,CT)+max(AT-TA,TA-AT)*2;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 9348 KB Output is correct
2 Correct 46 ms 9352 KB Output is correct
3 Correct 42 ms 8808 KB Output is correct
4 Correct 43 ms 9344 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 7 ms 6840 KB Output is correct
5 Correct 7 ms 6860 KB Output is correct
6 Correct 7 ms 6920 KB Output is correct
7 Correct 7 ms 6476 KB Output is correct
8 Correct 7 ms 6840 KB Output is correct
9 Correct 6 ms 6860 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 7 ms 6840 KB Output is correct
5 Correct 7 ms 6860 KB Output is correct
6 Correct 7 ms 6920 KB Output is correct
7 Correct 7 ms 6476 KB Output is correct
8 Correct 7 ms 6840 KB Output is correct
9 Correct 6 ms 6860 KB Output is correct
10 Correct 44 ms 9392 KB Output is correct
11 Correct 45 ms 9280 KB Output is correct
12 Correct 44 ms 9228 KB Output is correct
13 Correct 44 ms 9452 KB Output is correct
14 Correct 44 ms 9756 KB Output is correct
15 Correct 44 ms 9628 KB Output is correct
16 Correct 40 ms 9156 KB Output is correct
17 Correct 40 ms 9356 KB Output is correct
18 Correct 41 ms 9576 KB Output is correct
19 Correct 39 ms 9232 KB Output is correct
20 Correct 40 ms 9356 KB Output is correct
21 Correct 40 ms 9692 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 7 ms 6840 KB Output is correct
5 Correct 7 ms 6860 KB Output is correct
6 Correct 7 ms 6920 KB Output is correct
7 Correct 7 ms 6476 KB Output is correct
8 Correct 7 ms 6840 KB Output is correct
9 Correct 6 ms 6860 KB Output is correct
10 Correct 6 ms 6404 KB Output is correct
11 Correct 7 ms 6836 KB Output is correct
12 Correct 6 ms 6476 KB Output is correct
13 Correct 7 ms 6852 KB Output is correct
14 Correct 7 ms 6860 KB Output is correct
15 Correct 6 ms 6848 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 9348 KB Output is correct
2 Correct 46 ms 9352 KB Output is correct
3 Correct 42 ms 8808 KB Output is correct
4 Correct 43 ms 9344 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 7 ms 6840 KB Output is correct
12 Correct 7 ms 6860 KB Output is correct
13 Correct 7 ms 6920 KB Output is correct
14 Correct 7 ms 6476 KB Output is correct
15 Correct 7 ms 6840 KB Output is correct
16 Correct 6 ms 6860 KB Output is correct
17 Correct 44 ms 9392 KB Output is correct
18 Correct 45 ms 9280 KB Output is correct
19 Correct 44 ms 9228 KB Output is correct
20 Correct 44 ms 9452 KB Output is correct
21 Correct 44 ms 9756 KB Output is correct
22 Correct 44 ms 9628 KB Output is correct
23 Correct 40 ms 9156 KB Output is correct
24 Correct 40 ms 9356 KB Output is correct
25 Correct 41 ms 9576 KB Output is correct
26 Correct 39 ms 9232 KB Output is correct
27 Correct 40 ms 9356 KB Output is correct
28 Correct 40 ms 9692 KB Output is correct
29 Correct 6 ms 6404 KB Output is correct
30 Correct 7 ms 6836 KB Output is correct
31 Correct 6 ms 6476 KB Output is correct
32 Correct 7 ms 6852 KB Output is correct
33 Correct 7 ms 6860 KB Output is correct
34 Correct 6 ms 6848 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 47 ms 8804 KB Output is correct
37 Correct 44 ms 9344 KB Output is correct
38 Correct 44 ms 9320 KB Output is correct
39 Correct 45 ms 9728 KB Output is correct
40 Correct 44 ms 9728 KB Output is correct
41 Correct 6 ms 6956 KB Output is correct
42 Correct 43 ms 9316 KB Output is correct
43 Correct 41 ms 9560 KB Output is correct
44 Correct 41 ms 9604 KB Output is correct
45 Correct 39 ms 9312 KB Output is correct
46 Correct 39 ms 9596 KB Output is correct
47 Correct 39 ms 9580 KB Output is correct