Submission #437024

# Submission time Handle Problem Language Result Execution time Memory
437024 2021-06-25T16:07:01 Z model_code Mutating DNA (IOI21_dna) C++17
100 / 100
111 ms 19788 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 i,int j)
{
    Matrix mat = prefixQuery(j+1);
    mat.sub(prefix[i]);
    return mat.swapdistance();
}
# Verdict Execution time Memory Grader output
1 Correct 85 ms 18116 KB Output is correct
2 Correct 72 ms 17988 KB Output is correct
3 Correct 94 ms 17988 KB Output is correct
4 Correct 95 ms 18060 KB Output is correct
5 Correct 12 ms 15936 KB Output is correct
6 Correct 11 ms 15948 KB Output is correct
7 Correct 12 ms 15948 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 15948 KB Output is correct
2 Correct 13 ms 15896 KB Output is correct
3 Correct 13 ms 15948 KB Output is correct
4 Correct 16 ms 16652 KB Output is correct
5 Correct 17 ms 16716 KB Output is correct
6 Correct 18 ms 16704 KB Output is correct
7 Correct 15 ms 16588 KB Output is correct
8 Correct 20 ms 16732 KB Output is correct
9 Correct 17 ms 16716 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 15948 KB Output is correct
2 Correct 13 ms 15896 KB Output is correct
3 Correct 13 ms 15948 KB Output is correct
4 Correct 16 ms 16652 KB Output is correct
5 Correct 17 ms 16716 KB Output is correct
6 Correct 18 ms 16704 KB Output is correct
7 Correct 15 ms 16588 KB Output is correct
8 Correct 20 ms 16732 KB Output is correct
9 Correct 17 ms 16716 KB Output is correct
10 Correct 74 ms 17988 KB Output is correct
11 Correct 88 ms 18012 KB Output is correct
12 Correct 74 ms 18248 KB Output is correct
13 Correct 80 ms 18376 KB Output is correct
14 Correct 72 ms 18396 KB Output is correct
15 Correct 87 ms 18396 KB Output is correct
16 Correct 83 ms 18368 KB Output is correct
17 Correct 70 ms 18372 KB Output is correct
18 Correct 80 ms 18408 KB Output is correct
19 Correct 67 ms 18348 KB Output is correct
20 Correct 62 ms 18376 KB Output is correct
21 Correct 84 ms 18408 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 15948 KB Output is correct
2 Correct 13 ms 15896 KB Output is correct
3 Correct 13 ms 15948 KB Output is correct
4 Correct 16 ms 16652 KB Output is correct
5 Correct 17 ms 16716 KB Output is correct
6 Correct 18 ms 16704 KB Output is correct
7 Correct 15 ms 16588 KB Output is correct
8 Correct 20 ms 16732 KB Output is correct
9 Correct 17 ms 16716 KB Output is correct
10 Correct 16 ms 16548 KB Output is correct
11 Correct 18 ms 16736 KB Output is correct
12 Correct 18 ms 16660 KB Output is correct
13 Correct 16 ms 16800 KB Output is correct
14 Correct 17 ms 16796 KB Output is correct
15 Correct 17 ms 16844 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 85 ms 18116 KB Output is correct
2 Correct 72 ms 17988 KB Output is correct
3 Correct 94 ms 17988 KB Output is correct
4 Correct 95 ms 18060 KB Output is correct
5 Correct 12 ms 15936 KB Output is correct
6 Correct 11 ms 15948 KB Output is correct
7 Correct 12 ms 15948 KB Output is correct
8 Correct 13 ms 15948 KB Output is correct
9 Correct 13 ms 15896 KB Output is correct
10 Correct 13 ms 15948 KB Output is correct
11 Correct 16 ms 16652 KB Output is correct
12 Correct 17 ms 16716 KB Output is correct
13 Correct 18 ms 16704 KB Output is correct
14 Correct 15 ms 16588 KB Output is correct
15 Correct 20 ms 16732 KB Output is correct
16 Correct 17 ms 16716 KB Output is correct
17 Correct 74 ms 17988 KB Output is correct
18 Correct 88 ms 18012 KB Output is correct
19 Correct 74 ms 18248 KB Output is correct
20 Correct 80 ms 18376 KB Output is correct
21 Correct 72 ms 18396 KB Output is correct
22 Correct 87 ms 18396 KB Output is correct
23 Correct 83 ms 18368 KB Output is correct
24 Correct 70 ms 18372 KB Output is correct
25 Correct 80 ms 18408 KB Output is correct
26 Correct 67 ms 18348 KB Output is correct
27 Correct 62 ms 18376 KB Output is correct
28 Correct 84 ms 18408 KB Output is correct
29 Correct 16 ms 16548 KB Output is correct
30 Correct 18 ms 16736 KB Output is correct
31 Correct 18 ms 16660 KB Output is correct
32 Correct 16 ms 16800 KB Output is correct
33 Correct 17 ms 16796 KB Output is correct
34 Correct 17 ms 16844 KB Output is correct
35 Correct 11 ms 15948 KB Output is correct
36 Correct 70 ms 18892 KB Output is correct
37 Correct 92 ms 18952 KB Output is correct
38 Correct 111 ms 19276 KB Output is correct
39 Correct 76 ms 19788 KB Output is correct
40 Correct 71 ms 19732 KB Output is correct
41 Correct 18 ms 16856 KB Output is correct
42 Correct 80 ms 19620 KB Output is correct
43 Correct 78 ms 19660 KB Output is correct
44 Correct 86 ms 19676 KB Output is correct
45 Correct 68 ms 19616 KB Output is correct
46 Correct 64 ms 19668 KB Output is correct
47 Correct 66 ms 19220 KB Output is correct