답안 #715928

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
715928	2023-03-28T12:44:49 Z	ngano_upat_na	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	56 ms	8584 KB

#include "dna.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
 
const int N = 100009;
 
vector<int> A0(N,0), A1(N,0);
vector<int> T0(N,0), T1(N,0);
vector<int> C0(N,0), C1(N,0);
vector<int> AC(N,0), CA(N,0), AT(N,0), TA(N,0), TC(N,0), CT(N,0);
 
void init(string a, string b) {
    int sz = (int)a.size();
    for (int i=0; i<sz; i++) {
        if (i > 0) {
            A0[i] = A0[i - 1];
            C0[i] = C0[i - 1];
            T0[i] = T0[i - 1];
        }   
        if (a[i] == 'A') A0[i]++;
        if (a[i] == 'T') T0[i]++;
        if (a[i] == 'C') C0[i]++;
    }
    for (int i=0; i<sz; i++) {
        if (i > 0) {
            A1[i] = A1[i - 1];
            C1[i] = C1[i - 1];
            T1[i] = T1[i - 1];
        }   
        if (b[i] == 'A') A1[i]++;
        if (b[i] == 'T') T1[i]++;
        if (b[i] == 'C') C1[i]++;
    }    
    for (int i=0; i<sz; i++) {
        if (i > 0) {
            AC[i] = AC[i - 1];
            CA[i] = CA[i - 1];
            CT[i] = CT[i - 1];
            TC[i] = TC[i - 1];
            AT[i] = AT[i - 1];
            TA[i] = TA[i - 1];
        }    
        if (a[i] == 'A' && b[i] == 'C') AC[i]++;
        if (a[i] == 'C' && b[i] == 'A') CA[i]++;
        if (a[i] == 'C' && b[i] == 'T') CT[i]++;
        if (a[i] == 'T' && b[i] == 'C') TC[i]++;
        if (a[i] == 'A' && b[i] == 'T') AT[i]++;
        if (a[i] == 'T' && b[i] == 'A') TA[i]++;
    }   
}   
 
int get_distance(int x, int y) {
    int ans = 0;

    bool yes = true;
    if (x == 0) {
        if ((A0[y] != A1[y]) || (T0[y] != T1[y]) || (C0[y] != C1[y])) yes = false;
    }   
    else {
        if ((A0[y] - A0[x-1] != A1[y] - A1[x-1]) || (T0[y] - T0[x-1] != T1[y] - T1[x-1]) || (C0[y] - C0[x-1] != C1[y] - C1[x-1])) yes = false;
    }   
    
    int ac, ca, at, ta, ct, tc;
    if (x == 0) {
        ac = AC[y], ca = CA[y];
        at = AT[y], ta = TA[y];
        ct = CT[y], tc = TC[y];
    }   
    else {
        ac = AC[y] - AC[x-1], ca = CA[y] - CA[x-1];
        at = AT[y] - AT[x-1], ta = TA[y] - TA[x-1];
        ct = CT[y] - CT[x-1], tc = TC[y] - TC[x-1];
    }
    
    int a = min(ac,ca);
    int b = min(at,ta);
    int c = min(ct,tc);
    ans = ans + a + b + c;
    ac -= a;
    ca -= a;
    at -= b;
    ta -= b;
    ct -= c;
    tc -= c;
    
    int d = min(ac,min(ta,ct));
    ans = ans + (2*d);
    ac -= d;
    ta -= d;
    ct -= d;
    
    int e = min(ca,min(at,tc));
    ans = ans + (2*e);
    ca -= e;
    at -= e;
    tc -= e;
    
    
    
    if (yes) {
        return ans;
    }   
    else {
        return -1;
    }   
}

Subtask #1
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	50 ms	8204 KB	Output is correct
2	Correct	43 ms	8176 KB	Output is correct
3	Correct	38 ms	8072 KB	Output is correct
4	Correct	48 ms	8172 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	4948 KB	Output is correct
7	Correct	3 ms	5020 KB	Output is correct

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5028 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	4 ms	4948 KB	Output is correct
4	Correct	7 ms	5736 KB	Output is correct
5	Correct	7 ms	5800 KB	Output is correct
6	Correct	7 ms	5716 KB	Output is correct
7	Correct	8 ms	5676 KB	Output is correct
8	Correct	7 ms	5716 KB	Output is correct
9	Correct	8 ms	5716 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5028 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	4 ms	4948 KB	Output is correct
4	Correct	7 ms	5736 KB	Output is correct
5	Correct	7 ms	5800 KB	Output is correct
6	Correct	7 ms	5716 KB	Output is correct
7	Correct	8 ms	5676 KB	Output is correct
8	Correct	7 ms	5716 KB	Output is correct
9	Correct	8 ms	5716 KB	Output is correct
10	Correct	43 ms	8164 KB	Output is correct
11	Correct	36 ms	8152 KB	Output is correct
12	Correct	37 ms	8432 KB	Output is correct
13	Correct	39 ms	8536 KB	Output is correct
14	Correct	47 ms	8584 KB	Output is correct
15	Correct	39 ms	8424 KB	Output is correct
16	Correct	37 ms	8384 KB	Output is correct
17	Correct	35 ms	8380 KB	Output is correct
18	Correct	39 ms	8536 KB	Output is correct
19	Correct	38 ms	8384 KB	Output is correct
20	Correct	49 ms	8464 KB	Output is correct
21	Correct	41 ms	8452 KB	Output is correct

Subtask #4
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5028 KB	Output is correct
2	Correct	3 ms	4948 KB	Output is correct
3	Correct	4 ms	4948 KB	Output is correct
4	Correct	7 ms	5736 KB	Output is correct
5	Correct	7 ms	5800 KB	Output is correct
6	Correct	7 ms	5716 KB	Output is correct
7	Correct	8 ms	5676 KB	Output is correct
8	Correct	7 ms	5716 KB	Output is correct
9	Correct	8 ms	5716 KB	Output is correct
10	Correct	8 ms	5676 KB	Output is correct
11	Correct	9 ms	5720 KB	Output is correct
12	Correct	7 ms	5692 KB	Output is correct
13	Correct	9 ms	5800 KB	Output is correct
14	Correct	8 ms	5808 KB	Output is correct
15	Correct	7 ms	5804 KB	Output is correct

Subtask #5
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	50 ms	8204 KB	Output is correct
2	Correct	43 ms	8176 KB	Output is correct
3	Correct	38 ms	8072 KB	Output is correct
4	Correct	48 ms	8172 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	4948 KB	Output is correct
7	Correct	3 ms	5020 KB	Output is correct
8	Correct	3 ms	5028 KB	Output is correct
9	Correct	3 ms	4948 KB	Output is correct
10	Correct	4 ms	4948 KB	Output is correct
11	Correct	7 ms	5736 KB	Output is correct
12	Correct	7 ms	5800 KB	Output is correct
13	Correct	7 ms	5716 KB	Output is correct
14	Correct	8 ms	5676 KB	Output is correct
15	Correct	7 ms	5716 KB	Output is correct
16	Correct	8 ms	5716 KB	Output is correct
17	Correct	43 ms	8164 KB	Output is correct
18	Correct	36 ms	8152 KB	Output is correct
19	Correct	37 ms	8432 KB	Output is correct
20	Correct	39 ms	8536 KB	Output is correct
21	Correct	47 ms	8584 KB	Output is correct
22	Correct	39 ms	8424 KB	Output is correct
23	Correct	37 ms	8384 KB	Output is correct
24	Correct	35 ms	8380 KB	Output is correct
25	Correct	39 ms	8536 KB	Output is correct
26	Correct	38 ms	8384 KB	Output is correct
27	Correct	49 ms	8464 KB	Output is correct
28	Correct	41 ms	8452 KB	Output is correct
29	Correct	8 ms	5676 KB	Output is correct
30	Correct	9 ms	5720 KB	Output is correct
31	Correct	7 ms	5692 KB	Output is correct
32	Correct	9 ms	5800 KB	Output is correct
33	Correct	8 ms	5808 KB	Output is correct
34	Correct	7 ms	5804 KB	Output is correct
35	Correct	4 ms	5028 KB	Output is correct
36	Correct	39 ms	8168 KB	Output is correct
37	Correct	56 ms	8236 KB	Output is correct
38	Correct	40 ms	8532 KB	Output is correct
39	Correct	39 ms	8540 KB	Output is correct
40	Correct	41 ms	8524 KB	Output is correct
41	Correct	6 ms	5804 KB	Output is correct
42	Correct	37 ms	8472 KB	Output is correct
43	Correct	42 ms	8456 KB	Output is correct
44	Correct	36 ms	8456 KB	Output is correct
45	Correct	34 ms	8380 KB	Output is correct
46	Correct	35 ms	8584 KB	Output is correct
47	Correct	36 ms	8528 KB	Output is correct

답안 #715928

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