oj.uz

답안 #437030

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
437030 2021-06-25T16:07:34 Z model_code DNA 돌연변이 (IOI21_dna) C++17
35 / 100
 79 ms 18500 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]);
    if (mat.a[0][1] != mat.a[1][0]) {
        return -1;
    } else {
        return mat.a[0][1];
    }
}

Subtask #1
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 18016 KB Output is correct
2 Correct 61 ms 18092 KB Output is correct
3 Incorrect 75 ms 17984 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 15948 KB Output is correct
2 Correct 12 ms 15872 KB Output is correct
3 Correct 10 ms 15948 KB Output is correct
4 Correct 17 ms 16636 KB Output is correct
5 Correct 16 ms 16632 KB Output is correct
6 Correct 16 ms 16716 KB Output is correct
7 Correct 15 ms 16588 KB Output is correct
8 Correct 16 ms 16716 KB Output is correct
9 Correct 17 ms 16716 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 15872 KB Output is correct
3 Correct 10 ms 15948 KB Output is correct
4 Correct 17 ms 16636 KB Output is correct
5 Correct 16 ms 16632 KB Output is correct
6 Correct 16 ms 16716 KB Output is correct
7 Correct 15 ms 16588 KB Output is correct
8 Correct 16 ms 16716 KB Output is correct
9 Correct 17 ms 16716 KB Output is correct
10 Correct 67 ms 18016 KB Output is correct
11 Correct 70 ms 18020 KB Output is correct
12 Correct 67 ms 18292 KB Output is correct
13 Correct 79 ms 18372 KB Output is correct
14 Correct 65 ms 18380 KB Output is correct
15 Correct 63 ms 18372 KB Output is correct
16 Correct 56 ms 18372 KB Output is correct
17 Correct 59 ms 18396 KB Output is correct
18 Correct 62 ms 18428 KB Output is correct
19 Correct 66 ms 18356 KB Output is correct
20 Correct 56 ms 18468 KB Output is correct
21 Correct 57 ms 18500 KB Output is correct

Subtask #4
0.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 15948 KB Output is correct
2 Correct 12 ms 15872 KB Output is correct
3 Correct 10 ms 15948 KB Output is correct
4 Correct 17 ms 16636 KB Output is correct
5 Correct 16 ms 16632 KB Output is correct
6 Correct 16 ms 16716 KB Output is correct
7 Correct 15 ms 16588 KB Output is correct
8 Correct 16 ms 16716 KB Output is correct
9 Correct 17 ms 16716 KB Output is correct
10 Incorrect 16 ms 16588 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 18016 KB Output is correct
2 Correct 61 ms 18092 KB Output is correct
3 Incorrect 75 ms 17984 KB Output isn't correct
4 Halted 0 ms 0 KB -