oj.uz

Submission #576712

# Submission time Handle Problem Language Result Execution time Memory
576712 2022-06-13T10:21:29 Z MohamedFaresNebili Mutating DNA (IOI21_dna) C++17
100 / 100
 56 ms 11504 KB 
#include <bits/stdc++.h>
#include "dna.h"
#include <ext/pb_ds/assoc_container.hpp>
 
        using namespace std;
        using namespace __gnu_pbds;
 
        using ll = long long;
        using ii = pair<int, int>;
        using vi = vector<int>;
 
        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second
        #define all(x) (x).begin(), (x).end()
        #define lb lower_bound
        #define ub upper_bound
 
        typedef tree<int, null_type, less<int>, rb_tree_tag,
            tree_order_statistics_node_update> indexed_set;
 
        int P[100001][3], Pr[100001][3];
        int M[100001][3], A[100001][3][3];
        string S, T; int N;
 
 
        void init(string a, string b) {
            S = a, T = b; N = S.length();
            vector<int> U, V;
 
            for(int l = 0; l < N; l++) {
                if(S[l] == 'A') U.pb(0);
                if(S[l] == 'C') U.pb(1);
                if(S[l] == 'T') U.pb(2);
 
                if(T[l] == 'A') V.pb(0);
                if(T[l] == 'C') V.pb(1);
                if(T[l] == 'T') V.pb(2);
            }
 
            for(int l = 0; l < N; l++) {
                P[l][U[l]]++; Pr[l][V[l]]++;
                M[l][U[l]] += (S[l] != T[l]);
                A[l][U[l]][V[l]]++;
                for(int i = 0; i < 3 && l > 0; i++) {
                    P[l][i] += P[l - 1][i];
                    Pr[l][i] += Pr[l - 1][i];
                    M[l][i] += M[l - 1][i];
                    for(int j = 0; j < 3; j++)
                        A[l][i][j] += A[l - 1][i][j];
                }
            }
        }
 
        int get_distance(int x, int y) {
            for(int l = 0; l < 3; l++) {
                int X = P[y][l], Y = Pr[y][l];
                if(x) X -= P[x - 1][l], Y -= Pr[x - 1][l];
                if(X != Y) return -1;
            }
            int best = 1e9 + 7;
            for(int l = 0; l < 3; l++) {
                int res = M[y][l];
                if(x) res -= M[x - 1][l];
 
                int X = (l + 1) % 3, Y = (l + 2) % 3;
 
                int U = M[y][X], V = M[y][Y];
                if(x) U -= M[x - 1][X], V -= M[x - 1][Y];
 
                int u = A[y][l][X], uu = A[y][X][l];
                if(x) u -= A[x - 1][l][X], uu -= A[x - 1][X][l];
 
                int v = A[y][l][Y], vv = A[y][Y][l];
                if(x) v -= A[x - 1][l][Y], vv -= A[x - 1][Y][l];
 
                U -= min(u, uu), V -= min(v, vv);
                
                res += min(U, V);
                best = min(best, res);
            }
            return best;
        }

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 11352 KB Output is correct
2 Correct 47 ms 11484 KB Output is correct
3 Correct 40 ms 10680 KB Output is correct
4 Correct 48 ms 11504 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 8 ms 9108 KB Output is correct
5 Correct 9 ms 9188 KB Output is correct
6 Correct 8 ms 9180 KB Output is correct
7 Correct 10 ms 8568 KB Output is correct
8 Correct 9 ms 9188 KB Output is correct
9 Correct 9 ms 9208 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 8 ms 9108 KB Output is correct
5 Correct 9 ms 9188 KB Output is correct
6 Correct 8 ms 9180 KB Output is correct
7 Correct 10 ms 8568 KB Output is correct
8 Correct 9 ms 9188 KB Output is correct
9 Correct 9 ms 9208 KB Output is correct
10 Correct 43 ms 11360 KB Output is correct
11 Correct 39 ms 11504 KB Output is correct
12 Correct 45 ms 10816 KB Output is correct
13 Correct 54 ms 11160 KB Output is correct
14 Correct 45 ms 11476 KB Output is correct
15 Correct 50 ms 11488 KB Output is correct
16 Correct 40 ms 10788 KB Output is correct
17 Correct 37 ms 11080 KB Output is correct
18 Correct 39 ms 11468 KB Output is correct
19 Correct 37 ms 10812 KB Output is correct
20 Correct 49 ms 10992 KB Output is correct
21 Correct 35 ms 11472 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 8 ms 9108 KB Output is correct
5 Correct 9 ms 9188 KB Output is correct
6 Correct 8 ms 9180 KB Output is correct
7 Correct 10 ms 8568 KB Output is correct
8 Correct 9 ms 9188 KB Output is correct
9 Correct 9 ms 9208 KB Output is correct
10 Correct 8 ms 8464 KB Output is correct
11 Correct 9 ms 9208 KB Output is correct
12 Correct 8 ms 8668 KB Output is correct
13 Correct 10 ms 9208 KB Output is correct
14 Correct 9 ms 9208 KB Output is correct
15 Correct 8 ms 9208 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 11352 KB Output is correct
2 Correct 47 ms 11484 KB Output is correct
3 Correct 40 ms 10680 KB Output is correct
4 Correct 48 ms 11504 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 8 ms 9108 KB Output is correct
12 Correct 9 ms 9188 KB Output is correct
13 Correct 8 ms 9180 KB Output is correct
14 Correct 10 ms 8568 KB Output is correct
15 Correct 9 ms 9188 KB Output is correct
16 Correct 9 ms 9208 KB Output is correct
17 Correct 43 ms 11360 KB Output is correct
18 Correct 39 ms 11504 KB Output is correct
19 Correct 45 ms 10816 KB Output is correct
20 Correct 54 ms 11160 KB Output is correct
21 Correct 45 ms 11476 KB Output is correct
22 Correct 50 ms 11488 KB Output is correct
23 Correct 40 ms 10788 KB Output is correct
24 Correct 37 ms 11080 KB Output is correct
25 Correct 39 ms 11468 KB Output is correct
26 Correct 37 ms 10812 KB Output is correct
27 Correct 49 ms 10992 KB Output is correct
28 Correct 35 ms 11472 KB Output is correct
29 Correct 8 ms 8464 KB Output is correct
30 Correct 9 ms 9208 KB Output is correct
31 Correct 8 ms 8668 KB Output is correct
32 Correct 10 ms 9208 KB Output is correct
33 Correct 9 ms 9208 KB Output is correct
34 Correct 8 ms 9208 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 40 ms 10736 KB Output is correct
37 Correct 43 ms 11504 KB Output is correct
38 Correct 43 ms 10972 KB Output is correct
39 Correct 43 ms 11504 KB Output is correct
40 Correct 48 ms 11440 KB Output is correct
41 Correct 7 ms 9188 KB Output is correct
42 Correct 42 ms 10924 KB Output is correct
43 Correct 38 ms 11376 KB Output is correct
44 Correct 39 ms 11360 KB Output is correct
45 Correct 39 ms 10812 KB Output is correct
46 Correct 40 ms 11376 KB Output is correct
47 Correct 36 ms 11364 KB Output is correct