oj.uz

답안 #677185

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677185 2023-01-02T13:56:13 Z bene42 DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 42 ms 8584 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

int A1[100005], T1[100005], C1[100005];
int A2[100005], T2[100005], C2[100005];

int AT[100005], AC[100005], TA[100005], TC[100005], CA[100005], CT[100005];

void init(std::string a, std::string b) {
    for (int i = 0; i < a.size(); i++) {
        if (i > 0) {
            A1[i] = A1[i - 1];
            T1[i] = T1[i - 1];
            C1[i] = C1[i - 1];
            A2[i] = A2[i - 1];
            T2[i] = T2[i - 1];
            C2[i] = C2[i - 1];

            AT[i] = AT[i - 1];
            AC[i] = AC[i - 1];
            TA[i] = TA[i - 1];
            TC[i] = TC[i - 1];
            CA[i] = CA[i - 1];
            CT[i] = CT[i - 1];
        }
        A1[i] += a[i] == 'A' ? 1 : 0;
        T1[i] += a[i] == 'T' ? 1 : 0;
        C1[i] += a[i] == 'C' ? 1 : 0;
        A2[i] += b[i] == 'A' ? 1 : 0;
        T2[i] += b[i] == 'T' ? 1 : 0;
        C2[i] += b[i] == 'C' ? 1 : 0;

        if (a[i] != b[i]) {
            if (b[i] == 'A') {
                TA[i] += a[i] == 'T' ? 1 : 0;
                CA[i] += a[i] == 'C' ? 1 : 0;
            } else {
                if (b[i] == 'T') {
                    AT[i] += a[i] == 'A' ? 1 : 0;
                    CT[i] += a[i] == 'C' ? 1 : 0;
                } else {
                    AC[i] += a[i] == 'A' ? 1 : 0;
                    TC[i] += a[i] == 'T' ? 1 : 0;
                }
            }
        }
    }
}

int get_distance(int x, int y) {
    int dA, dT, dC, dist = 0;
    dA = (A1[y] - (x == 0 ? 0 : A1[x - 1])) - (A2[y] - (x == 0 ? 0 : A2[x - 1]));
    dT = (T1[y] - (x == 0 ? 0 : T1[x - 1])) - (T2[y] - (x == 0 ? 0 : T2[x - 1]));
    dC = (C1[y] - (x == 0 ? 0 : C1[x - 1])) - (C2[y] - (x == 0 ? 0 : C2[x - 1]));


    if (dA != 0 || dT != 0 || dC != 0) {
        return -1;
    }

    int at = AT[y] - (x == 0 ? 0 : AT[x - 1]);
    int ac = AC[y] - (x == 0 ? 0 : AC[x - 1]);
    int ta = TA[y] - (x == 0 ? 0 : TA[x - 1]);
    int tc = TC[y] - (x == 0 ? 0 : TC[x - 1]);
    int ca = CA[y] - (x == 0 ? 0 : CA[x - 1]);
    int ct = CT[y] - (x == 0 ? 0 : CT[x - 1]);


    if (at >= ta) {
        dist += ta;
        at -= ta;
        ta = 0;
    } else {
        dist += at;
        ta -= at;
        at = 0;
    }
    if (tc >= ct) {
        dist += ct;
        tc -= ct;
        ct = 0;
    } else {
        dist += tc;
        ct -= tc;
        tc = 0;
    }
    if (ca >= ac) {
        dist += ac;
        ca -= ac;
        ac = 0;
    } else {
        dist += ca;
        ac -= ca;
        ca = 0;
    }
    
    dist += 2 * (at + ac + ta + tc + ca + ct) / 3;

    return dist;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:12:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for (int i = 0; i < a.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 8076 KB Output is correct
2 Correct 33 ms 8168 KB Output is correct
3 Correct 33 ms 7784 KB Output is correct
4 Correct 42 ms 8112 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 308 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 5688 KB Output is correct
5 Correct 5 ms 5696 KB Output is correct
6 Correct 5 ms 5692 KB Output is correct
7 Correct 5 ms 5328 KB Output is correct
8 Correct 5 ms 5716 KB Output is correct
9 Correct 4 ms 5732 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 5688 KB Output is correct
5 Correct 5 ms 5696 KB Output is correct
6 Correct 5 ms 5692 KB Output is correct
7 Correct 5 ms 5328 KB Output is correct
8 Correct 5 ms 5716 KB Output is correct
9 Correct 4 ms 5732 KB Output is correct
10 Correct 32 ms 8184 KB Output is correct
11 Correct 33 ms 8184 KB Output is correct
12 Correct 32 ms 8172 KB Output is correct
13 Correct 34 ms 8556 KB Output is correct
14 Correct 34 ms 8460 KB Output is correct
15 Correct 33 ms 8420 KB Output is correct
16 Correct 31 ms 8040 KB Output is correct
17 Correct 31 ms 8212 KB Output is correct
18 Correct 31 ms 8436 KB Output is correct
19 Correct 32 ms 8188 KB Output is correct
20 Correct 29 ms 8292 KB Output is correct
21 Correct 30 ms 8440 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 5688 KB Output is correct
5 Correct 5 ms 5696 KB Output is correct
6 Correct 5 ms 5692 KB Output is correct
7 Correct 5 ms 5328 KB Output is correct
8 Correct 5 ms 5716 KB Output is correct
9 Correct 4 ms 5732 KB Output is correct
10 Correct 4 ms 5332 KB Output is correct
11 Correct 6 ms 5716 KB Output is correct
12 Correct 5 ms 5460 KB Output is correct
13 Correct 5 ms 5676 KB Output is correct
14 Correct 5 ms 5692 KB Output is correct
15 Correct 5 ms 5716 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 8076 KB Output is correct
2 Correct 33 ms 8168 KB Output is correct
3 Correct 33 ms 7784 KB Output is correct
4 Correct 42 ms 8112 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 5 ms 5688 KB Output is correct
12 Correct 5 ms 5696 KB Output is correct
13 Correct 5 ms 5692 KB Output is correct
14 Correct 5 ms 5328 KB Output is correct
15 Correct 5 ms 5716 KB Output is correct
16 Correct 4 ms 5732 KB Output is correct
17 Correct 32 ms 8184 KB Output is correct
18 Correct 33 ms 8184 KB Output is correct
19 Correct 32 ms 8172 KB Output is correct
20 Correct 34 ms 8556 KB Output is correct
21 Correct 34 ms 8460 KB Output is correct
22 Correct 33 ms 8420 KB Output is correct
23 Correct 31 ms 8040 KB Output is correct
24 Correct 31 ms 8212 KB Output is correct
25 Correct 31 ms 8436 KB Output is correct
26 Correct 32 ms 8188 KB Output is correct
27 Correct 29 ms 8292 KB Output is correct
28 Correct 30 ms 8440 KB Output is correct
29 Correct 4 ms 5332 KB Output is correct
30 Correct 6 ms 5716 KB Output is correct
31 Correct 5 ms 5460 KB Output is correct
32 Correct 5 ms 5676 KB Output is correct
33 Correct 5 ms 5692 KB Output is correct
34 Correct 5 ms 5716 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 34 ms 7780 KB Output is correct
37 Correct 33 ms 8180 KB Output is correct
38 Correct 32 ms 8212 KB Output is correct
39 Correct 33 ms 8572 KB Output is correct
40 Correct 33 ms 8584 KB Output is correct
41 Correct 4 ms 5716 KB Output is correct
42 Correct 35 ms 8216 KB Output is correct
43 Correct 32 ms 8436 KB Output is correct
44 Correct 31 ms 8456 KB Output is correct
45 Correct 29 ms 8212 KB Output is correct
46 Correct 30 ms 8456 KB Output is correct
47 Correct 31 ms 8420 KB Output is correct