oj.uz

답안 #756546

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756546 2023-06-11T21:15:18 Z caganyanmaz DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 55 ms 6252 KB 
#include <bits/stdc++.h>
using namespace std;

struct Fenwick
{
        int n;
        vector<int> data;
        Fenwick(int n) : n(n), data(n + 1) {}
        Fenwick() : Fenwick(0) {}
        void update(int i, int val) { for (++i;i<data.size();i+=i&(-i)) data[i] += val; }
        int get(int i) { int res=0; for (;i;i-=i&(-i)) res += data[i]; return res; }
        int get(int l, int r) { return get(r) - get(l); }
};

Fenwick d[3][3];
int v[3][3];

int cc(char c)
{
        switch (c)
        {
                case 'A':
                        return 0;
                case 'T':
                        return 1;
                case 'C':
                        return 2;
                default:
                        assert(false);
        }
}

void init(string a, string b)
{
        int n = a.size();
        for (int i = 0; i < 3; i++)
                for (int j = 0; j < 3; j++)
                        if (i != j)
                                d[i][j] = Fenwick(n);
        for (int i = 0; i < n; i++)
        {
                int x = cc(a[i]), y = cc(b[i]);
                if (x != y)
                        d[x][y].update(i, 1);
        }
}

bool check(int x)
{
        int sum = 0;
        for (int i = 0; i < 3; i++)
                sum += v[i][x] - v[x][i];
        return !sum;
}


int get_distance(int l, int r)
{
        r++;
        for (int i = 0; i < 3; i++)
                for (int j = 0; j < 3; j++)
                        v[i][j] = (i == j) ? 0 : d[i][j].get(l, r);
        //for (int i = 0; i < 3; i++)
        //{
        //      for (int j = 0; j < 3; j++)
        //              cout << v[i][j] << " ";
        //      cout << "\n";
        //}
        if (check(0) && check(1) && check(2))
        {
                return
                        min(v[0][1], v[1][0]) +
                        min(v[0][2], v[2][0]) +
                        min(v[1][2], v[2][1]) +
                        2 * (v[0][1] + v[1][0] - 2 * min(v[0][1], v[1][0]));
        }
        else
                return -1;

}

Compilation message

dna.cpp: In member function 'void Fenwick::update(int, int)':
dna.cpp:10:49: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |         void update(int i, int val) { for (++i;i<data.size();i+=i&(-i)) data[i] += val; }
      |                                                ~^~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 4508 KB Output is correct
2 Correct 50 ms 5816 KB Output is correct
3 Correct 44 ms 5524 KB Output is correct
4 Correct 45 ms 5860 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 3412 KB Output is correct
5 Correct 5 ms 3412 KB Output is correct
6 Correct 5 ms 3420 KB Output is correct
7 Correct 5 ms 3228 KB Output is correct
8 Correct 5 ms 3384 KB Output is correct
9 Correct 4 ms 3380 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 3412 KB Output is correct
5 Correct 5 ms 3412 KB Output is correct
6 Correct 5 ms 3420 KB Output is correct
7 Correct 5 ms 3228 KB Output is correct
8 Correct 5 ms 3384 KB Output is correct
9 Correct 4 ms 3380 KB Output is correct
10 Correct 46 ms 5768 KB Output is correct
11 Correct 46 ms 5836 KB Output is correct
12 Correct 44 ms 5976 KB Output is correct
13 Correct 55 ms 6076 KB Output is correct
14 Correct 51 ms 6244 KB Output is correct
15 Correct 51 ms 6120 KB Output is correct
16 Correct 46 ms 5908 KB Output is correct
17 Correct 43 ms 5992 KB Output is correct
18 Correct 45 ms 6132 KB Output is correct
19 Correct 45 ms 5864 KB Output is correct
20 Correct 40 ms 5968 KB Output is correct
21 Correct 44 ms 6128 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 3412 KB Output is correct
5 Correct 5 ms 3412 KB Output is correct
6 Correct 5 ms 3420 KB Output is correct
7 Correct 5 ms 3228 KB Output is correct
8 Correct 5 ms 3384 KB Output is correct
9 Correct 4 ms 3380 KB Output is correct
10 Correct 5 ms 3156 KB Output is correct
11 Correct 6 ms 3384 KB Output is correct
12 Correct 6 ms 3256 KB Output is correct
13 Correct 6 ms 3376 KB Output is correct
14 Correct 6 ms 3416 KB Output is correct
15 Correct 5 ms 3376 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 4508 KB Output is correct
2 Correct 50 ms 5816 KB Output is correct
3 Correct 44 ms 5524 KB Output is correct
4 Correct 45 ms 5860 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 6 ms 3412 KB Output is correct
12 Correct 5 ms 3412 KB Output is correct
13 Correct 5 ms 3420 KB Output is correct
14 Correct 5 ms 3228 KB Output is correct
15 Correct 5 ms 3384 KB Output is correct
16 Correct 4 ms 3380 KB Output is correct
17 Correct 46 ms 5768 KB Output is correct
18 Correct 46 ms 5836 KB Output is correct
19 Correct 44 ms 5976 KB Output is correct
20 Correct 55 ms 6076 KB Output is correct
21 Correct 51 ms 6244 KB Output is correct
22 Correct 51 ms 6120 KB Output is correct
23 Correct 46 ms 5908 KB Output is correct
24 Correct 43 ms 5992 KB Output is correct
25 Correct 45 ms 6132 KB Output is correct
26 Correct 45 ms 5864 KB Output is correct
27 Correct 40 ms 5968 KB Output is correct
28 Correct 44 ms 6128 KB Output is correct
29 Correct 5 ms 3156 KB Output is correct
30 Correct 6 ms 3384 KB Output is correct
31 Correct 6 ms 3256 KB Output is correct
32 Correct 6 ms 3376 KB Output is correct
33 Correct 6 ms 3416 KB Output is correct
34 Correct 5 ms 3376 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 47 ms 5608 KB Output is correct
37 Correct 48 ms 5828 KB Output is correct
38 Correct 46 ms 6036 KB Output is correct
39 Correct 46 ms 6168 KB Output is correct
40 Correct 51 ms 6156 KB Output is correct
41 Correct 3 ms 3412 KB Output is correct
42 Correct 47 ms 5936 KB Output is correct
43 Correct 41 ms 6128 KB Output is correct
44 Correct 42 ms 6128 KB Output is correct
45 Correct 40 ms 5912 KB Output is correct
46 Correct 42 ms 6116 KB Output is correct
47 Correct 42 ms 6252 KB Output is correct