Submission #863712

# Submission time Handle Problem Language Result Execution time Memory
863712 2023-10-20T18:00:26 Z VMaksimoski008 Mutating DNA (IOI21_dna) C++17
100 / 100
37 ms 11344 KB
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define int long long

using namespace std;
using ll = long long;

const int maxn = 1e5+5;

string a, b;
int n;
int prefix[3][3][maxn+1];

inline int32_t getHash(char &ch) {
    if(ch == 'A') return 0;
    if(ch == 'C') return 1;
    return 2;
}

void init(string x, string y) {
    a = x;
    b = y;
    n = sz(a);

   for(int i=0; i<3; i++)
    for(int j=0; j<3; j++)
        for(int k=0; k<n; k++)
            prefix[i][j][k+1] = prefix[i][j][k] + (getHash(a[k]) == i && getHash(b[k]) == j);
}

int32_t get_distance(int32_t x, int32_t y) {
    for(int i=0; i<3; i++) {
        int cnt1=0, cnt2=0;

        for(int j=0; j<3; j++) {
            cnt1 += prefix[i][j][y+1] - prefix[i][j][x];
            cnt2 += prefix[j][i][y+1] - prefix[j][i][x];
        }

        if(cnt1 != cnt2) return -1;
    }

    int ans1 = 0, ans2 = 0;

    int v[3][3];
    for(int i=0; i<3; i++)
        for(int j=0; j<3; j++)
            v[i][j] = prefix[i][j][y+1] - prefix[i][j][x];

    for(int i=0; i<3; i++) {
        for(int j=i+1; j<3; j++) {
            if(v[i][j] < v[j][i]) swap(v[i][j], v[j][i]);
            ans2 += v[i][j] - v[j][i];
            ans1 += v[j][i];
        }
    }

    return ans1 + ans2 / 3 * 2;
}

// int32_t main() {
//     int n, q;
//     cin >> n >> q;

//     string x, y;
//     cin >> x >> y;

//     init(x, y);
    
//     while(q--) {
//         int l, r;
//         cin >> l >> r;
//         cout << get_distance(l, r) << '\n';
//     }
//     return 0;
// }
# Verdict Execution time Memory Grader output
1 Correct 32 ms 10500 KB Output is correct
2 Correct 35 ms 10588 KB Output is correct
3 Correct 31 ms 10328 KB Output is correct
4 Correct 31 ms 10676 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 7 ms 8280 KB Output is correct
5 Correct 7 ms 8284 KB Output is correct
6 Correct 7 ms 8544 KB Output is correct
7 Correct 7 ms 8284 KB Output is correct
8 Correct 8 ms 8264 KB Output is correct
9 Correct 4 ms 8284 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 7 ms 8280 KB Output is correct
5 Correct 7 ms 8284 KB Output is correct
6 Correct 7 ms 8544 KB Output is correct
7 Correct 7 ms 8284 KB Output is correct
8 Correct 8 ms 8264 KB Output is correct
9 Correct 4 ms 8284 KB Output is correct
10 Correct 33 ms 10500 KB Output is correct
11 Correct 35 ms 10708 KB Output is correct
12 Correct 32 ms 10836 KB Output is correct
13 Correct 35 ms 10800 KB Output is correct
14 Correct 34 ms 10868 KB Output is correct
15 Correct 28 ms 11036 KB Output is correct
16 Correct 36 ms 10648 KB Output is correct
17 Correct 31 ms 11096 KB Output is correct
18 Correct 31 ms 10832 KB Output is correct
19 Correct 29 ms 10756 KB Output is correct
20 Correct 37 ms 10896 KB Output is correct
21 Correct 32 ms 10976 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 7 ms 8280 KB Output is correct
5 Correct 7 ms 8284 KB Output is correct
6 Correct 7 ms 8544 KB Output is correct
7 Correct 7 ms 8284 KB Output is correct
8 Correct 8 ms 8264 KB Output is correct
9 Correct 4 ms 8284 KB Output is correct
10 Correct 7 ms 8284 KB Output is correct
11 Correct 8 ms 8284 KB Output is correct
12 Correct 7 ms 8284 KB Output is correct
13 Correct 7 ms 8260 KB Output is correct
14 Correct 7 ms 8424 KB Output is correct
15 Correct 6 ms 8284 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 32 ms 10500 KB Output is correct
2 Correct 35 ms 10588 KB Output is correct
3 Correct 31 ms 10328 KB Output is correct
4 Correct 31 ms 10676 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 7 ms 8280 KB Output is correct
12 Correct 7 ms 8284 KB Output is correct
13 Correct 7 ms 8544 KB Output is correct
14 Correct 7 ms 8284 KB Output is correct
15 Correct 8 ms 8264 KB Output is correct
16 Correct 4 ms 8284 KB Output is correct
17 Correct 33 ms 10500 KB Output is correct
18 Correct 35 ms 10708 KB Output is correct
19 Correct 32 ms 10836 KB Output is correct
20 Correct 35 ms 10800 KB Output is correct
21 Correct 34 ms 10868 KB Output is correct
22 Correct 28 ms 11036 KB Output is correct
23 Correct 36 ms 10648 KB Output is correct
24 Correct 31 ms 11096 KB Output is correct
25 Correct 31 ms 10832 KB Output is correct
26 Correct 29 ms 10756 KB Output is correct
27 Correct 37 ms 10896 KB Output is correct
28 Correct 32 ms 10976 KB Output is correct
29 Correct 7 ms 8284 KB Output is correct
30 Correct 8 ms 8284 KB Output is correct
31 Correct 7 ms 8284 KB Output is correct
32 Correct 7 ms 8260 KB Output is correct
33 Correct 7 ms 8424 KB Output is correct
34 Correct 6 ms 8284 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 31 ms 10588 KB Output is correct
37 Correct 34 ms 10836 KB Output is correct
38 Correct 32 ms 11092 KB Output is correct
39 Correct 32 ms 11344 KB Output is correct
40 Correct 35 ms 11344 KB Output is correct
41 Correct 4 ms 8280 KB Output is correct
42 Correct 33 ms 11092 KB Output is correct
43 Correct 32 ms 11200 KB Output is correct
44 Correct 35 ms 11088 KB Output is correct
45 Correct 30 ms 11092 KB Output is correct
46 Correct 30 ms 11268 KB Output is correct
47 Correct 30 ms 11088 KB Output is correct