oj.uz

Submission #689475

# Submission time Handle Problem Language Result Execution time Memory
689475 2023-01-28T14:55:11 Z coding_snorlax Mutating DNA (IOI21_dna) C++17
100 / 100
 36 ms 5548 KB 
#include<bits/stdc++.h>
#include "dna.h"
using namespace std;
#define pb push_back
vector<int> A_T={0},T_A={0},A_C={0},C_A={0},C_T={0},T_C={0};
void init(string a, string b){
    for(int i=0;i<(int)a.size();i++){
        A_T.pb(A_T.back());T_A.pb(T_A.back());A_C.pb(A_C.back());C_A.pb(C_A.back());C_T.pb(C_T.back());T_C.pb(T_C.back());
        if(a[i]=='A' && b[i]=='T'){
            A_T.back() = A_T.back()+1;
        }
        else if(a[i]=='T' && b[i]=='A'){
            T_A.back() = T_A.back()+1;
        }
        else if(a[i]=='A' && b[i]=='C'){
            A_C.back() = A_C.back()+1;
        }
        else if(a[i]=='C' && b[i]=='A'){
            C_A.back() = C_A.back()+1;
        }
        else if(a[i]=='C' && b[i]=='T'){
            C_T.back() = C_T.back()+1;
        }
        else if(a[i]=='T' && b[i]=='C'){
            T_C.back() = T_C.back()+1;
        }
    }
}
int get_distance(int x,int y){
    int a = A_T[y+1]-A_T[x] , b = T_A[y+1]-T_A[x] , c = A_C[y+1]-A_C[x], d= C_A[y+1]-C_A[x],e = C_T[y+1]-C_T[x],f=T_C[y+1]-T_C[x];
    if(a+c != b+d || b+f != a+e || d+e != c+f) return -1;
    else{
        int Count = min(a,b)+min(c,d)+min(e,f);
        return Count + (a+b+c+d+e+f-2*Count)*2 /3;
    }
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 5036 KB Output is correct
2 Correct 31 ms 5028 KB Output is correct
3 Correct 30 ms 4876 KB Output is correct
4 Correct 31 ms 5104 KB Output is correct
5 Correct 0 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 6 ms 3636 KB Output is correct
5 Correct 6 ms 3728 KB Output is correct
6 Correct 6 ms 3636 KB Output is correct
7 Correct 5 ms 3548 KB Output is correct
8 Correct 6 ms 3652 KB Output is correct
9 Correct 5 ms 3636 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 6 ms 3636 KB Output is correct
5 Correct 6 ms 3728 KB Output is correct
6 Correct 6 ms 3636 KB Output is correct
7 Correct 5 ms 3548 KB Output is correct
8 Correct 6 ms 3652 KB Output is correct
9 Correct 5 ms 3636 KB Output is correct
10 Correct 31 ms 5036 KB Output is correct
11 Correct 32 ms 5004 KB Output is correct
12 Correct 31 ms 5192 KB Output is correct
13 Correct 31 ms 5240 KB Output is correct
14 Correct 32 ms 5420 KB Output is correct
15 Correct 30 ms 5416 KB Output is correct
16 Correct 30 ms 5172 KB Output is correct
17 Correct 30 ms 5304 KB Output is correct
18 Correct 32 ms 5432 KB Output is correct
19 Correct 28 ms 5244 KB Output is correct
20 Correct 31 ms 5384 KB Output is correct
21 Correct 30 ms 5548 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 6 ms 3636 KB Output is correct
5 Correct 6 ms 3728 KB Output is correct
6 Correct 6 ms 3636 KB Output is correct
7 Correct 5 ms 3548 KB Output is correct
8 Correct 6 ms 3652 KB Output is correct
9 Correct 5 ms 3636 KB Output is correct
10 Correct 6 ms 3508 KB Output is correct
11 Correct 6 ms 3636 KB Output is correct
12 Correct 6 ms 3508 KB Output is correct
13 Correct 6 ms 3636 KB Output is correct
14 Correct 6 ms 3636 KB Output is correct
15 Correct 5 ms 3724 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 5036 KB Output is correct
2 Correct 31 ms 5028 KB Output is correct
3 Correct 30 ms 4876 KB Output is correct
4 Correct 31 ms 5104 KB Output is correct
5 Correct 0 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 6 ms 3636 KB Output is correct
12 Correct 6 ms 3728 KB Output is correct
13 Correct 6 ms 3636 KB Output is correct
14 Correct 5 ms 3548 KB Output is correct
15 Correct 6 ms 3652 KB Output is correct
16 Correct 5 ms 3636 KB Output is correct
17 Correct 31 ms 5036 KB Output is correct
18 Correct 32 ms 5004 KB Output is correct
19 Correct 31 ms 5192 KB Output is correct
20 Correct 31 ms 5240 KB Output is correct
21 Correct 32 ms 5420 KB Output is correct
22 Correct 30 ms 5416 KB Output is correct
23 Correct 30 ms 5172 KB Output is correct
24 Correct 30 ms 5304 KB Output is correct
25 Correct 32 ms 5432 KB Output is correct
26 Correct 28 ms 5244 KB Output is correct
27 Correct 31 ms 5384 KB Output is correct
28 Correct 30 ms 5548 KB Output is correct
29 Correct 6 ms 3508 KB Output is correct
30 Correct 6 ms 3636 KB Output is correct
31 Correct 6 ms 3508 KB Output is correct
32 Correct 6 ms 3636 KB Output is correct
33 Correct 6 ms 3636 KB Output is correct
34 Correct 5 ms 3724 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 33 ms 4860 KB Output is correct
37 Correct 30 ms 5044 KB Output is correct
38 Correct 31 ms 5244 KB Output is correct
39 Correct 34 ms 5376 KB Output is correct
40 Correct 31 ms 5412 KB Output is correct
41 Correct 4 ms 3636 KB Output is correct
42 Correct 36 ms 5260 KB Output is correct
43 Correct 33 ms 5432 KB Output is correct
44 Correct 30 ms 5464 KB Output is correct
45 Correct 29 ms 5260 KB Output is correct
46 Correct 28 ms 5412 KB Output is correct
47 Correct 29 ms 5468 KB Output is correct