답안 #630821

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
630821	2022-08-17T07:13:22 Z	tmncollins	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	39 ms	10892 KB

#include "dna.h"
#include <stdio.h>
#include <vector>
#include <string>
#include <map>
#include <iostream>
#include <cmath>
#include <algorithm>

// g++ grader.cpp dna.cpp -o dna

using namespace std;

map<char, int> base;

struct pref {
    int arr[3][3], copy[3][3];

    pref() {
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                arr[i][j] = copy[i][j] = 0;
            }
        }
    }

    void add(pref p) {
        for (int a = 0; a < 3; a++) {
            for (int b = 0; b < 3; b++) {
                arr[a][b] += p.arr[a][b];
            }
        }
    }

    void subt(pref p) {
        for (int a = 0; a < 3; a++) {
            for (int b = 0; b < 3; b++) {
                arr[a][b] -= p.arr[a][b];
            }
        }
    }

    int dist() {
        int d = 0;

        for (int i = 0; i < 3; i++) {
            int a = 0, b = 0;
            for (int j = 0; j < 3; j++) {
                copy[i][j] = arr[i][j];
                a += arr[i][j];
                b += arr[j][i];
            }
            if (a != b) return -1;
        }

        int unpaired = 0;

        // directly swap a and b
        for (int a = 0; a < 3; a++) {
            for (int b = 0; b < a; b++) {
                int v = min(arr[a][b], arr[b][a]);
                copy[a][b] -= v;
                copy[b][a] -= v;
                d += v;
                unpaired += copy[a][b] + copy[b][a];
            }
        }

        unpaired /= 3;
        unpaired *= 2;

        return d + unpaired;

    }

    void output() {
        cout << "==========\n";
        for (int k = 0; k < 3; k++) {
            for (int i = 0; i < 3; i++)
                cout << arr[k][i] << " ";
            cout << "\n";
        }
        cout << "==========\n";
    }
};

vector<pref> prefix;

void init(string a, string b) {
    int size = a.size() + 1;
    prefix = vector<pref> (size);
    base['A'] = 0;
    base['C'] = 1;
    base['T'] = 2;

    prefix[0] = pref(); // A, C, T (1), A, C, T (2), diff

    for (int k = 1; k < size; k++) {
        int i = k-1;
        prefix[k] = prefix[k-1];
        int base_a = base[a[i]];
        int base_b = base[b[i]];

        prefix[k].arr[base_a][base_b]++;
//        prefix[k].arr[base_b][base_a]++;
    }

}

int get_distance(int x, int y) {
    pref a = prefix[x], b = prefix[y+1];
    b.subt(a);
//    b.output();

    return b.dist();
}

/*
*/

Subtask #1
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	9228 KB	Output is correct
2	Correct	35 ms	9344 KB	Output is correct
3	Correct	35 ms	8604 KB	Output is correct
4	Correct	36 ms	9372 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	296 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	6 ms	7892 KB	Output is correct
5	Correct	6 ms	7992 KB	Output is correct
6	Correct	7 ms	8020 KB	Output is correct
7	Correct	7 ms	7508 KB	Output is correct
8	Correct	7 ms	8020 KB	Output is correct
9	Correct	6 ms	7996 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	6 ms	7892 KB	Output is correct
5	Correct	6 ms	7992 KB	Output is correct
6	Correct	7 ms	8020 KB	Output is correct
7	Correct	7 ms	7508 KB	Output is correct
8	Correct	7 ms	8020 KB	Output is correct
9	Correct	6 ms	7996 KB	Output is correct
10	Correct	35 ms	9212 KB	Output is correct
11	Correct	36 ms	9300 KB	Output is correct
12	Correct	35 ms	9112 KB	Output is correct
13	Correct	39 ms	9344 KB	Output is correct
14	Correct	38 ms	9636 KB	Output is correct
15	Correct	35 ms	9612 KB	Output is correct
16	Correct	33 ms	9152 KB	Output is correct
17	Correct	35 ms	9368 KB	Output is correct
18	Correct	34 ms	9700 KB	Output is correct
19	Correct	29 ms	9216 KB	Output is correct
20	Correct	31 ms	9352 KB	Output is correct
21	Correct	35 ms	9736 KB	Output is correct

Subtask #4
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	6 ms	7892 KB	Output is correct
5	Correct	6 ms	7992 KB	Output is correct
6	Correct	7 ms	8020 KB	Output is correct
7	Correct	7 ms	7508 KB	Output is correct
8	Correct	7 ms	8020 KB	Output is correct
9	Correct	6 ms	7996 KB	Output is correct
10	Correct	7 ms	7396 KB	Output is correct
11	Correct	7 ms	8020 KB	Output is correct
12	Correct	6 ms	7508 KB	Output is correct
13	Correct	7 ms	8020 KB	Output is correct
14	Correct	8 ms	8028 KB	Output is correct
15	Correct	6 ms	8148 KB	Output is correct

Subtask #5
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	9228 KB	Output is correct
2	Correct	35 ms	9344 KB	Output is correct
3	Correct	35 ms	8604 KB	Output is correct
4	Correct	36 ms	9372 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	296 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Correct	6 ms	7892 KB	Output is correct
12	Correct	6 ms	7992 KB	Output is correct
13	Correct	7 ms	8020 KB	Output is correct
14	Correct	7 ms	7508 KB	Output is correct
15	Correct	7 ms	8020 KB	Output is correct
16	Correct	6 ms	7996 KB	Output is correct
17	Correct	35 ms	9212 KB	Output is correct
18	Correct	36 ms	9300 KB	Output is correct
19	Correct	35 ms	9112 KB	Output is correct
20	Correct	39 ms	9344 KB	Output is correct
21	Correct	38 ms	9636 KB	Output is correct
22	Correct	35 ms	9612 KB	Output is correct
23	Correct	33 ms	9152 KB	Output is correct
24	Correct	35 ms	9368 KB	Output is correct
25	Correct	34 ms	9700 KB	Output is correct
26	Correct	29 ms	9216 KB	Output is correct
27	Correct	31 ms	9352 KB	Output is correct
28	Correct	35 ms	9736 KB	Output is correct
29	Correct	7 ms	7396 KB	Output is correct
30	Correct	7 ms	8020 KB	Output is correct
31	Correct	6 ms	7508 KB	Output is correct
32	Correct	7 ms	8020 KB	Output is correct
33	Correct	8 ms	8028 KB	Output is correct
34	Correct	6 ms	8148 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	35 ms	9808 KB	Output is correct
37	Correct	35 ms	10552 KB	Output is correct
38	Correct	38 ms	10388 KB	Output is correct
39	Correct	36 ms	10888 KB	Output is correct
40	Correct	39 ms	10892 KB	Output is correct
41	Correct	5 ms	8024 KB	Output is correct
42	Correct	33 ms	10320 KB	Output is correct
43	Correct	34 ms	10772 KB	Output is correct
44	Correct	37 ms	10760 KB	Output is correct
45	Correct	31 ms	10388 KB	Output is correct
46	Correct	32 ms	10864 KB	Output is correct
47	Correct	32 ms	10796 KB	Output is correct

답안 #630821

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