oj.uz

답안 #437027

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
437027 2021-06-25T16:07:22 Z model_code DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 112 ms 18452 KB 
#include <iostream>
#include <string>
#include <cassert>
using namespace std;

const int MAX = 4;

struct Matrix
{
    int a[MAX][MAX];

    Matrix()
    {
        for (int i=0;i<MAX;i++)
        for (int j=0;j<MAX;j++)
            a[i][j] = 0;
    }

    void add(const Matrix &o)
    {
        for (int i=0;i<MAX;i++)
        for (int j=0;j<MAX;j++)
            a[i][j] += o.a[i][j];
    }

    void sub(const Matrix &o)
    {
        for (int i=0;i<MAX;i++)
        for (int j=0;j<MAX;j++)
            a[i][j] -= o.a[i][j];
    }

    int swapdistance() const
    {
        int mtot = 0;
        int si[MAX];
        for (int i=0;i<MAX;i++)
            si[i] = 0;
        for (int i=0;i<MAX;i++)
        for (int j=0;j<MAX;j++)
        {
            mtot += a[i][j];
            si[i] += a[i][j];
            si[j] -= a[i][j];
        }
        for (int node=0;node<MAX;node++)
        if (si[node])
            return -1;

        Matrix aux = *this;
        int cycles = 0;


        for (int i=0;i<MAX;i++)
        {
            cycles += aux.a[i][i];
            aux.a[i][i] = 0;
        }

        for (int i=0;i<MAX;i++)
        for (int j=0;j<i;j++)
        {
            int c = min(aux.a[i][j], aux.a[j][i]);
            cycles += c;
            aux.a[i][j] -= c;
            aux.a[j][i] -= c;
        }


        for (int i=0;i<MAX;i++)
        for (int j=0;j<i;j++)
        for (int k=0;k<j;k++)
        {
            int c;

            c = min(aux.a[i][j], min(aux.a[j][k], aux.a[k][i])); cycles += c; aux.a[i][j] -= c; aux.a[j][k] -= c; aux.a[k][i] -= c;;
            c = min(aux.a[i][k], min(aux.a[k][j], aux.a[j][i])); cycles += c; aux.a[i][k] -= c; aux.a[k][j] -= c; aux.a[j][i] -= c;;
        }

        int remainingEdges = 0;
        for (int i=0;i<MAX;i++)
        for (int j=0;j<MAX;j++)
            remainingEdges += aux.a[i][j];
        assert(remainingEdges % MAX == 0);
        cycles += remainingEdges / MAX;
        return mtot - cycles;
    }
};


const int MAXN = 250000;


Matrix prefix[MAXN+1];

void prefixAdd(int pos, const Matrix &value) {
    assert(0 <= pos);
    assert(pos < MAXN);
    pos++;
    prefix[pos].add(prefix[pos-1]);
    prefix[pos].add(value);
}

Matrix prefixQuery(int pos) {
    assert(0 <= pos);
    assert(pos <= MAXN);
    Matrix ret;
    ret.add(prefix[pos]);
    return ret;
}


int charValues[256];

string globalA, globalB;

void init(string a, string b)
{
    globalA = a;
    globalB = b;
    charValues['A'] = 0;
    charValues['T'] = 1;
    charValues['C'] = 2;
    charValues['G'] = 3;

    Matrix mat;
    for (int i=0;i<int(a.size());i++)
    {
        int x = charValues[int(a[i])];
        int y = charValues[int(b[i])];
        mat.a[x][y] = 1;
        prefixAdd(i, mat);
        mat.a[x][y] = 0;
    }

}
int get_distance(int p,int q)
{
    Matrix mat = prefixQuery(q+1);
    mat.sub(prefix[p]);
    int swaps = 0;
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < i; j++) {

            int c = min(mat.a[i][j], mat.a[j][i]);
            swaps += c;
            mat.a[i][j] -= c;
            mat.a[j][i] -= c;

            int k = 3 - i - j;
            c = min(mat.a[i][j], mat.a[j][k]);
            swaps += c;
            mat.a[i][j] -= c;
            mat.a[j][k] -= c;
            mat.a[i][k] += c;
        }
    }

    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < i; j++) {
            if (mat.a[i][j] != 0 || mat.a[j][i] != 0) {
                return -1;
            }
        }
    }
    return swaps;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 18056 KB Output is correct
2 Correct 82 ms 18048 KB Output is correct
3 Correct 76 ms 17988 KB Output is correct
4 Correct 78 ms 18028 KB Output is correct
5 Correct 11 ms 15948 KB Output is correct
6 Correct 11 ms 15916 KB Output is correct
7 Correct 11 ms 15872 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 15948 KB Output is correct
2 Correct 12 ms 15948 KB Output is correct
3 Correct 14 ms 15872 KB Output is correct
4 Correct 16 ms 16720 KB Output is correct
5 Correct 18 ms 16740 KB Output is correct
6 Correct 15 ms 16716 KB Output is correct
7 Correct 15 ms 16588 KB Output is correct
8 Correct 20 ms 16616 KB Output is correct
9 Correct 19 ms 16740 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 15948 KB Output is correct
2 Correct 12 ms 15948 KB Output is correct
3 Correct 14 ms 15872 KB Output is correct
4 Correct 16 ms 16720 KB Output is correct
5 Correct 18 ms 16740 KB Output is correct
6 Correct 15 ms 16716 KB Output is correct
7 Correct 15 ms 16588 KB Output is correct
8 Correct 20 ms 16616 KB Output is correct
9 Correct 19 ms 16740 KB Output is correct
10 Correct 63 ms 18040 KB Output is correct
11 Correct 87 ms 18032 KB Output is correct
12 Correct 62 ms 18340 KB Output is correct
13 Correct 67 ms 18380 KB Output is correct
14 Correct 74 ms 18416 KB Output is correct
15 Correct 70 ms 18400 KB Output is correct
16 Correct 60 ms 18300 KB Output is correct
17 Correct 78 ms 18376 KB Output is correct
18 Correct 61 ms 18428 KB Output is correct
19 Correct 69 ms 18356 KB Output is correct
20 Correct 61 ms 18424 KB Output is correct
21 Correct 60 ms 18452 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 15948 KB Output is correct
2 Correct 12 ms 15948 KB Output is correct
3 Correct 14 ms 15872 KB Output is correct
4 Correct 16 ms 16720 KB Output is correct
5 Correct 18 ms 16740 KB Output is correct
6 Correct 15 ms 16716 KB Output is correct
7 Correct 15 ms 16588 KB Output is correct
8 Correct 20 ms 16616 KB Output is correct
9 Correct 19 ms 16740 KB Output is correct
10 Correct 15 ms 16588 KB Output is correct
11 Correct 17 ms 16716 KB Output is correct
12 Correct 15 ms 16572 KB Output is correct
13 Correct 16 ms 16628 KB Output is correct
14 Correct 18 ms 16728 KB Output is correct
15 Correct 15 ms 16704 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 18056 KB Output is correct
2 Correct 82 ms 18048 KB Output is correct
3 Correct 76 ms 17988 KB Output is correct
4 Correct 78 ms 18028 KB Output is correct
5 Correct 11 ms 15948 KB Output is correct
6 Correct 11 ms 15916 KB Output is correct
7 Correct 11 ms 15872 KB Output is correct
8 Correct 11 ms 15948 KB Output is correct
9 Correct 12 ms 15948 KB Output is correct
10 Correct 14 ms 15872 KB Output is correct
11 Correct 16 ms 16720 KB Output is correct
12 Correct 18 ms 16740 KB Output is correct
13 Correct 15 ms 16716 KB Output is correct
14 Correct 15 ms 16588 KB Output is correct
15 Correct 20 ms 16616 KB Output is correct
16 Correct 19 ms 16740 KB Output is correct
17 Correct 63 ms 18040 KB Output is correct
18 Correct 87 ms 18032 KB Output is correct
19 Correct 62 ms 18340 KB Output is correct
20 Correct 67 ms 18380 KB Output is correct
21 Correct 74 ms 18416 KB Output is correct
22 Correct 70 ms 18400 KB Output is correct
23 Correct 60 ms 18300 KB Output is correct
24 Correct 78 ms 18376 KB Output is correct
25 Correct 61 ms 18428 KB Output is correct
26 Correct 69 ms 18356 KB Output is correct
27 Correct 61 ms 18424 KB Output is correct
28 Correct 60 ms 18452 KB Output is correct
29 Correct 15 ms 16588 KB Output is correct
30 Correct 17 ms 16716 KB Output is correct
31 Correct 15 ms 16572 KB Output is correct
32 Correct 16 ms 16628 KB Output is correct
33 Correct 18 ms 16728 KB Output is correct
34 Correct 15 ms 16704 KB Output is correct
35 Correct 10 ms 15856 KB Output is correct
36 Correct 65 ms 17944 KB Output is correct
37 Correct 66 ms 18028 KB Output is correct
38 Correct 77 ms 18360 KB Output is correct
39 Correct 87 ms 18412 KB Output is correct
40 Correct 112 ms 18416 KB Output is correct
41 Correct 17 ms 16676 KB Output is correct
42 Correct 57 ms 18340 KB Output is correct
43 Correct 60 ms 18408 KB Output is correct
44 Correct 76 ms 18352 KB Output is correct
45 Correct 53 ms 18376 KB Output is correct
46 Correct 58 ms 18436 KB Output is correct
47 Correct 78 ms 18400 KB Output is correct