답안 #789039

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
789039	2023-07-20T22:00:53 Z	Mouad_ouj	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	49 ms	8584 KB

#include<bits/stdc++.h>
//#include"prize.h"
using namespace std;
vector<int> ta,tc,ac,at,ca,ct;
vector<int> pret1,prea1,prec1,pret2,prea2,prec2;
//t a,c     a t,c      c  a,t
void init(string a, string b)
{
    int n=a.size()+1;
    pret1.resize(n),prea1.resize(n),prec1.resize(n),pret2.resize(n),prea2.resize(n),prec2.resize(n);
    ta.resize(n),tc.resize(n),ac.resize(n),at.resize(n),ca.resize(n),ct.resize(n);
    pret1[0]=0,pret2[0]=0,prea1[0]=0,prea2[0]=0,prec1[0]=0,prec2[0]=0;
    ta[0]=0,tc[0]=0,ca[0]=0,ct[0]=0,ac[0]=0,at[0]=0;
    for(int x=1;x<n;x++)
    {
        pret1[x]=pret1[x-1],prea1[x]=prea1[x-1],prec1[x]=prec1[x-1];
        if(a[x-1]=='T')
        pret1[x]++;
        if(a[x-1]=='C')
        prec1[x]++;
        if(a[x-1]=='A')
        prea1[x]++;
        pret2[x]=pret2[x-1],prea2[x]=prea2[x-1],prec2[x]=prec2[x-1];
        if(b[x-1]=='T')
        pret2[x]++;
        if(b[x-1]=='C')
        prec2[x]++;
        if(b[x-1]=='A')
        prea2[x]++;
        ta[x]=ta[x-1],tc[x]=tc[x-1];
        at[x]=at[x-1],ac[x]=ac[x-1];
        ca[x]=ca[x-1],ct[x]=ct[x-1];
        if(a[x-1]=='A' && b[x-1]=='C')
            ac[x]++;
        if(a[x-1]=='A' && b[x-1]=='T')
            at[x]++;
        if(a[x-1]=='T' && b[x-1]=='C')
            tc[x]++; 
        if(a[x-1]=='T' && b[x-1]=='A')
            ta[x]++;
        if(a[x-1]=='C' && b[x-1]=='A')
            ca[x]++;
        if(a[x-1]=='C' && b[x-1]=='T')
            ct[x]++;
    }
}
int get_distance(int y, int x)
{
    x++,y++;
    if(prea1[x]-prea1[y-1]==prea2[x]-prea2[y-1] && pret1[x]-pret1[y-1]==pret2[x]-pret2[y-1] && prec1[x]-prec1[y-1]==prec2[x]-prec2[y-1])
    {
        int ans=0,cur=0;
        ans=min(ac[x]-ac[y-1],ca[x]-ca[y-1])+min(at[x]-at[y-1],ta[x]-ta[y-1])+min(ct[x]-ct[y-1],tc[x]-tc[y-1]);
        cur=max(ac[x]-ac[y-1],ca[x]-ca[y-1])+max(at[x]-at[y-1],ta[x]-ta[y-1])+max(ct[x]-ct[y-1],tc[x]-tc[y-1])-ans;
        ans+=(cur/3)*2;
        return ans;
    }
    else
    return -1;
}

Subtask #1
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	37 ms	6776 KB	Output is correct
2	Correct	47 ms	8172 KB	Output is correct
3	Correct	36 ms	7772 KB	Output is correct
4	Correct	37 ms	8176 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	296 KB	Output is correct

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	304 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	14 ms	5756 KB	Output is correct
5	Correct	16 ms	5788 KB	Output is correct
6	Correct	14 ms	5692 KB	Output is correct
7	Correct	13 ms	5296 KB	Output is correct
8	Correct	14 ms	5748 KB	Output is correct
9	Correct	14 ms	5688 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	304 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	14 ms	5756 KB	Output is correct
5	Correct	16 ms	5788 KB	Output is correct
6	Correct	14 ms	5692 KB	Output is correct
7	Correct	13 ms	5296 KB	Output is correct
8	Correct	14 ms	5748 KB	Output is correct
9	Correct	14 ms	5688 KB	Output is correct
10	Correct	37 ms	8076 KB	Output is correct
11	Correct	36 ms	8176 KB	Output is correct
12	Correct	38 ms	8184 KB	Output is correct
13	Correct	38 ms	8336 KB	Output is correct
14	Correct	49 ms	8584 KB	Output is correct
15	Correct	38 ms	8528 KB	Output is correct
16	Correct	44 ms	8088 KB	Output is correct
17	Correct	37 ms	8172 KB	Output is correct
18	Correct	39 ms	8480 KB	Output is correct
19	Correct	36 ms	8132 KB	Output is correct
20	Correct	37 ms	8212 KB	Output is correct
21	Correct	39 ms	8432 KB	Output is correct

Subtask #4
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	304 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	14 ms	5756 KB	Output is correct
5	Correct	16 ms	5788 KB	Output is correct
6	Correct	14 ms	5692 KB	Output is correct
7	Correct	13 ms	5296 KB	Output is correct
8	Correct	14 ms	5748 KB	Output is correct
9	Correct	14 ms	5688 KB	Output is correct
10	Correct	13 ms	5360 KB	Output is correct
11	Correct	13 ms	5716 KB	Output is correct
12	Correct	12 ms	5460 KB	Output is correct
13	Correct	13 ms	5716 KB	Output is correct
14	Correct	13 ms	5752 KB	Output is correct
15	Correct	14 ms	5812 KB	Output is correct

Subtask #5
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	37 ms	6776 KB	Output is correct
2	Correct	47 ms	8172 KB	Output is correct
3	Correct	36 ms	7772 KB	Output is correct
4	Correct	37 ms	8176 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	296 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	304 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	14 ms	5756 KB	Output is correct
12	Correct	16 ms	5788 KB	Output is correct
13	Correct	14 ms	5692 KB	Output is correct
14	Correct	13 ms	5296 KB	Output is correct
15	Correct	14 ms	5748 KB	Output is correct
16	Correct	14 ms	5688 KB	Output is correct
17	Correct	37 ms	8076 KB	Output is correct
18	Correct	36 ms	8176 KB	Output is correct
19	Correct	38 ms	8184 KB	Output is correct
20	Correct	38 ms	8336 KB	Output is correct
21	Correct	49 ms	8584 KB	Output is correct
22	Correct	38 ms	8528 KB	Output is correct
23	Correct	44 ms	8088 KB	Output is correct
24	Correct	37 ms	8172 KB	Output is correct
25	Correct	39 ms	8480 KB	Output is correct
26	Correct	36 ms	8132 KB	Output is correct
27	Correct	37 ms	8212 KB	Output is correct
28	Correct	39 ms	8432 KB	Output is correct
29	Correct	13 ms	5360 KB	Output is correct
30	Correct	13 ms	5716 KB	Output is correct
31	Correct	12 ms	5460 KB	Output is correct
32	Correct	13 ms	5716 KB	Output is correct
33	Correct	13 ms	5752 KB	Output is correct
34	Correct	14 ms	5812 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	34 ms	7716 KB	Output is correct
37	Correct	37 ms	8176 KB	Output is correct
38	Correct	38 ms	8232 KB	Output is correct
39	Correct	38 ms	8556 KB	Output is correct
40	Correct	38 ms	8580 KB	Output is correct
41	Correct	14 ms	5740 KB	Output is correct
42	Correct	36 ms	8148 KB	Output is correct
43	Correct	38 ms	8456 KB	Output is correct
44	Correct	39 ms	8436 KB	Output is correct
45	Correct	42 ms	8144 KB	Output is correct
46	Correct	37 ms	8416 KB	Output is correct
47	Correct	37 ms	8452 KB	Output is correct

답안 #789039

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