oj.uz

답안 #437026

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

using namespace std;

const int MAX = 5;

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];
    }

    void show() const
    {
        for (int i=0;i<MAX;i++) {
            for (int j=0;j<MAX;j++) {
                cout << a[i][j] << " ";
            }
            cout << "\n";
        }
    }

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

        Matrix aux = *this;
        int cycles = 0;

        // 1-cycles
        for (int i=0;i<MAX;i++)
        {
            cycles += aux.a[i][i];
            aux.a[i][i] = 0;
        }
        // 2-cycles
        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;
        }

        // 3-cycles
        for (int i=0;i<MAX;i++)
        for (int j=0;j<i;j++)
        for (int k=0;k<j;k++)
        {
            int c;
            #define do3(i,j,k) 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;
            do3(i,j,k);
            do3(i,k,j);
        }
        // 4-cycles
        for (int i=0;i<MAX;i++)
        for (int j=0;j<i;j++)
        for (int k=0;k<j;k++)
        for (int l=0;l<k;l++)
        {
            int c;
            #define do4(i,j,k,l) c = min(min(aux.a[i][j], aux.a[j][k]), min(aux.a[k][l], aux.a[l][i])); cycles += c; aux.a[i][j] -= c; aux.a[j][k] -= c; aux.a[k][l] -= c; aux.a[l][i] -= c;
            do4(i,j,k,l);
            do4(i,j,l,k);
            do4(i,k,j,l);
            do4(i,k,l,j);
            do4(i,l,j,k);
            do4(i,l,k,j);
        }
        // 5-cycles
        int remainingEdges = 0;
        for (int i=0;i<MAX;i++)
        for (int j=0;j<MAX;j++)
            remainingEdges += aux.a[i][j];
        assert(remainingEdges % 5 == 0);
        cycles += remainingEdges / 5;
        return mtot - cycles;
    }
};

const int MAXN = 250000;

Matrix fenwick[MAXN+1];

// logical fenwick array has indexes from 0 to MAXN-1, inclusive
// fenwickAdd(pos) adds the given value to index pos
// fenwickQuery(pos) returns the sum of range [0, pos)

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

Matrix fenwickQuery(int pos)
{
    assert(0 <= pos);
    assert(pos <= MAXN);
    Matrix ret;
    for (; pos > 0 ; pos -= pos&(-pos))
        ret.add(fenwick[pos]);
    return ret;
}

int charValues[256];

string globalA, globalB;

void init(string a, string b)
{
    globalA = a;
    globalB = b;
    charValues['A'] = 0;
    charValues['C'] = 1;
    charValues['G'] = 2;
    charValues['T'] = 3;
    charValues['U'] = 4;
    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;
        fenwickAdd(i, mat);
        mat.a[x][y] = 0;
    }
}

void modify(int k, int i, char xChar)
{
    Matrix mat;
    int x = charValues[int(globalA[i])];
    int y = charValues[int(globalB[i])];
    mat.a[x][y] -= 1;
    if (k == 0)
        globalA[i] = xChar;
    else
        globalB[i] = xChar;
    x = charValues[int(globalA[i])];
    y = charValues[int(globalB[i])];
    mat.a[x][y] += 1;
    fenwickAdd(i, mat);
}

int get_distance(int i,int j)
{
    Matrix mat = fenwickQuery(j+1);
    mat.sub(fenwickQuery(i));
    return mat.swapdistance();
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 203 ms 26816 KB Output is correct
2 Correct 219 ms 26832 KB Output is correct
3 Correct 204 ms 26756 KB Output is correct
4 Correct 283 ms 26840 KB Output is correct
5 Correct 17 ms 24648 KB Output is correct
6 Correct 17 ms 24736 KB Output is correct
7 Correct 17 ms 24648 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 24652 KB Output is correct
2 Correct 19 ms 24660 KB Output is correct
3 Correct 17 ms 24652 KB Output is correct
4 Correct 61 ms 25420 KB Output is correct
5 Correct 56 ms 25452 KB Output is correct
6 Correct 53 ms 25476 KB Output is correct
7 Correct 80 ms 25444 KB Output is correct
8 Correct 78 ms 25460 KB Output is correct
9 Correct 68 ms 25420 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 24652 KB Output is correct
2 Correct 19 ms 24660 KB Output is correct
3 Correct 17 ms 24652 KB Output is correct
4 Correct 61 ms 25420 KB Output is correct
5 Correct 56 ms 25452 KB Output is correct
6 Correct 53 ms 25476 KB Output is correct
7 Correct 80 ms 25444 KB Output is correct
8 Correct 78 ms 25460 KB Output is correct
9 Correct 68 ms 25420 KB Output is correct
10 Correct 222 ms 26828 KB Output is correct
11 Correct 210 ms 26832 KB Output is correct
12 Correct 240 ms 27064 KB Output is correct
13 Correct 250 ms 27112 KB Output is correct
14 Correct 226 ms 27216 KB Output is correct
15 Correct 214 ms 27104 KB Output is correct
16 Correct 186 ms 27176 KB Output is correct
17 Correct 182 ms 27180 KB Output is correct
18 Correct 211 ms 27216 KB Output is correct
19 Correct 175 ms 27184 KB Output is correct
20 Correct 167 ms 27192 KB Output is correct
21 Correct 202 ms 27232 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 24652 KB Output is correct
2 Correct 19 ms 24660 KB Output is correct
3 Correct 17 ms 24652 KB Output is correct
4 Correct 61 ms 25420 KB Output is correct
5 Correct 56 ms 25452 KB Output is correct
6 Correct 53 ms 25476 KB Output is correct
7 Correct 80 ms 25444 KB Output is correct
8 Correct 78 ms 25460 KB Output is correct
9 Correct 68 ms 25420 KB Output is correct
10 Correct 55 ms 25456 KB Output is correct
11 Correct 65 ms 25520 KB Output is correct
12 Correct 53 ms 25444 KB Output is correct
13 Correct 67 ms 25516 KB Output is correct
14 Correct 66 ms 25516 KB Output is correct
15 Correct 55 ms 25524 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 203 ms 26816 KB Output is correct
2 Correct 219 ms 26832 KB Output is correct
3 Correct 204 ms 26756 KB Output is correct
4 Correct 283 ms 26840 KB Output is correct
5 Correct 17 ms 24648 KB Output is correct
6 Correct 17 ms 24736 KB Output is correct
7 Correct 17 ms 24648 KB Output is correct
8 Correct 17 ms 24652 KB Output is correct
9 Correct 19 ms 24660 KB Output is correct
10 Correct 17 ms 24652 KB Output is correct
11 Correct 61 ms 25420 KB Output is correct
12 Correct 56 ms 25452 KB Output is correct
13 Correct 53 ms 25476 KB Output is correct
14 Correct 80 ms 25444 KB Output is correct
15 Correct 78 ms 25460 KB Output is correct
16 Correct 68 ms 25420 KB Output is correct
17 Correct 222 ms 26828 KB Output is correct
18 Correct 210 ms 26832 KB Output is correct
19 Correct 240 ms 27064 KB Output is correct
20 Correct 250 ms 27112 KB Output is correct
21 Correct 226 ms 27216 KB Output is correct
22 Correct 214 ms 27104 KB Output is correct
23 Correct 186 ms 27176 KB Output is correct
24 Correct 182 ms 27180 KB Output is correct
25 Correct 211 ms 27216 KB Output is correct
26 Correct 175 ms 27184 KB Output is correct
27 Correct 167 ms 27192 KB Output is correct
28 Correct 202 ms 27232 KB Output is correct
29 Correct 55 ms 25456 KB Output is correct
30 Correct 65 ms 25520 KB Output is correct
31 Correct 53 ms 25444 KB Output is correct
32 Correct 67 ms 25516 KB Output is correct
33 Correct 66 ms 25516 KB Output is correct
34 Correct 55 ms 25524 KB Output is correct
35 Correct 17 ms 24680 KB Output is correct
36 Correct 187 ms 26752 KB Output is correct
37 Correct 238 ms 26820 KB Output is correct
38 Correct 228 ms 27168 KB Output is correct
39 Correct 237 ms 27220 KB Output is correct
40 Correct 213 ms 27164 KB Output is correct
41 Correct 61 ms 25528 KB Output is correct
42 Correct 224 ms 27168 KB Output is correct
43 Correct 194 ms 27220 KB Output is correct
44 Correct 205 ms 27268 KB Output is correct
45 Correct 241 ms 27180 KB Output is correct
46 Correct 169 ms 27268 KB Output is correct
47 Correct 160 ms 27208 KB Output is correct