답안 #499833

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499833	2021-12-29T18:35:34 Z	sazid_alam	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	48 ms	9708 KB

#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

int tot[100005][3][2], bad[100005][3][3];

void init(string u, string v) {
    for(int i = 0; i < u.size(); i++){
        for(int j = 0; j < 3; j++){
            for(int k = 0; k < 3; k++){
                bad[i + 1][j][k] += bad[i][j][k];
            }
        }
        if(u[i] != v[i]){
            if(u[i] == 'A' && v[i] == 'C') bad[i + 1][0][1]++;
            if(u[i] == 'A' && v[i] == 'T') bad[i + 1][0][2]++;
            if(u[i] == 'C' && v[i] == 'A') bad[i + 1][1][0]++;
            if(u[i] == 'C' && v[i] == 'T') bad[i + 1][1][2]++;
            if(u[i] == 'T' && v[i] == 'A') bad[i + 1][2][0]++;
            if(u[i] == 'T' && v[i] == 'C') bad[i + 1][2][1]++;
        }
        if(u[i] == 'A') tot[i + 1][0][0]++;
        if(v[i] == 'A') tot[i + 1][0][1]++;
        if(u[i] == 'C') tot[i + 1][1][0]++;
        if(v[i] == 'C') tot[i + 1][1][1]++;
        if(u[i] == 'T') tot[i + 1][2][0]++;
        if(v[i] == 'T') tot[i + 1][2][1]++;

        for(int j = 0; j < 3; j++){
            tot[i + 1][j][0] += tot[i][j][0];
            tot[i + 1][j][1] += tot[i][j][1];
        }
    }
}

int get_distance(int x, int y) {

    for(int j = 0; j < 3; j++){
        if(tot[y + 1][j][0] - tot[x][j][0] != tot[y + 1][j][1] - tot[x][j][1]) return -1;
    }

    int ans = 0, extra = 1000000;
    bool done[3][3] = {0};

    for(int j = 0; j < 3; j++){
        for(int k = 0; k < 3; k++){
            if(done[j][k] || done[k][j] || j == k) continue;
            int ch = min(bad[y + 1][j][k] - bad[x][j][k], bad[y + 1][k][j] - bad[x][k][j]);
            int hc = max(bad[y + 1][j][k] - bad[x][j][k], bad[y + 1][k][j] - bad[x][k][j]);
            ans += ch;
            extra = min(extra, hc - ch);
            done[j][k] = true;
        }
    }

    return ans + extra * 2;
}

Compilation message

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

Subtask #1
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	45 ms	7920 KB	Output is correct
2	Correct	41 ms	7936 KB	Output is correct
3	Correct	37 ms	7444 KB	Output is correct
4	Correct	36 ms	7956 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	6 ms	6604 KB	Output is correct
5	Correct	6 ms	6732 KB	Output is correct
6	Correct	5 ms	6604 KB	Output is correct
7	Correct	5 ms	6220 KB	Output is correct
8	Correct	6 ms	6732 KB	Output is correct
9	Correct	4 ms	6732 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	6 ms	6604 KB	Output is correct
5	Correct	6 ms	6732 KB	Output is correct
6	Correct	5 ms	6604 KB	Output is correct
7	Correct	5 ms	6220 KB	Output is correct
8	Correct	6 ms	6732 KB	Output is correct
9	Correct	4 ms	6732 KB	Output is correct
10	Correct	35 ms	7932 KB	Output is correct
11	Correct	36 ms	8052 KB	Output is correct
12	Correct	38 ms	7872 KB	Output is correct
13	Correct	39 ms	8104 KB	Output is correct
14	Correct	48 ms	8320 KB	Output is correct
15	Correct	43 ms	8268 KB	Output is correct
16	Correct	33 ms	7968 KB	Output is correct
17	Correct	35 ms	8016 KB	Output is correct
18	Correct	34 ms	8320 KB	Output is correct
19	Correct	30 ms	7924 KB	Output is correct
20	Correct	31 ms	8184 KB	Output is correct
21	Correct	30 ms	8404 KB	Output is correct

Subtask #4
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	6 ms	6604 KB	Output is correct
5	Correct	6 ms	6732 KB	Output is correct
6	Correct	5 ms	6604 KB	Output is correct
7	Correct	5 ms	6220 KB	Output is correct
8	Correct	6 ms	6732 KB	Output is correct
9	Correct	4 ms	6732 KB	Output is correct
10	Correct	5 ms	6092 KB	Output is correct
11	Correct	6 ms	6732 KB	Output is correct
12	Correct	5 ms	6220 KB	Output is correct
13	Correct	6 ms	6832 KB	Output is correct
14	Correct	6 ms	6860 KB	Output is correct
15	Correct	5 ms	6876 KB	Output is correct

Subtask #5
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	45 ms	7920 KB	Output is correct
2	Correct	41 ms	7936 KB	Output is correct
3	Correct	37 ms	7444 KB	Output is correct
4	Correct	36 ms	7956 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	6 ms	6604 KB	Output is correct
12	Correct	6 ms	6732 KB	Output is correct
13	Correct	5 ms	6604 KB	Output is correct
14	Correct	5 ms	6220 KB	Output is correct
15	Correct	6 ms	6732 KB	Output is correct
16	Correct	4 ms	6732 KB	Output is correct
17	Correct	35 ms	7932 KB	Output is correct
18	Correct	36 ms	8052 KB	Output is correct
19	Correct	38 ms	7872 KB	Output is correct
20	Correct	39 ms	8104 KB	Output is correct
21	Correct	48 ms	8320 KB	Output is correct
22	Correct	43 ms	8268 KB	Output is correct
23	Correct	33 ms	7968 KB	Output is correct
24	Correct	35 ms	8016 KB	Output is correct
25	Correct	34 ms	8320 KB	Output is correct
26	Correct	30 ms	7924 KB	Output is correct
27	Correct	31 ms	8184 KB	Output is correct
28	Correct	30 ms	8404 KB	Output is correct
29	Correct	5 ms	6092 KB	Output is correct
30	Correct	6 ms	6732 KB	Output is correct
31	Correct	5 ms	6220 KB	Output is correct
32	Correct	6 ms	6832 KB	Output is correct
33	Correct	6 ms	6860 KB	Output is correct
34	Correct	5 ms	6876 KB	Output is correct
35	Correct	1 ms	300 KB	Output is correct
36	Correct	38 ms	8792 KB	Output is correct
37	Correct	37 ms	9312 KB	Output is correct
38	Correct	39 ms	9304 KB	Output is correct
39	Correct	42 ms	9708 KB	Output is correct
40	Correct	40 ms	9708 KB	Output is correct
41	Correct	5 ms	6836 KB	Output is correct
42	Correct	35 ms	9176 KB	Output is correct
43	Correct	38 ms	9652 KB	Output is correct
44	Correct	40 ms	9572 KB	Output is correct
45	Correct	32 ms	9300 KB	Output is correct
46	Correct	32 ms	9684 KB	Output is correct
47	Correct	32 ms	9612 KB	Output is correct

답안 #499833

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