oj.uz

Submission #672018

# Submission time Handle Problem Language Result Execution time Memory
672018 2022-12-14T15:47:38 Z tbzard Mutating DNA (IOI21_dna) C++17
100 / 100
 44 ms 8584 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, int> piipi;
typedef pair<pii, pii> piipii;

#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back

const char c[3] = {'A', 'C', 'T'};
int idx[500];
int idx2[5][5];
int sum[100005][9];
int sumA[100005][3];
int sumB[100005][3];

void init(string a, string b){
    for(int i=0;i<3;i++){
        idx[c[i]] = i;
    }
    for(int i=0;i<3;i++){
        for(int j=0;j<3;j++){
            idx2[idx[c[i]]][idx[c[j]]] = i*3 + j;
        }
    }
    int n = a.length();
    for(int i=1;i<=n;i++){
        int c1 = idx[a[i-1]];
        int c2 = idx[b[i-1]];
        sumA[i][c1] = 1;
        sumB[i][c2] = 1;
        for(int j=0;j<3;j++){
            sumA[i][j] += sumA[i-1][j];
            sumB[i][j] += sumB[i-1][j];
        }

        sum[i][idx2[c1][c2]] = 1;
        for(int j=0;j<3;j++){
            for(int k=0;k<3;k++){
                sum[i][idx2[j][k]] += sum[i-1][idx2[j][k]];
            }
        }
    }
}

int get_distance(int x, int y){
    x++, y++;
    int ans = 0, cnt = 0;
    for(int j=0;j<3;j++){
        if(sumA[y][j] - sumA[x-1][j] != sumB[y][j] - sumB[x-1][j]) return -1;
        cnt += sum[y][idx2[j][j]] - sum[x-1][idx2[j][j]];
    }
    for(int j=0;j<3;j++){
        for(int k=j+1;k<3;k++){
            ans += min(sum[y][idx2[j][k]]-sum[x-1][idx2[j][k]], sum[y][idx2[k][j]]-sum[x-1][idx2[k][j]]);
            cnt += min(sum[y][idx2[j][k]]-sum[x-1][idx2[j][k]], sum[y][idx2[k][j]]-sum[x-1][idx2[k][j]])*2;
        }
    }
    ans += (y-x+1 - cnt)/3 * 2;
    return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:26:16: warning: array subscript has type 'char' [-Wchar-subscripts]
   26 |         idx[c[i]] = i;
      |             ~~~^
dna.cpp:30:25: warning: array subscript has type 'char' [-Wchar-subscripts]
   30 |             idx2[idx[c[i]]][idx[c[j]]] = i*3 + j;
      |                      ~~~^
dna.cpp:30:36: warning: array subscript has type 'char' [-Wchar-subscripts]
   30 |             idx2[idx[c[i]]][idx[c[j]]] = i*3 + j;
      |                                 ~~~^
dna.cpp:35:28: warning: array subscript has type 'char' [-Wchar-subscripts]
   35 |         int c1 = idx[a[i-1]];
      |                            ^
dna.cpp:36:28: warning: array subscript has type 'char' [-Wchar-subscripts]
   36 |         int c2 = idx[b[i-1]];
      |                            ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 7940 KB Output is correct
2 Correct 36 ms 7976 KB Output is correct
3 Correct 36 ms 7472 KB Output is correct
4 Correct 36 ms 7944 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 7 ms 6612 KB Output is correct
5 Correct 8 ms 6740 KB Output is correct
6 Correct 7 ms 6692 KB Output is correct
7 Correct 7 ms 6228 KB Output is correct
8 Correct 8 ms 6804 KB Output is correct
9 Correct 8 ms 6868 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 7 ms 6612 KB Output is correct
5 Correct 8 ms 6740 KB Output is correct
6 Correct 7 ms 6692 KB Output is correct
7 Correct 7 ms 6228 KB Output is correct
8 Correct 8 ms 6804 KB Output is correct
9 Correct 8 ms 6868 KB Output is correct
10 Correct 38 ms 8072 KB Output is correct
11 Correct 42 ms 8200 KB Output is correct
12 Correct 35 ms 8044 KB Output is correct
13 Correct 37 ms 8192 KB Output is correct
14 Correct 39 ms 8460 KB Output is correct
15 Correct 37 ms 8372 KB Output is correct
16 Correct 34 ms 8088 KB Output is correct
17 Correct 37 ms 8216 KB Output is correct
18 Correct 36 ms 8456 KB Output is correct
19 Correct 33 ms 8112 KB Output is correct
20 Correct 33 ms 8212 KB Output is correct
21 Correct 34 ms 8488 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 7 ms 6612 KB Output is correct
5 Correct 8 ms 6740 KB Output is correct
6 Correct 7 ms 6692 KB Output is correct
7 Correct 7 ms 6228 KB Output is correct
8 Correct 8 ms 6804 KB Output is correct
9 Correct 8 ms 6868 KB Output is correct
10 Correct 8 ms 6240 KB Output is correct
11 Correct 9 ms 6796 KB Output is correct
12 Correct 9 ms 6432 KB Output is correct
13 Correct 9 ms 6752 KB Output is correct
14 Correct 9 ms 6820 KB Output is correct
15 Correct 9 ms 6748 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 7940 KB Output is correct
2 Correct 36 ms 7976 KB Output is correct
3 Correct 36 ms 7472 KB Output is correct
4 Correct 36 ms 7944 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 7 ms 6612 KB Output is correct
12 Correct 8 ms 6740 KB Output is correct
13 Correct 7 ms 6692 KB Output is correct
14 Correct 7 ms 6228 KB Output is correct
15 Correct 8 ms 6804 KB Output is correct
16 Correct 8 ms 6868 KB Output is correct
17 Correct 38 ms 8072 KB Output is correct
18 Correct 42 ms 8200 KB Output is correct
19 Correct 35 ms 8044 KB Output is correct
20 Correct 37 ms 8192 KB Output is correct
21 Correct 39 ms 8460 KB Output is correct
22 Correct 37 ms 8372 KB Output is correct
23 Correct 34 ms 8088 KB Output is correct
24 Correct 37 ms 8216 KB Output is correct
25 Correct 36 ms 8456 KB Output is correct
26 Correct 33 ms 8112 KB Output is correct
27 Correct 33 ms 8212 KB Output is correct
28 Correct 34 ms 8488 KB Output is correct
29 Correct 8 ms 6240 KB Output is correct
30 Correct 9 ms 6796 KB Output is correct
31 Correct 9 ms 6432 KB Output is correct
32 Correct 9 ms 6752 KB Output is correct
33 Correct 9 ms 6820 KB Output is correct
34 Correct 9 ms 6748 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 40 ms 7528 KB Output is correct
37 Correct 44 ms 8068 KB Output is correct
38 Correct 42 ms 8468 KB Output is correct
39 Correct 41 ms 8452 KB Output is correct
40 Correct 38 ms 8456 KB Output is correct
41 Correct 8 ms 6868 KB Output is correct
42 Correct 35 ms 8068 KB Output is correct
43 Correct 34 ms 8540 KB Output is correct
44 Correct 38 ms 8512 KB Output is correct
45 Correct 33 ms 8192 KB Output is correct
46 Correct 33 ms 8584 KB Output is correct
47 Correct 32 ms 8580 KB Output is correct