oj.uz

Submission #437029

# Submission time Handle Problem Language Result Execution time Memory
437029 2021-06-25T16:07:30 Z model_code Mutating DNA (IOI21_dna) C++17
71 / 100
 1500 ms 2432 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;
    }
};
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;
}



int get_distance(int i,int j)
{
    Matrix mat;
    for (int k = i; k <= j; k++) {
        int x = charValues[int(globalA[k])];
        int y = charValues[int(globalB[k])];
        mat.a[x][y] += 1;
    }
    return mat.swapdistance();
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 2372 KB Output is correct
2 Correct 59 ms 2432 KB Output is correct
3 Correct 46 ms 2316 KB Output is correct
4 Correct 46 ms 2372 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 972 KB Output is correct
5 Correct 3 ms 992 KB Output is correct
6 Correct 2 ms 1044 KB Output is correct
7 Correct 4 ms 972 KB Output is correct
8 Correct 5 ms 972 KB Output is correct
9 Correct 5 ms 972 KB Output is correct

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 972 KB Output is correct
5 Correct 3 ms 992 KB Output is correct
6 Correct 2 ms 1044 KB Output is correct
7 Correct 4 ms 972 KB Output is correct
8 Correct 5 ms 972 KB Output is correct
9 Correct 5 ms 972 KB Output is correct
10 Correct 48 ms 2356 KB Output is correct
11 Correct 75 ms 2364 KB Output is correct
12 Execution timed out 1594 ms 2072 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 972 KB Output is correct
5 Correct 3 ms 992 KB Output is correct
6 Correct 2 ms 1044 KB Output is correct
7 Correct 4 ms 972 KB Output is correct
8 Correct 5 ms 972 KB Output is correct
9 Correct 5 ms 972 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 2 ms 972 KB Output is correct
12 Correct 2 ms 972 KB Output is correct
13 Correct 4 ms 972 KB Output is correct
14 Correct 5 ms 972 KB Output is correct
15 Correct 4 ms 972 KB Output is correct

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 2372 KB Output is correct
2 Correct 59 ms 2432 KB Output is correct
3 Correct 46 ms 2316 KB Output is correct
4 Correct 46 ms 2372 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 3 ms 972 KB Output is correct
12 Correct 3 ms 992 KB Output is correct
13 Correct 2 ms 1044 KB Output is correct
14 Correct 4 ms 972 KB Output is correct
15 Correct 5 ms 972 KB Output is correct
16 Correct 5 ms 972 KB Output is correct
17 Correct 48 ms 2356 KB Output is correct
18 Correct 75 ms 2364 KB Output is correct
19 Execution timed out 1594 ms 2072 KB Time limit exceeded
20 Halted 0 ms 0 KB -