oj.uz

답안 #438147

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
438147 2021-06-27T16:31:52 Z josiftepe DNA 돌연변이 (IOI21_dna) C++17
56 / 100
 51 ms 6316 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include "dna.h"
using namespace std;
const int maxn = 1e5 + 5;
int a_pref_sum[maxn][4];
int b_pref_sum[maxn][4];
int pref_sum[maxn];
string a, b;
vector<int> a_id[4], b_id[4];
int n;
void init(string a, string b) {
    memset(a_pref_sum, 0, sizeof a_pref_sum);
    memset(b_pref_sum, 0, sizeof b_pref_sum);
    
    n = (int) a.size();
    for(int i = 0; i < n; i++) {
        if(a[i] == 'C') a[i] = 'B';
        if(b[i] == 'C') b[i] = 'B';
    }
    for(int i = 0; i < n; i++) {
        if(a[i] == 'T') a[i] = 'C';
        if(b[i] == 'T') b[i] = 'C';
    }
    ::a = a;
    ::b = b;
    int cnt_a[3] = {0, 0, 0};
    int cnt_b[3] = {0, 0, 0};
    int sum = 0;
    for(int i = 0; i < n; i++) {
        int id_a = (int) (a[i] - 'A');
        int id_b = (int) (b[i] - 'A');
        cnt_a[id_a]++;
        cnt_b[id_b]++;
        for(int j = 0; j < 3; j++) {
            a_pref_sum[i][j] = cnt_a[j];
            b_pref_sum[i][j] = cnt_b[j];
        }
        if(a[i] != b[i]) {
            sum++;
        }
        pref_sum[i] = sum;
    }
   
}
int a_query(int &x, int &y, char c) {
    if(x == 0) {
        return a_pref_sum[y][c - 'A'];
    }
    return a_pref_sum[y][c - 'A'] - a_pref_sum[x - 1][c - 'A'];
}
int b_query(int &x, int &y, char c) {
    if(x == 0) {
        return b_pref_sum[y][c - 'A'];
    }
    return b_pref_sum[y][c - 'A'] - b_pref_sum[x - 1][c - 'A'];
}
int get_distance(int x, int y) {
    if(a_query(x, y, 'A') == b_query(x, y, 'A') and a_query(x, y, 'B') == b_query(x, y, 'B') and a_query(x, y, 'C') == b_query(x, y, 'C')) {
        if(x == 0) {
            return (pref_sum[y] + 1) / 2;
        }
        return (pref_sum[y] - pref_sum[x - 1] + 1) / 2;
        }
    
    return -1;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 5956 KB Output is correct
2 Correct 41 ms 5956 KB Output is correct
3 Correct 43 ms 5784 KB Output is correct
4 Correct 51 ms 5956 KB Output is correct
5 Correct 2 ms 3404 KB Output is correct
6 Correct 2 ms 3404 KB Output is correct
7 Correct 2 ms 3404 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 2 ms 3404 KB Output is correct
4 Correct 6 ms 4556 KB Output is correct
5 Correct 6 ms 4556 KB Output is correct
6 Correct 7 ms 4556 KB Output is correct
7 Correct 5 ms 4448 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 2 ms 3404 KB Output is correct
4 Correct 6 ms 4556 KB Output is correct
5 Correct 6 ms 4556 KB Output is correct
6 Correct 7 ms 4556 KB Output is correct
7 Correct 5 ms 4448 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct
10 Correct 42 ms 5956 KB Output is correct
11 Correct 50 ms 5956 KB Output is correct
12 Correct 44 ms 6128 KB Output is correct
13 Correct 42 ms 6196 KB Output is correct
14 Correct 42 ms 6216 KB Output is correct
15 Correct 49 ms 6212 KB Output is correct
16 Correct 39 ms 6212 KB Output is correct
17 Correct 38 ms 6220 KB Output is correct
18 Correct 38 ms 6244 KB Output is correct
19 Correct 38 ms 6208 KB Output is correct
20 Correct 37 ms 6196 KB Output is correct
21 Correct 38 ms 6316 KB Output is correct

Subtask #4
0.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 2 ms 3404 KB Output is correct
4 Correct 6 ms 4556 KB Output is correct
5 Correct 6 ms 4556 KB Output is correct
6 Correct 7 ms 4556 KB Output is correct
7 Correct 5 ms 4448 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4556 KB Output is correct
10 Correct 6 ms 4428 KB Output is correct
11 Correct 7 ms 4600 KB Output is correct
12 Incorrect 8 ms 4428 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 5956 KB Output is correct
2 Correct 41 ms 5956 KB Output is correct
3 Correct 43 ms 5784 KB Output is correct
4 Correct 51 ms 5956 KB Output is correct
5 Correct 2 ms 3404 KB Output is correct
6 Correct 2 ms 3404 KB Output is correct
7 Correct 2 ms 3404 KB Output is correct
8 Correct 3 ms 3404 KB Output is correct
9 Correct 2 ms 3404 KB Output is correct
10 Correct 2 ms 3404 KB Output is correct
11 Correct 6 ms 4556 KB Output is correct
12 Correct 6 ms 4556 KB Output is correct
13 Correct 7 ms 4556 KB Output is correct
14 Correct 5 ms 4448 KB Output is correct
15 Correct 6 ms 4556 KB Output is correct
16 Correct 5 ms 4556 KB Output is correct
17 Correct 42 ms 5956 KB Output is correct
18 Correct 50 ms 5956 KB Output is correct
19 Correct 44 ms 6128 KB Output is correct
20 Correct 42 ms 6196 KB Output is correct
21 Correct 42 ms 6216 KB Output is correct
22 Correct 49 ms 6212 KB Output is correct
23 Correct 39 ms 6212 KB Output is correct
24 Correct 38 ms 6220 KB Output is correct
25 Correct 38 ms 6244 KB Output is correct
26 Correct 38 ms 6208 KB Output is correct
27 Correct 37 ms 6196 KB Output is correct
28 Correct 38 ms 6316 KB Output is correct
29 Correct 6 ms 4428 KB Output is correct
30 Correct 7 ms 4600 KB Output is correct
31 Incorrect 8 ms 4428 KB Output isn't correct
32 Halted 0 ms 0 KB -