oj.uz

답안 #939875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
939875 2024-03-06T22:16:53 Z vladilius DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 113 ms 8708 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<char, char>;

string a, b;
int n;
vector<char> x = {'A', 'C', 'T'};
vector<int> pa, pc, pt, pa1, pc1, pt1;
map<pii, vector<int>> pr;

void init(string as, string bs){
    a = '#' + as; b = '#' + bs;
    n = (int) a.length();
    pa.resize(n + 1);
    pc.resize(n + 1);
    pt.resize(n + 1);
    pa1.resize(n + 1);
    pc1.resize(n + 1);
    pt1.resize(n + 1);
    for (int i = 1; i <= n; i++){
        pa[i] = pa[i - 1] + (a[i] == 'A');
        pc[i] = pc[i - 1] + (a[i] == 'C');
        pt[i] = pt[i - 1] + (a[i] == 'T');
        pa1[i] = pa1[i - 1] + (b[i] == 'A');
        pc1[i] = pc1[i - 1] + (b[i] == 'C');
        pt1[i] = pt1[i - 1] + (b[i] == 'T');
    }
    for (char i1: x){
        for (char i2: x){
            if (i1 == i2) continue;
            pr[{i1, i2}].resize(n + 1);
            for (int i = 1; i <= n; i++){
                pr[{i1, i2}][i] = pr[{i1, i2}][i - 1] + (a[i] == i1 && b[i] == i2);
            }
        }
    }
}

int get_distance(int l, int r){
    l++; r++;
    if ((pa[r] - pa[l - 1]) != (pa1[r] - pa1[l - 1])) return -1;
    if ((pc[r] - pc[l - 1]) != (pc1[r] - pc1[l - 1])) return -1;
    if ((pt[r] - pt[l - 1]) != (pt1[r] - pt1[l - 1])) return -1;
    map<pii, int> cnt;
    for (char i1: x){
        for (char i2: x){
            if (i1 == i2) continue;
            cnt[{i1, i2}] = pr[{i1, i2}][r] - pr[{i1, i2}][l - 1];
            if (!cnt[{i1, i2}]) cnt.erase({i1, i2});
        }
    }
    vector<pii> arr;
    for (auto [u, v]: cnt){
        arr.push_back(u);
    }
    int out = 0;
    for (auto p1: arr){
        pii p2 = {p1.second, p1.first};
        if (cnt.find(p2) == cnt.end()){
            continue;
        }
        int k1 = cnt[p1], k2 = cnt[p2];
        out += min(k1, k2);
        if (k1 > k2){
            cnt.erase(p2);
            cnt[p1] -= k2;
        }
        else {
            cnt.erase(p1);
            cnt[p2] -= k1;
            if (!cnt[p2]){
                cnt.erase(p2);
            }
        }
    }
    vector<int> f;
    for (auto [u, v]: cnt) f.push_back(v);
    sort(f.begin(), f.end());
    while (f.size() > 1){
        out += f[0];
        f.back() -= f[0];
        f.erase(f.begin());
        if (!f.back()) f.pop_back();
        sort(f.begin(), f.end());
    }
    if (!f.empty()) out += f[0];
    return out;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 7044 KB Output is correct
2 Correct 65 ms 7248 KB Output is correct
3 Correct 66 ms 6740 KB Output is correct
4 Correct 68 ms 7112 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 5984 KB Output is correct
5 Correct 9 ms 5980 KB Output is correct
6 Correct 10 ms 5724 KB Output is correct
7 Correct 11 ms 5464 KB Output is correct
8 Correct 10 ms 5980 KB Output is correct
9 Correct 8 ms 5980 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 5984 KB Output is correct
5 Correct 9 ms 5980 KB Output is correct
6 Correct 10 ms 5724 KB Output is correct
7 Correct 11 ms 5464 KB Output is correct
8 Correct 10 ms 5980 KB Output is correct
9 Correct 8 ms 5980 KB Output is correct
10 Correct 68 ms 7552 KB Output is correct
11 Correct 66 ms 8020 KB Output is correct
12 Correct 85 ms 7984 KB Output is correct
13 Correct 91 ms 8148 KB Output is correct
14 Correct 75 ms 8544 KB Output is correct
15 Correct 74 ms 7508 KB Output is correct
16 Correct 82 ms 8284 KB Output is correct
17 Correct 78 ms 7860 KB Output is correct
18 Correct 75 ms 8436 KB Output is correct
19 Correct 74 ms 8272 KB Output is correct
20 Correct 76 ms 8016 KB Output is correct
21 Correct 76 ms 8532 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 10 ms 5984 KB Output is correct
5 Correct 9 ms 5980 KB Output is correct
6 Correct 10 ms 5724 KB Output is correct
7 Correct 11 ms 5464 KB Output is correct
8 Correct 10 ms 5980 KB Output is correct
9 Correct 8 ms 5980 KB Output is correct
10 Correct 9 ms 5464 KB Output is correct
11 Correct 10 ms 5980 KB Output is correct
12 Correct 10 ms 5512 KB Output is correct
13 Correct 10 ms 5980 KB Output is correct
14 Correct 10 ms 6024 KB Output is correct
15 Correct 9 ms 5980 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 7044 KB Output is correct
2 Correct 65 ms 7248 KB Output is correct
3 Correct 66 ms 6740 KB Output is correct
4 Correct 68 ms 7112 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 10 ms 5984 KB Output is correct
12 Correct 9 ms 5980 KB Output is correct
13 Correct 10 ms 5724 KB Output is correct
14 Correct 11 ms 5464 KB Output is correct
15 Correct 10 ms 5980 KB Output is correct
16 Correct 8 ms 5980 KB Output is correct
17 Correct 68 ms 7552 KB Output is correct
18 Correct 66 ms 8020 KB Output is correct
19 Correct 85 ms 7984 KB Output is correct
20 Correct 91 ms 8148 KB Output is correct
21 Correct 75 ms 8544 KB Output is correct
22 Correct 74 ms 7508 KB Output is correct
23 Correct 82 ms 8284 KB Output is correct
24 Correct 78 ms 7860 KB Output is correct
25 Correct 75 ms 8436 KB Output is correct
26 Correct 74 ms 8272 KB Output is correct
27 Correct 76 ms 8016 KB Output is correct
28 Correct 76 ms 8532 KB Output is correct
29 Correct 9 ms 5464 KB Output is correct
30 Correct 10 ms 5980 KB Output is correct
31 Correct 10 ms 5512 KB Output is correct
32 Correct 10 ms 5980 KB Output is correct
33 Correct 10 ms 6024 KB Output is correct
34 Correct 9 ms 5980 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 65 ms 7628 KB Output is correct
37 Correct 71 ms 8276 KB Output is correct
38 Correct 108 ms 8020 KB Output is correct
39 Correct 111 ms 8216 KB Output is correct
40 Correct 113 ms 8596 KB Output is correct
41 Correct 8 ms 5980 KB Output is correct
42 Correct 104 ms 8144 KB Output is correct
43 Correct 107 ms 8272 KB Output is correct
44 Correct 108 ms 8608 KB Output is correct
45 Correct 82 ms 8176 KB Output is correct
46 Correct 82 ms 8708 KB Output is correct
47 Correct 82 ms 8180 KB Output is correct