답안 #722401

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
722401	2023-04-11T22:04:32 Z	sofija6	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	51 ms	8564 KB

#include <bits/stdc++.h>
#define ll long long
#define MAXN 100010
using namespace std;
int AC[MAXN],CA[MAXN],CT[MAXN],TC[MAXN],TA[MAXN],AT[MAXN],cnt[5][5][MAXN];
void init(string a, string b)
{
    int n=a.size();
    a=' '+a;
    b=' '+b;
    for (ll i=1;i<=n;i++)
    {
        for (ll j=1;j<=3;j++)
        {
            for (ll l=1;l<=2;l++)
                cnt[j][l][i]=cnt[j][l][i-1];
        }
        if (a[i]=='A')
            cnt[1][1][i]++;
        else if (a[i]=='C')
            cnt[2][1][i]++;
        else
            cnt[3][1][i]++;
        if (b[i]=='A')
            cnt[1][2][i]++;
        else if (b[i]=='C')
            cnt[2][2][i]++;
        else
            cnt[3][2][i]++;
        AC[i]=AC[i-1];
        CA[i]=CA[i-1];
        CT[i]=CT[i-1];
        TC[i]=TC[i-1];
        TA[i]=TA[i-1];
        AT[i]=AT[i-1];
        if (a[i]=='A' && b[i]=='C')
            AC[i]++;
        else if (a[i]=='C' && b[i]=='A')
            CA[i]++;
        else if (a[i]=='C' && b[i]=='T')
            CT[i]++;
        else if (a[i]=='T' && b[i]=='C')
            TC[i]++;
        else if (a[i]=='T' && b[i]=='A')
            TA[i]++;
        else if (a[i]=='A' && b[i]=='T')
            AT[i]++;
    }
}
int get_distance(int x, int y)
{
    x++;
    y++;
    if (cnt[1][1][y]-cnt[1][1][x-1]!=cnt[1][2][y]-cnt[1][2][x-1] || cnt[2][1][y]-cnt[2][1][x-1]!=cnt[2][2][y]-cnt[2][2][x-1] || cnt[3][1][y]-cnt[3][1][x-1]!=cnt[3][2][y]-cnt[3][2][x-1])
        return -1;
    int curAC=AC[y]-AC[x-1],curCA=CA[y]-CA[x-1],curCT=CT[y]-CT[x-1],curTC=TC[y]-TC[x-1],curTA=TA[y]-TA[x-1],curAT=AT[y]-AT[x-1];
    int minn=min(curAC,curCA),ans=0;
    curAC-=minn;
    curCA-=minn;
    ans+=minn;
    minn=min(curCT,curTC);
    curCT-=minn;
    curTC-=minn;
    ans+=minn;
    minn=min(curTA,curAT);
    curTA-=minn;
    curAT-=minn;
    ans+=minn;
    return ans+max(curAC,curCA)+max(curCT,curTC)+max(curTA,curAT)-max({max(curAC,curCA),max(curCT,curTC),max(curTA,curAT)});
}

Subtask #1
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	39 ms	7188 KB	Output is correct
2	Correct	43 ms	7296 KB	Output is correct
3	Correct	37 ms	7736 KB	Output is correct
4	Correct	41 ms	7232 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	1 ms	300 KB	Output is correct
3	Correct	1 ms	304 KB	Output is correct
4	Correct	6 ms	5808 KB	Output is correct
5	Correct	7 ms	5820 KB	Output is correct
6	Correct	6 ms	5844 KB	Output is correct
7	Correct	6 ms	5460 KB	Output is correct
8	Correct	5 ms	5824 KB	Output is correct
9	Correct	6 ms	5844 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	1 ms	300 KB	Output is correct
3	Correct	1 ms	304 KB	Output is correct
4	Correct	6 ms	5808 KB	Output is correct
5	Correct	7 ms	5820 KB	Output is correct
6	Correct	6 ms	5844 KB	Output is correct
7	Correct	6 ms	5460 KB	Output is correct
8	Correct	5 ms	5824 KB	Output is correct
9	Correct	6 ms	5844 KB	Output is correct
10	Correct	46 ms	8068 KB	Output is correct
11	Correct	36 ms	7336 KB	Output is correct
12	Correct	38 ms	7280 KB	Output is correct
13	Correct	38 ms	7404 KB	Output is correct
14	Correct	44 ms	7580 KB	Output is correct
15	Correct	50 ms	7512 KB	Output is correct
16	Correct	46 ms	7244 KB	Output is correct
17	Correct	34 ms	8104 KB	Output is correct
18	Correct	34 ms	8400 KB	Output is correct
19	Correct	34 ms	7388 KB	Output is correct
20	Correct	36 ms	7504 KB	Output is correct
21	Correct	41 ms	7608 KB	Output is correct

Subtask #4
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	1 ms	300 KB	Output is correct
3	Correct	1 ms	304 KB	Output is correct
4	Correct	6 ms	5808 KB	Output is correct
5	Correct	7 ms	5820 KB	Output is correct
6	Correct	6 ms	5844 KB	Output is correct
7	Correct	6 ms	5460 KB	Output is correct
8	Correct	5 ms	5824 KB	Output is correct
9	Correct	6 ms	5844 KB	Output is correct
10	Correct	6 ms	5332 KB	Output is correct
11	Correct	7 ms	5820 KB	Output is correct
12	Correct	5 ms	5460 KB	Output is correct
13	Correct	7 ms	5844 KB	Output is correct
14	Correct	6 ms	5844 KB	Output is correct
15	Correct	5 ms	5844 KB	Output is correct

Subtask #5
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	39 ms	7188 KB	Output is correct
2	Correct	43 ms	7296 KB	Output is correct
3	Correct	37 ms	7736 KB	Output is correct
4	Correct	41 ms	7232 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	304 KB	Output is correct
11	Correct	6 ms	5808 KB	Output is correct
12	Correct	7 ms	5820 KB	Output is correct
13	Correct	6 ms	5844 KB	Output is correct
14	Correct	6 ms	5460 KB	Output is correct
15	Correct	5 ms	5824 KB	Output is correct
16	Correct	6 ms	5844 KB	Output is correct
17	Correct	46 ms	8068 KB	Output is correct
18	Correct	36 ms	7336 KB	Output is correct
19	Correct	38 ms	7280 KB	Output is correct
20	Correct	38 ms	7404 KB	Output is correct
21	Correct	44 ms	7580 KB	Output is correct
22	Correct	50 ms	7512 KB	Output is correct
23	Correct	46 ms	7244 KB	Output is correct
24	Correct	34 ms	8104 KB	Output is correct
25	Correct	34 ms	8400 KB	Output is correct
26	Correct	34 ms	7388 KB	Output is correct
27	Correct	36 ms	7504 KB	Output is correct
28	Correct	41 ms	7608 KB	Output is correct
29	Correct	6 ms	5332 KB	Output is correct
30	Correct	7 ms	5820 KB	Output is correct
31	Correct	5 ms	5460 KB	Output is correct
32	Correct	7 ms	5844 KB	Output is correct
33	Correct	6 ms	5844 KB	Output is correct
34	Correct	5 ms	5844 KB	Output is correct
35	Correct	1 ms	304 KB	Output is correct
36	Correct	37 ms	7732 KB	Output is correct
37	Correct	36 ms	8244 KB	Output is correct
38	Correct	39 ms	8332 KB	Output is correct
39	Correct	46 ms	8560 KB	Output is correct
40	Correct	39 ms	8564 KB	Output is correct
41	Correct	5 ms	5828 KB	Output is correct
42	Correct	39 ms	8128 KB	Output is correct
43	Correct	51 ms	8440 KB	Output is correct
44	Correct	42 ms	8488 KB	Output is correct
45	Correct	40 ms	8248 KB	Output is correct
46	Correct	28 ms	8472 KB	Output is correct
47	Correct	34 ms	8440 KB	Output is correct

답안 #722401

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