Submission #689474

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
689474	2023-01-28T14:51:12 Z	coding_snorlax	Mutating DNA (IOI21_dna)	C++17	100 / 100	35 ms	5428 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++){
        if(a[i]=='A' && b[i]=='T'){
            A_T.pb(A_T.back()+1);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());
        }
        else if(a[i]=='T' && b[i]=='A'){
            A_T.pb(A_T.back());T_A.pb(T_A.back()+1);A_C.pb(A_C.back());
            C_A.pb(C_A.back());C_T.pb(C_T.back());T_C.pb(T_C.back());
        }
        else if(a[i]=='A' && b[i]=='C'){
            A_T.pb(A_T.back());T_A.pb(T_A.back());A_C.pb(A_C.back()+1);
            C_A.pb(C_A.back());C_T.pb(C_T.back());T_C.pb(T_C.back());
        }
        else if(a[i]=='C' && b[i]=='A'){
            A_T.pb(A_T.back());T_A.pb(T_A.back());A_C.pb(A_C.back());
            C_A.pb(C_A.back()+1);C_T.pb(C_T.back());T_C.pb(T_C.back());
        }
        else if(a[i]=='C' && b[i]=='T'){
            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()+1);T_C.pb(T_C.back());
        }
        else if(a[i]=='T' && b[i]=='C'){
            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()+1);
        }
        else{
            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());

        }
        //cout<<" "<<A_T.size()<<" "<<i<<"\n";
    }
    //cout<<A_T.size()<<" ";
}
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];
    //cout << a << " "<<b<<" "<< c<<" "<<d<<" "<<" "<<e<<" "<<f;
    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	29 ms	5044 KB	Output is correct
2	Correct	30 ms	5024 KB	Output is correct
3	Correct	30 ms	4848 KB	Output is correct
4	Correct	31 ms	5120 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	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	5 ms	3636 KB	Output is correct
5	Correct	5 ms	3636 KB	Output is correct
6	Correct	6 ms	3636 KB	Output is correct
7	Correct	5 ms	3508 KB	Output is correct
8	Correct	5 ms	3636 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	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	5 ms	3636 KB	Output is correct
5	Correct	5 ms	3636 KB	Output is correct
6	Correct	6 ms	3636 KB	Output is correct
7	Correct	5 ms	3508 KB	Output is correct
8	Correct	5 ms	3636 KB	Output is correct
9	Correct	5 ms	3636 KB	Output is correct
10	Correct	31 ms	4972 KB	Output is correct
11	Correct	32 ms	5024 KB	Output is correct
12	Correct	31 ms	5164 KB	Output is correct
13	Correct	32 ms	5272 KB	Output is correct
14	Correct	31 ms	5408 KB	Output is correct
15	Correct	31 ms	5428 KB	Output is correct
16	Correct	29 ms	5192 KB	Output is correct
17	Correct	30 ms	5268 KB	Output is correct
18	Correct	30 ms	5428 KB	Output is correct
19	Correct	29 ms	5256 KB	Output is correct
20	Correct	29 ms	5292 KB	Output is correct
21	Correct	29 ms	5408 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	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	5 ms	3636 KB	Output is correct
5	Correct	5 ms	3636 KB	Output is correct
6	Correct	6 ms	3636 KB	Output is correct
7	Correct	5 ms	3508 KB	Output is correct
8	Correct	5 ms	3636 KB	Output is correct
9	Correct	5 ms	3636 KB	Output is correct
10	Correct	5 ms	3508 KB	Output is correct
11	Correct	6 ms	3636 KB	Output is correct
12	Correct	5 ms	3508 KB	Output is correct
13	Correct	7 ms	3636 KB	Output is correct
14	Correct	6 ms	3636 KB	Output is correct
15	Correct	5 ms	3728 KB	Output is correct

Subtask #5
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	29 ms	5044 KB	Output is correct
2	Correct	30 ms	5024 KB	Output is correct
3	Correct	30 ms	4848 KB	Output is correct
4	Correct	31 ms	5120 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	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	5 ms	3636 KB	Output is correct
12	Correct	5 ms	3636 KB	Output is correct
13	Correct	6 ms	3636 KB	Output is correct
14	Correct	5 ms	3508 KB	Output is correct
15	Correct	5 ms	3636 KB	Output is correct
16	Correct	5 ms	3636 KB	Output is correct
17	Correct	31 ms	4972 KB	Output is correct
18	Correct	32 ms	5024 KB	Output is correct
19	Correct	31 ms	5164 KB	Output is correct
20	Correct	32 ms	5272 KB	Output is correct
21	Correct	31 ms	5408 KB	Output is correct
22	Correct	31 ms	5428 KB	Output is correct
23	Correct	29 ms	5192 KB	Output is correct
24	Correct	30 ms	5268 KB	Output is correct
25	Correct	30 ms	5428 KB	Output is correct
26	Correct	29 ms	5256 KB	Output is correct
27	Correct	29 ms	5292 KB	Output is correct
28	Correct	29 ms	5408 KB	Output is correct
29	Correct	5 ms	3508 KB	Output is correct
30	Correct	6 ms	3636 KB	Output is correct
31	Correct	5 ms	3508 KB	Output is correct
32	Correct	7 ms	3636 KB	Output is correct
33	Correct	6 ms	3636 KB	Output is correct
34	Correct	5 ms	3728 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	31 ms	4860 KB	Output is correct
37	Correct	31 ms	5048 KB	Output is correct
38	Correct	33 ms	5288 KB	Output is correct
39	Correct	35 ms	5408 KB	Output is correct
40	Correct	31 ms	5416 KB	Output is correct
41	Correct	4 ms	3636 KB	Output is correct
42	Correct	30 ms	5280 KB	Output is correct
43	Correct	32 ms	5420 KB	Output is correct
44	Correct	30 ms	5420 KB	Output is correct
45	Correct	30 ms	5268 KB	Output is correct
46	Correct	29 ms	5428 KB	Output is correct
47	Correct	31 ms	5412 KB	Output is correct

Submission #689474

Compilation message

Subtask #1 21.0 / 21.0

Subtask #2 22.0 / 22.0

Subtask #3 13.0 / 13.0

Subtask #4 28.0 / 28.0

Subtask #5 16.0 / 16.0

Subtask #1
21.0 / 21.0

Subtask #2
22.0 / 22.0

Subtask #3
13.0 / 13.0

Subtask #4
28.0 / 28.0

Subtask #5
16.0 / 16.0