oj.uz

Submission #734142

# Submission time Handle Problem Language Result Execution time Memory
734142 2023-05-01T22:43:08 Z JakobZorz Mutating DNA (IOI21_dna) C++17
100 / 100
 43 ms 6084 KB 
#include "dna.h"
#include <iostream>

int sum[100001][3][3];

int get(char c) {
    if(c == 'C')
        return 0;
    if(c == 'A')
        return 1;
    return 2;
}

void init(std::string a, std::string b) {
    for(int i = 0; i < (int)a.size(); i++) {
        //std::cout << get(a[i]) << " " << get(b[i]) << std::endl;
        
        for(int t1 = 0; t1 < 3; t1++) {
            for(int t2 = 0; t2 < 3; t2++) {
                sum[i + 1][t1][t2] = sum[i][t1][t2];
            }
        }
        
        sum[i + 1][get(a[i])][get(b[i])]++;
    }
}

/*
   
   0  1  2
 0 {} [] []
 1 [] {} []
 2 [] [] {}
 
    a b    b a
    b a -> b a
 
    a b c    a b c
    b c a -> a b c
 
 */

int get_distance(int x, int y) {
    int curr[3][3];
    
    for(int t1 = 0; t1 < 3; t1++) {
        for(int t2 = 0; t2 < 3; t2++) {
            curr[t1][t2] = sum[y + 1][t1][t2] - sum[x][t1][t2];
        }
    }
    
    for(int t = 0; t < 3; t++)
        curr[t][t] = 0;
    
    /*std::cout << curr[0][0] << " " << curr[1][0] << " " << curr[2][0] << std::endl;
    std::cout << curr[0][1] << " " << curr[1][1] << " " << curr[2][1] << std::endl;
    std::cout << curr[0][2] << " " << curr[1][2] << " " << curr[2][2] << std::endl;*/
    
    int r = 0;
    for(int t1 = 0; t1 < 3; t1++) {
        for(int t2 = 0; t2 < 3; t2++) {
            if(t1 != t2) {
                int m = std::min(curr[t1][t2], curr[t2][t1]);
                r += m;
                curr[t1][t2] -= m;
                curr[t2][t1] -= m;
            }
        }
    }
    
    for(int t1 = 0; t1 < 3; t1++) {
        for(int t2 = 0; t2 < 3; t2++) {
            for(int t3 = 0; t3 < 3; t3++) {
                if(t1 != t2 && t2 != t3 && t1 != t3) {
                    int m = std::min(curr[t1][t2], std::min(curr[t2][t3], curr[t3][t1]));
                    r += 2 * m;
                    curr[t1][t2] -= m;
                    curr[t2][t3] -= m;
                    curr[t3][t1] -= m;
                }
            }
        }
    }
    
    for(int t1 = 0; t1 < 3; t1++) {
        for(int t2 = 0; t2 < 3; t2++) {
            if(curr[t1][t2] != 0)
                return -1;
        }
    }
    
	return r;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 5644 KB Output is correct
2 Correct 35 ms 5632 KB Output is correct
3 Correct 35 ms 5276 KB Output is correct
4 Correct 36 ms 5692 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 4 ms 4308 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 4 ms 4308 KB Output is correct
10 Correct 40 ms 5632 KB Output is correct
11 Correct 40 ms 5688 KB Output is correct
12 Correct 37 ms 5748 KB Output is correct
13 Correct 37 ms 5764 KB Output is correct
14 Correct 36 ms 6024 KB Output is correct
15 Correct 36 ms 5892 KB Output is correct
16 Correct 35 ms 5760 KB Output is correct
17 Correct 36 ms 5888 KB Output is correct
18 Correct 36 ms 6020 KB Output is correct
19 Correct 33 ms 5784 KB Output is correct
20 Correct 34 ms 5972 KB Output is correct
21 Correct 33 ms 6084 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 4308 KB Output is correct
5 Correct 4 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 4 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 4 ms 4308 KB Output is correct
10 Correct 4 ms 4052 KB Output is correct
11 Correct 4 ms 4308 KB Output is correct
12 Correct 3 ms 4052 KB Output is correct
13 Correct 4 ms 4308 KB Output is correct
14 Correct 4 ms 4308 KB Output is correct
15 Correct 3 ms 4308 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 5644 KB Output is correct
2 Correct 35 ms 5632 KB Output is correct
3 Correct 35 ms 5276 KB Output is correct
4 Correct 36 ms 5692 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 5 ms 4308 KB Output is correct
12 Correct 4 ms 4308 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 4 ms 4052 KB Output is correct
15 Correct 3 ms 4308 KB Output is correct
16 Correct 4 ms 4308 KB Output is correct
17 Correct 40 ms 5632 KB Output is correct
18 Correct 40 ms 5688 KB Output is correct
19 Correct 37 ms 5748 KB Output is correct
20 Correct 37 ms 5764 KB Output is correct
21 Correct 36 ms 6024 KB Output is correct
22 Correct 36 ms 5892 KB Output is correct
23 Correct 35 ms 5760 KB Output is correct
24 Correct 36 ms 5888 KB Output is correct
25 Correct 36 ms 6020 KB Output is correct
26 Correct 33 ms 5784 KB Output is correct
27 Correct 34 ms 5972 KB Output is correct
28 Correct 33 ms 6084 KB Output is correct
29 Correct 4 ms 4052 KB Output is correct
30 Correct 4 ms 4308 KB Output is correct
31 Correct 3 ms 4052 KB Output is correct
32 Correct 4 ms 4308 KB Output is correct
33 Correct 4 ms 4308 KB Output is correct
34 Correct 3 ms 4308 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 43 ms 5300 KB Output is correct
37 Correct 39 ms 5628 KB Output is correct
38 Correct 40 ms 5788 KB Output is correct
39 Correct 39 ms 6024 KB Output is correct
40 Correct 36 ms 6040 KB Output is correct
41 Correct 3 ms 4308 KB Output is correct
42 Correct 35 ms 5728 KB Output is correct
43 Correct 35 ms 6024 KB Output is correct
44 Correct 34 ms 6036 KB Output is correct
45 Correct 33 ms 5772 KB Output is correct
46 Correct 34 ms 6024 KB Output is correct
47 Correct 33 ms 6028 KB Output is correct