oj.uz

답안 #529025

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
529025 2022-02-22T02:30:01 Z happypotato DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 47 ms 7408 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5 + 1;
int ps[mxN][9];
map<char, int> conv = {{'A', 0}, {'C', 1}, {'T', 2}};
void init(string a, string b) {
    int n = a.length();
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < 9; j++) {
            ps[i][j] = ps[i - 1][j];
            ps[i][j] = ps[i - 1][j];
        }
        ps[i][conv[a[i - 1]] * 3 + conv[b[i - 1]]]++;
    }
}
int get_distance(int x, int y) {
    x++; y++;
    int freq[9];
    for (int i = 0; i < 9; i++) freq[i] = ps[y][i] - ps[x - 1][i];
    int ans = 0;
    int cur;
    freq[0] = freq[4] = freq[8] = 0;
    cur = min(freq[1], freq[3]); ans += cur; freq[1] -= cur; freq[3] -= cur; // 01
    cur = min(freq[2], freq[6]); ans += cur; freq[2] -= cur; freq[6] -= cur; // 02
    cur = min(freq[5], freq[7]); ans += cur; freq[5] -= cur; freq[7] -= cur; // 12
    cur = min({freq[1], freq[5], freq[6]}); ans += cur * 2; freq[1] -= cur; freq[5] -= cur; freq[6] -= cur; // 012
    cur = min({freq[2], freq[7], freq[3]}); ans += cur * 2; freq[2] -= cur; freq[7] -= cur; freq[3] -= cur; // 021
    for (int i = 0; i < 9; i++) {
        if (freq[i]) return -1;
    }
    return ans;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 6912 KB Output is correct
2 Correct 33 ms 7024 KB Output is correct
3 Correct 47 ms 6612 KB Output is correct
4 Correct 38 ms 6928 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 4428 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 5 ms 4536 KB Output is correct
7 Correct 5 ms 4272 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 7 ms 4556 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 4428 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 5 ms 4536 KB Output is correct
7 Correct 5 ms 4272 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 7 ms 4556 KB Output is correct
10 Correct 37 ms 6916 KB Output is correct
11 Correct 37 ms 7008 KB Output is correct
12 Correct 34 ms 7028 KB Output is correct
13 Correct 39 ms 7176 KB Output is correct
14 Correct 36 ms 7396 KB Output is correct
15 Correct 45 ms 7268 KB Output is correct
16 Correct 32 ms 6996 KB Output is correct
17 Correct 32 ms 7132 KB Output is correct
18 Correct 33 ms 7260 KB Output is correct
19 Correct 33 ms 6992 KB Output is correct
20 Correct 29 ms 7164 KB Output is correct
21 Correct 31 ms 7296 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 4428 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 5 ms 4536 KB Output is correct
7 Correct 5 ms 4272 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 7 ms 4556 KB Output is correct
10 Correct 5 ms 4152 KB Output is correct
11 Correct 6 ms 4556 KB Output is correct
12 Correct 5 ms 4276 KB Output is correct
13 Correct 6 ms 4536 KB Output is correct
14 Correct 7 ms 4532 KB Output is correct
15 Correct 4 ms 4556 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 6912 KB Output is correct
2 Correct 33 ms 7024 KB Output is correct
3 Correct 47 ms 6612 KB Output is correct
4 Correct 38 ms 6928 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 5 ms 4428 KB Output is correct
12 Correct 5 ms 4556 KB Output is correct
13 Correct 5 ms 4536 KB Output is correct
14 Correct 5 ms 4272 KB Output is correct
15 Correct 5 ms 4556 KB Output is correct
16 Correct 7 ms 4556 KB Output is correct
17 Correct 37 ms 6916 KB Output is correct
18 Correct 37 ms 7008 KB Output is correct
19 Correct 34 ms 7028 KB Output is correct
20 Correct 39 ms 7176 KB Output is correct
21 Correct 36 ms 7396 KB Output is correct
22 Correct 45 ms 7268 KB Output is correct
23 Correct 32 ms 6996 KB Output is correct
24 Correct 32 ms 7132 KB Output is correct
25 Correct 33 ms 7260 KB Output is correct
26 Correct 33 ms 6992 KB Output is correct
27 Correct 29 ms 7164 KB Output is correct
28 Correct 31 ms 7296 KB Output is correct
29 Correct 5 ms 4152 KB Output is correct
30 Correct 6 ms 4556 KB Output is correct
31 Correct 5 ms 4276 KB Output is correct
32 Correct 6 ms 4536 KB Output is correct
33 Correct 7 ms 4532 KB Output is correct
34 Correct 4 ms 4556 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 35 ms 6628 KB Output is correct
37 Correct 39 ms 7012 KB Output is correct
38 Correct 34 ms 7232 KB Output is correct
39 Correct 35 ms 7396 KB Output is correct
40 Correct 35 ms 7408 KB Output is correct
41 Correct 4 ms 4556 KB Output is correct
42 Correct 33 ms 6988 KB Output is correct
43 Correct 45 ms 7264 KB Output is correct
44 Correct 36 ms 7276 KB Output is correct
45 Correct 31 ms 7052 KB Output is correct
46 Correct 30 ms 7284 KB Output is correct
47 Correct 33 ms 7260 KB Output is correct